title: Most secure way to cipher a boolean using a deterministic algorithm?
body: <p>In one of my school works I am required to use a Deterministic algorithm (http://en.wikipedia.org/wiki/Deterministic_encryption)  to cipher several fields.</p>
  
  <p>In this specific case I have to cipher a table with booleans. This would be fine, except that using a deterministic algorithm to do so is pretty much useless. </p>
  
  <p>Why is that so? (you may ask)</p>
  
  <p>It happens that when I cipher (per example) the value "true", I always get the cipher text of "AB1" and when I cipher the value false, I always get the cipher text of "SQ2". So instead of having a table filled of values "true" and "false" I have a table filled with values "AB1" and "SQ2". 
  Any attacker will understand immediately that my table stores booleans and it won't take him long to figure that AB1=true and SQ2=false.</p>
  
  <p>This is what I want to prevent in my homework. To avoid this problem I tried using numbers with certain properties. Per example, a value of "true" is replace by a prime number, while a value of "false" is replaced by a non-prime number. Thus, my table will be filled with many different prime numbers and non prime numbers.</p>
  
  <p>This would be an acceptable solution if not for one little thing: the number of primes we can calculate is "limited" (it takes REALLY LONG to calculate big primes). In an interval of 10000000 numbers only 664579 are prime (only 6.64579% ).</p>
  
  <p>So I considered using odd numbers instead of prime numbers, but I am not sure about the quality of odd numbers. I think that an attacker will be able to retrieve the property of "oddness" from the ciphers and thus make an attack. </p>
  
  <p>Is my assumption about oddness correct?
  Are there any other solutions? 
  Do you guys have any ideas?</p>
  
  <p>I would really appreciate any help or ideas, thx in advance Pedro.</p>