203 reputation
15
bio website
location Troy, NY
age 30
visits member for 2 years
seen Dec 18 at 5:33

Dec
18
awarded  Yearling
Dec
18
comment Why are primes important for encryption
@fkraiem - ok, that kind of makes sense but is a bit mathy for me since it's been 9 years since I last did my graduate level crypto and haven't been using it much since then. If you have an idea how to better rewrite the last paragraph, please feel free to suggest an edit. I'm not confident I'd get the correction right.
Dec
18
comment Why are primes important for encryption
@fkraiem - ok, maybe I need to learn more about ECC, but if it is still relative prime factoring based, then why is it more resistant to quantum factorization?
Dec
17
answered Why are primes important for encryption
Dec
17
awarded  Talkative
Oct
10
comment Is it possible to demonstrate that md5(x) != x for any x?
This might be a better fit for cryptography. I'm really not sure how this is security related.
Jun
26
awarded  Commentator
Mar
13
comment Why does SHA-1 have 80 rounds?
As a note, the larger versions of SHA-2 also have 80 rounds.
Aug
16
revised MIT says: mathematical theory behind encryption is wrong. What are the consequences?
added 8 characters in body
Aug
16
comment MIT says: mathematical theory behind encryption is wrong. What are the consequences?
Great answer. Gets my upvote. Thanks for taking the time to dig in to the paper as well.
Aug
16
comment MIT says: mathematical theory behind encryption is wrong. What are the consequences?
@imichaelmiers - updated to clarify my initial intent that it was talking about finding weaknesses based on any lack of ideal randomness since it only needs to find worst cases rather than average cases. Also agree it shouldn't be the accepted answer though. I responded quickly simply to indicate there was nothing major to see here and honestly didn't bother giving it much thought beyond that since it's a fluff paper without much in the way of significant merit from what I could tell. It was intentionally a minimal first answer and I fully agree that others have done better since I posted.
Aug
16
revised MIT says: mathematical theory behind encryption is wrong. What are the consequences?
deleted 6 characters in body
Aug
15
answered MIT says: mathematical theory behind encryption is wrong. What are the consequences?
Dec
10
awarded  Editor
Dec
10
revised Can I use PGP to sign a message without providing cryptographic non-repudation?
Updated to clarify on a concern raised in comments
Dec
10
comment Can I use PGP to sign a message without providing cryptographic non-repudation?
@DChest - I'd classify DH as asymmetric, but any part of DH mutually attests to the sender and recipient. The only thing DH provides that isn't non-repudiative is the shared key which is used by a symmetric algorithm. I do think I see where you are coming from though if you assumed I was taking a looser definition of asymmetric vs symmetric. I have updated my answer to provide further clarification on this point. Thanks.
Dec
10
awarded  Teacher
Dec
10
awarded  Supporter
Dec
10
comment Can I use PGP to sign a message without providing cryptographic non-repudation?
@Flimm - Incorrect. The only thing that can be non-repudiated is the providing of the shared key. A third party can not tell if the sender or the receiver performed the symmetric encryption since it is not reliant on any secret of the sender. In other terms, it only proves that sender talked to recipient at some time.
Dec
10
comment Can I use PGP to sign a message without providing cryptographic non-repudation?
@Flimm - put more briefly, Encrypt (public_key, symmetric_key) is incomplete. It is Encrypt(public_key, Sign(private_key, symmetric_key)). Thus all that can be proven directionally is that sender sent a key to recipient.