271 reputation
15
bio website
location
age
visits member for 3 years, 4 months
seen Nov 25 at 11:10

Nov
25
answered Gap problem for Learning With Errors
Nov
25
comment Stateless hash based public key cryptography?
The tahoe-LAFS construction was refined and resulted in the following paper: eprint.iacr.org/2014/795
Aug
12
comment Deterministic Rand function for Winternitz One Time Signatures
Well, why do you need 256 bit outputs? You can always cut of if necessary. But you could also simply generate two blocks at a time. Regarding the nonce and key size.. I do not entirely remember but I think it allows for 256 nounce -256 key, have a look at the papers. And I mean not to build something out of it but simply to use it in plain to generate the values of the key pairs (they internally run a counter mode to produce long outputs, hence you can directly access any output).
Aug
1
awarded  Revival
Jul
31
answered What are good combinations of public key algorithms or primitives for long term security?
Jul
27
comment Deterministic Rand function for Winternitz One Time Signatures
1. There are standard primitives like ChaCha (currently in discussion for TLS). 2. For many stream ciphers you can access outputs directly, e.g. for ChaCha which is roughly a simple block cipher in counter mode and 3. ChaCha does not use an expensive key schedule.
Jul
25
awarded  Yearling
Jul
25
answered Merkle Tree High Tree
Jul
25
answered Why is Lamport-Diffie secure?
Jul
25
answered Deterministic Rand function for Winternitz One Time Signatures
Jul
25
answered Generalized Merkle Signatures, SHA-3 and Sakura
Mar
26
answered Questions about hash functions
Mar
26
comment Lamport signature: How many signatures are needed to forge a signature?
This is only true if the user signs random messages. If the attacker is allowed to choose the messages it uses the all 0 and the all 1 message and learns all secret key values... And the common model for security of signature schemes allows the attacker to choose the messages....
Mar
26
answered Asymmetric key derivation – Who derives the new pub key can't know the new private key
Aug
28
comment Fractal Merkle Traversal
The $ih$ is the offset of the subtree, i.e. $ih+0$ are the leaves of the subtree, $ih+1$ are the nodes on level $1$ in the subtree, and so on.
Aug
27
answered Is there a public key encryption scheme with optimal key size?
Aug
27
comment Fractal Merkle Traversal
"...and assume this tree of height 3 is our exist subtree." Yes, h=3
Aug
26
awarded  Revival
Aug
26
answered Quantum resistance of Lamport signatures
Aug
26
awarded  Supporter