161 reputation
5
bio website
location
age
visits member for 3 years, 1 month
seen 2 days ago

Java is my favorite programming language, but python is a close second. I like to play with math and cryptography as well.


Sep
22
comment Most efficient conceivable padding mode, and with no padding oracle
This question appears to be off-topic because it is about a cryptography scheme unconnected to a programming topic.
Sep
12
comment Is there a string that's hash is equal to itself?
I have never seen a proof that it is impossible.
Nov
23
comment Efficient set up for a Montgomery multiplication
@fgrieu: Thanks for the link, I hadn't seen that paper before.
Nov
23
comment Efficient set up for a Montgomery multiplication
@fgrieu: You are miscounting. Montgomery does not replace a single division by O(b**2) multiplies, it replaces all the divisions those multiplies. But asymptotic analysis miss the point because the asymptotics are the same for both algorithms. Montgomery trades a division for a multiplies, adds, and a right shift. Actual experiments for most processors and implementations seem to show the Montgomery is a big win against the naive algorithm.
Nov
22
comment Efficient set up for a Montgomery multiplication
@fgrieu: Montgomery avoids division entirely.
Feb
20
comment Can one group the SHA-256 outputs depending on partial inputs?
A secure hash function, or even a not so great hash function, is not going to exhibit any of the properties you are looking for.
Feb
18
comment Any techniques for evading frequency based crypt analysis without encrypting?
Compression tends to flatten frequencies, but is of course designed to be undone and thus has no crypto value by itself.
Feb
18
comment What is the 'Version Incompatibility" Problem in TLS 1.1/1.2 and 1.0?
It sounds like at least two different problems, possibly more. I think the second problem you outline, the one mentioned in the TLS 1.2 RFC, is the one mentioned in your last paragraph.
Feb
18
comment What are the advantages of a static ECDH key?
Also on the advantage side, Alice only has half as much computation to do.
Feb
4
comment What is the key strength reduction encrypting only 160 bits of data using RSA1024 for signatures?
owlstead: You are correct, the amount of padding depends on the hash function and the key size. Rather than edit the answer, I'll just suggest that for full details the reader is encouraged to examine the RFCs linked to.
Jan
16
comment Key space size when either of two public keys are valid for authentication?
Your title mentions SHA256 but the text of your question doesn't, instead talking about public keys.
Mar
6
comment Is Wiener's attack on RSA extendable to larger keys with low hamming weight?
What is Smart, Inc? Can you provide a link? How low is the hamming weight? Without any more details than you given it is probably not possible to say.