Reputation
2,326
Top tag
Next privilege 3,500 Rep.
Protect questions
Badges
1 6 18
Impact
~71k people reached

Jul
2
awarded  Good Question
Jun
11
answered Is there a cryptographic algorithm which is immune to side channel attacks?
Jun
6
revised Is the one-time-pad a secure system according to modern definitions?
tweak title (see comment)
Jun
6
comment Is the one-time-pad a secure system according to modern definitions?
@CodesInChaos: I realize the original title "Has the one-time pad been broken?" was a little provocative, but I think "Does the one-time-pad meet modern security definitions?" is ambiguous. The answer is either trivially "no" (a OTP doesn't do or meet anything; people and machines do things and meet people) or trivially yes (The modern definition of a OTP has critical details not present in early cryptography definitions, and of course a real OTP matches that definition, even though other things that people might mistakenly call a OTP do not). Feel free to tweak the title further.
Jun
6
awarded  Curious
Jun
5
awarded  Popular Question
Jun
5
revised Is the one-time-pad a secure system according to modern definitions?
yet another example
Jun
5
asked Is the one-time-pad a secure system according to modern definitions?
Apr
29
awarded  Famous Question
Mar
28
comment Are there any simple and yet secure encryption algorithms?
@archie: Did you maybe mean to link to the Simeck tweet on p. 23 of "Revisiting Counter Mode to Repair Galois/Counter Mode and Simeck: An Authenticated Cipher Design"?
Mar
28
comment Are there any simple and yet secure encryption algorithms?
@archie: Did you maybe mean to say that the SPECK128 cipher fits in one tweet ?
Mar
22
revised Is there a simple hash function that one can compute without a computer?
add pen-and-paper tag
Mar
7
answered Encryption of numeric value using playfair
Feb
19
answered Given infinite unencrypted and encrypted texts, can I find the algorithm?
Feb
14
awarded  Nice Answer
Dec
23
revised Implement deniable encryption with AES/RSA
add "deniable-encryption" tag
Dec
21
comment Any efficient text-based steganographic schemes?
Related: "Steganography to hide text within text"
Nov
9
answered How Secure is a Pronounceable Password? In means of entropy
Nov
9
answered Is it possible to decrypt the entire message with one half of the key in this example?
Sep
29
comment Cryptographic data structure: sparse array without membership test
If the person writing data could keep track of exactly what key,value pairs he has written so far (in some in-RAM structure that the attacker, and hence the reader, won't have access to once the computer is shut down), then perhaps the surprising-to-me dirty paper coding approach could be used -- rather than "most recent value wins" every collision, sometimes "let the older value win this collision" is better when there is enough error correction that the new value can still be recovered from other, non-colliding bits.