Henrick Hellström
Reputation
7,026
Top tag
Next privilege 10,000 Rep.
Access moderator tools
 Apr 15 comment Rijndael vs. Serpent vs. Twofish: General comparison The link in the answer belongs to an archived part of the nist web site that is supposed to remain the same for the overseeable future. It is up now, and it is a static page so it rarely goes down. If you have trouble connecting the problem is more likely closer to your end. Apr 14 comment What is the strength and attack vectors of this simple scheme? If you reveal something by sending a cipher text list $L$ that the attacker didn't already know, your scheme isn't secure. OTOH, if you manage to only reveal as much as the attacker already knows and secrecy is preserved, it would be a lot more efficient, and exactly as secure, to use some form of OTP. And an OTP is already considered impractical. Apr 14 answered What is the strength and attack vectors of this simple scheme? Apr 13 awarded Enlightened Apr 13 awarded Nice Answer Apr 12 comment Comparison of RSA and DRSA scheme using SageMath Is this ccis2k.org/iajit/PDF/vol.3,no.4/9-Padhey.pdf the DRSA scheme you are referring to? Mar 23 comment TLS padding format This is for historical reasons. TLS uses the same formats as SSL 3.0, which was designed by Netscape back in the mid 1990's. Mar 12 reviewed Approve Hardness of finding mutual discrete logarithms of small generators in $\mathbb{Z}_p$ Mar 12 comment How is injective, inverse, surjective & oneway related to cryptography? Regarding the last paragraph, a function will by definition return a single unequivocal output for each input; otherwise it is not a well-defined function, but a relation. However, a function might have a power set as codomain, meaning that the output could be interpreted as a "set of possible outputs". Mar 10 comment What is the intuition for ECDSA? Asking for "intuition" makes it hard to know in advance exactly what kind of answer you are hoping for. Could you perhaps relate your question to exactly what you find unclear e.g. in the Wikipedia article en.wikipedia.org/wiki/Digital_Signature_Algorithm? Mar 9 comment Using One Time Pad with a block cypher @ratchetfreak: You are correct, but the question stipulates that no key reuse cannot be assumed. Mar 9 reviewed Approve HMAC-SHA1 vs. AES Mar 3 comment Does RSA have two trapdoors? Do you have a link to the media from Khan University you reference? Mar 1 awarded Nice Answer Feb 26 reviewed Approve How easily could this method of cryptography be cracked? Feb 24 awarded Enlightened Feb 24 awarded Nice Answer Feb 23 comment Public key crypto without modular arithmetic? @mikemaccana: No, it doesn't matter. It doesn't matter if the numbers are primes, smooth or products of large primes - either way the number will be a large integer, and Eves attack works for any large integer, as long as it is not so large it will be infeasible to carry out any arithmetic operation at all on it. But if Alice and Bob are able to multiply and divide the numbers, so will Eve. Feb 20 comment Public key crypto without modular arithmetic? @CodesInChaos: Well, the difference is that with Shamir three-pass, the multiplication operations wouldn't be performed in the same group that the cipher text messages belong to. If the Diffie-Hellman assumption applies to the group, the "multiplication" would be impossible to compute. Feb 20 revised Public key crypto without modular arithmetic? added 354 characters in body