Databases
StackOverflow2013
Postsdbo
POMost secure way to cipher a boolean using a deterministic algorithm?
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POMost secure way to cipher a boolean using a deterministic algorithm?
    primarykey
    data
    text
    <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>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. This table or related slice is empty.
    1. USFlame_Phoenix
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. This table or related slice is empty.
      1. VTUpMod
    2. VO
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. This table or related slice is empty.
      1. VTUpMod
    3. VO
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. This table or related slice is empty.
      1. VTDownMod
    1. CO"Thus, my table will be filled with many different prime numbers and non prime numbers." How is that deterministic?
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. USCodesInChaos
    2. COUsing odd numbers for `true` and even numbers for `false` means that your boolean is represented by the lowest bit in the number. If you choose the other bits randomly it should be safe, if the numbers are sufficiently large (say 64 bit).
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. USstarblue
    3. CO@starblue Wow, I didn't think about that. Great feedback man, thanks!If you had posted this as an answer an not a comment I would have picked it as the definitive answer to my question :P
      singulars
      1. POMost secure way to cipher a boolean using a deterministic algorithm?
      1. USFlame_Phoenix
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload