1,353 reputation
417
bio website
location Saarbrücken, Germany
age 27
visits member for 2 years, 10 months
seen Aug 29 at 20:53

Aug
11
reviewed Leave Open Alice's forgetful banking
Aug
11
comment Verify Messages to Embedded Device
Why would you need a new keypair for each device? It seems more sensible to have only one keypair (i.e. the keypair of your server) and embed the public ky into the devices. As the devices neither need to generate keys, nor produce signatures, their RNG is not a problem.
Jul
25
comment Hash function based on pseudorandom functions and security
In fact, a hash function can never be a PRF, because it is publicly computable.
Jul
25
awarded  Custodian
Jul
25
comment Hash function based on pseudorandom functions and security
@Thomas No, standard notions for hash functions definitely do not imply that a hash function is a PRF.
Jul
25
reviewed Approve suggested edit on Hash function based on pseudorandom functions and security
Jul
15
answered Primality testing (deterministic vs. non-deterministic)
Jul
15
comment Primality testing (deterministic vs. non-deterministic)
Compared to probabilistic algorithms AKS is horribly inefficient.
Jul
8
comment Difference between actual attacks and theoretical attacks on SHA cryptographic series
Mainly because "attacks only get better" A theoretical attack means, that somebody has found a way to attack the system faster than expected. This often leads to a series of better and better attacks until we have something that can actually be used against the system in practice.
Jul
5
answered Lamport-Diffie + Security Proof
Jul
1
reviewed Leave Open Why is “mod(n)” so central to most aspects of cryptography?
Jul
1
reviewed No Action Needed RSA by hand - did I do something wrong? (c = m on encryption)
Jul
1
reviewed No Action Needed How much stronger is RSA-2048 compared to RSA-1024?
Jun
28
reviewed No Action Needed Offline app authentication - embedding hashed password inside an encrypted file
Jun
28
comment P = NP and current cryptographic systems
As Henrick Hellström said, basically everything, where the security stems from information theoretic arguments would remain secure. Everything based on computational hardness should basically fail. The main problem is, that most cryptographic primitives cannot be implemented in a usable way without assuming computational hardness. (Think of symmetric encryption, sure OTP still works, but it isn't very usable in practice.)
Jun
27
answered P = NP and current cryptographic systems
Jun
24
reviewed Satisfactory Injecting salt into PyCrypto KDF - useful?
Jun
24
reviewed No Action Needed Map Bytes to Number
Jun
24
reviewed Reviewed Why are elliptic curves better than cyclic groups?
Jun
24
reviewed Close Is it possible to anonymize web traffic so that the IP Address cannot be determined while still being able to determine distinct IPs?