1,057 reputation
422
bio website
location
age
visits member for 2 years, 2 months
seen Jul 27 at 13:09

Oct
19
comment Using pairings to verify an extended euclidean relation without leaking the values?
The exact definition of the $P_i$, $q_i$, and $s$ are not really relevant to the question. But in case you really want to know the dirty details, look at the dirty details of set intersection queries...
Oct
19
suggested approved edit on Using pairings to verify an extended euclidean relation without leaking the values?
Oct
19
awarded  Custodian
Oct
19
reviewed Reviewed Tunnels used in md5
Oct
19
revised Self-expiring symmetric keys, or: cryptography in absence of secure deletion
edited tags
Oct
19
revised What exactly is addition modulo $2^{32}$ in cryptography?
edited tags
Oct
19
answered Shamir Secret Sharing - Threshold decryption implementation
Oct
19
awarded  Self-Learner
Oct
18
awarded  Organizer
Oct
18
revised Is AES in CBC mode secure if a known and/or fixed IV is used?
AES per se has no IV
Oct
18
suggested approved edit on Is AES in CBC mode secure if a known and/or fixed IV is used?
Oct
18
comment Hill Cipher known plaintext attack
+1 "All the vowels have the same parity."
Oct
18
awarded  Critic
Oct
18
answered Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Oct
18
comment Hill Cipher known plaintext attack
Also, do not forget that since you might know the underlying language and since you know the first, fourth, seventh, and tenth letter of the plaintext (from the two possible instances for the first row of the decryption matrix) you might be able to guess additional information.
Oct
18
comment Hill Cipher known plaintext attack
The first row of the decryption matrix is easily recovered (there are two possibilities unless I erred). jgrieu is correct that the decryption matrix cannot be determined entirely (there are two unknown parameters) but there are three letters ciphertexts that will have as an image a determined value, that is, independent of those parameters. Using this info (additional plaintext/ciphertext pairs) one might be able to infer a very low number of possible encryption matrices (far less than exhausting the two parameters).
Oct
18
revised Traditional DES scheme in Unix crypt function
added 139 characters in body
Oct
18
comment Is there a symmetric-key cryptography based on key establishment techniques?
You don't need a OWTF but basically a pseudo-random function (PRF). The purpose of the key derivation is to provide a session key and bind it to the communication specificities (date, end points, etc.); the nonces ensure freshness and do not require secrecy. It definitely does not increase the entropy of the secret.
Oct
18
revised Traditional DES scheme in Unix crypt function
added 90 characters in body
Oct
18
answered Traditional DES scheme in Unix crypt function