Reputation
36,285
Next tag badge:
99/100 score
20/20 answers
Badges
2 56 151
Newest
 Good Answer
Impact
~630k people reached

Jun
10
revised Rationale for use of right-shift (rather than rotate) in SHA-2?
More explicit title; fix notation
Jun
10
revised Rationale for use of right-shift (rather than rotate) in SHA-2?
Simplify definition of SHR
Jun
10
revised Rationale for use of right-shift (rather than rotate) in SHA-2?
polish
Jun
10
revised Rationale for use of right-shift (rather than rotate) in SHA-2?
Give schedule
Jun
10
revised Residue requirements of Rabin-Williams primes?
typo
Jun
10
comment Residue requirements of Rabin-Williams primes?
In " minimum requirements " and " I'm not sure it's forbidden ", the crucial point is: required/forbidden BY WHAT? A standard? A particular implementation (or definition) of RW? The feasibility of a working implementation (or definition) of RW using $p\;q$ as the public modulus?
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
Polish, main point in bold
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
Illustrate the last point
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
add missing word
Jun
10
asked Rationale for use of right-shift (rather than rotate) in SHA-2?
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
Better explanation
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
Polish
Jun
10
revised Why does P1363 require RW signature with $0 ≤ s < n/2$?
better URL
Jun
10
answered Why does P1363 require RW signature with $0 ≤ s < n/2$?
Jun
10
revised Residue requirements of Rabin-Williams primes?
beautify
Jun
5
comment What's the inverse function of this decryption function?
For the very reason outlined in the question, it is not possible to make en encryption function accepting any arbitrary input (in particular with bytes in the 0x54 to 0x5B range, that is TUVWXYZ[ in ASCII) and such that the supplied decryption function will output the original plaintext.
Jun
5
comment Is the one-time-pad a secure system according to modern definitions?
@Bardi Hardborow: chacha20 as used e.g. in Chrome is a stream cipher (which keystream generator is generated by a CSPRNG, which is a PRF applied to a counter and a key); it is not an OTP, which keystream is true random, rather than derived from a key.
Jun
5
comment How do we know a cryptographic primitive won't fail suddenly?
" There is only a single cryptographic algorithm that is mathematically proven secure: the one-time pad. " requires an unusual definition of one-time pad to become true: it is easy to define a mathematically proven secure algorithm, as long as it require at least as much key material as the plaintext length. We can use a variety of substitute to XOR. It is even possible to make one where some of the key material is reused (e.g: XOR plaintext with pad used in previous session, then XOR with fresh pad of current session)
Jun
2
comment Advantages/Disadvantages of Bcrypt vs. hash/salt
Yes. In a nutshell, SHA3-512 has not work factor parameter, which is of paramount importance for password storage; and uses little RAM, which in this application is a drawback.
Jun
2
revised How to best obtain bit sequences from throwing normal dice?
polish