Reputation
4,259
Next tag badge:
47/100 score
29/20 answers
Badges
1 6 21
Newest
 Yearling
Impact
~40k people reached

May
6
answered Mutual verification of shared secret
May
6
comment How to map a handful of numbers in a large range to a much smaller range deterministically without collissions
It specifically can avoid picking the hashing function based on data. $\;$
May
6
comment How to map a handful of numbers in a large range to a much smaller range deterministically without collissions
Does the "deterministically" part rule out universal hashing? $\;$
May
4
reviewed Edit How do I prove IND-CPA security of RSA-OAEP?
May
4
revised How do I prove IND-CPA security of RSA-OAEP?
fixed typos
May
4
comment trying to get calculator and RSA calculatin does not make sense
en.wikipedia.org/wiki/Modular_multiplicative_inverse $\;$
May
4
comment Should we sign-then-encrypt, or encrypt-then-sign?
"To break the" scheme's semantic security, "an attacker would need to solve" a hash-Diffie-Hellman problem. $\:$ $S_1$ and $S_2$ are "optional shared information", and I don't see what would stop an attacker that knows $S_1$ and $S_2$ from getting Bob to accept arbitrary messages, although I haven't yet read up more on the scheme. $\;\;\;\;$
May
4
comment Should we sign-then-encrypt, or encrypt-then-sign?
I might do that when I get back to my computer again, but there's one possibility that occurred to me. $\:$ Are you talking about a version in which $R$ is Alice's public key? $\:$ (That's not how it's described on the wikipedia page you linked to.) $\;\;\;\;$
May
4
comment Should we sign-then-encrypt, or encrypt-then-sign?
Yes. $\:$ Is there public key authentication in that? $\;\;\;\;$
May
4
comment Should we sign-then-encrypt, or encrypt-then-sign?
The scheme described on the page you linked to does not provide public key authentication. $\hspace{.91 in}$
May
4
comment Format preserving encryption FFX
@MaartenBodewes : $\;\;\;$ There would need to be a suitable bijection such that [it and its inverse $\hspace{.62 in}$ can both be efficiently calculated] for that to work. $\:$ I'm pretty sure that that can't always be done. $\hspace{.5 in}$
May
3
comment Why is it a bad idea to use Diffie-Hellman with a prime such that $p - 1$ is smooth?
en.wikipedia.org/wiki/Pohlig–Hellman_algorithm $\;$
May
3
comment The difference between MAC algorithms and what to use
"encrypt also" $\: \mapsto \:$ "encrypt with also" $\;\;\;$ ? $\;\;\;\;\;\;\;\;$
May
3
comment Energy necessary for brute-forcing or decryption
It seems like it would be far more relevant to consider what happens if the "attacker" has the public key and the password-encrypted private key, rather than the key pair. $\;$
May
3
comment Energy necessary for brute-forcing or decryption
Is the private key really supposed to be on Bob's CD? $\;$
May
2
comment Format preserving encryption FFX
It doesn't ensure data integrity. $\:$ It doesn't ensure authentication. $\;\;\;\;$
May
2
revised Format preserving encryption FFX
fixed grammatical error and capitalization error
May
2
comment SipHash - 64 bit (second) preimage security?
What are "first and second preimage security of" a PRF? $\;$
May
1
comment Definition of the term “key”
No, both secret keys and private keys and public keys. $\;$
May
1
answered Definition of the term “key”