14,060 reputation
21660
bio website pwnhome.wordpress.com
location
age
visits member for 2 years, 11 months
seen 17 mins ago

I like crypto. Need I say more?


Mar
28
reviewed Approve suggested edit on one-time pad key related attack
Mar
27
comment one-time pad key related attack
What fgrieu is saying is, let's say your message space is small. Since the key is the same, if the same message is ever encrypted twice (which will happen if the message space is small), an observer can see that. That may or may not be a critical break in the system. I think it would do you well to more fully describe the application to us.
Mar
27
reviewed Approve suggested edit on one-time pad key related attack
Mar
27
comment one-time pad key related attack
What kind of randomness for the message are we talking about? Truly random or pseudorandom?
Mar
26
revised What is the probability of breaking the AES algorithm?
added 40 characters in body
Mar
26
reviewed Approve suggested edit on SSTP MSCHAP-V2 Authentication before SSL or after SSL Session
Mar
26
answered AES ENCRYPTION ALGORITHM
Mar
26
answered What is the probability of breaking the AES algorithm?
Mar
26
reviewed Approve suggested edit on What is the probability of breaking the AES algorithm?
Mar
24
comment Secure modulus length for Diffie-Hellman
@SmitJohnth, read the answer closer.
Mar
23
comment Secure modulus length for Diffie-Hellman
See this. I think your question is a duplicate or at least answered by the other.
Mar
12
awarded  Enlightened
Mar
12
awarded  Nice Answer
Mar
11
answered Isn't the structure of a potential plaintext of a ciphertext generated by a one-time pad dispositive, cryptanalysis-wise?
Mar
11
comment Method and explanation for calculating difference in speed between DES and RSA
See: wiki.openwrt.org/inbox/benchmark.openssl. Scroll down to "Comparison to other common systems". DES has a number around 30,000,000 and RSA has a number around 80 for sign and around 3,000 for verify. Couldn't see quickly what those numbers are, but that site might be a good starting place.
Mar
11
comment Understanding Feldman's VSS with a simple example
Awesome, that helped a lot. Is there a proper way to generate secure values for $p,q$? Basically we would one $p-1$ to have a large prime factor I'm assuming. But we'd also need to know that factor. Or even better, is there a semi-standard $p,q$ that will work?
Mar
11
comment Method and explanation for calculating difference in speed between DES and RSA
Of related interest.
Mar
11
comment computing inverses in truncated polynomial rings manually for NTRU encryption
A fairly simple algorithm (extended euclidean algorithm) tells you exactly what you need to do to solve the problem. To better understand the algorithm, start with simple integers as in this question
Mar
11
comment computing inverses in truncated polynomial rings manually for NTRU encryption
To be honest, there is typically a fair amount of work required to do this by hand even for such a small example. It requires long division of polynomials as you are basically doing the extended euclidean algorithm, then substituting back up until you get something of the form $p_1a+p_2b=1$ where $p_1,p_2$ are polynomials and $b=x^7-1$. Since $x^7-1\equiv 0$ in your ring, you have $p_1a=1$ so $a^{-1}=p_1$. Not sure if someone here will be willing to work everything out by hand. We'll see. Just being realistic though.
Mar
11
revised computing inverses in truncated polynomial rings manually for NTRU encryption
deleted 1 characters in body