Reputation
1,417
Top tag
Next privilege 2,000 Rep.
Edit questions and answers
Badges
1 10 25
Impact
~58k people reached

Sep
28
suggested approved edit on Why use a 1-2 Oblivious Transfer instead of a 1 out of n Oblivious Transfer?
Sep
28
suggested approved edit on Does the generator size matter in Diffie-Hellman?
Sep
28
suggested approved edit on Does the generator size matter in Diffie-Hellman?
Sep
28
accepted Why use an Initialization Vector (IV)?
Sep
27
revised How can a random salt for a hash function work in practice?
Added line breaks and rewrote some sentiences for clarity.
Sep
27
revised What are the benefits of the two permutation tables in DES?
grammar retagging
Sep
27
suggested approved edit on What are the benefits of the two permutation tables in DES?
Sep
27
answered Time Capsule cryptography?
Sep
27
suggested approved edit on How can a random salt for a hash function work in practice?
Sep
27
revised Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Added spaces, list for readability, used tex notation
Sep
27
suggested approved edit on Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Sep
27
comment Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Can you find a citation that states that it is an open question if a break in DH would have implications for RSA?
Sep
27
revised Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
typo
Sep
27
comment How can I prevent a message replay with RSA?
@ChrisSmith Good point! We have three options: (1) as you pointed out storing the previous nonces works, (2). the first time a connection happens the nonce is generated and sent, each subsequent connection the nonce is incremented by 1 (since the attacker doesn't know the value of the nonce the attacker can't predict the new value of the nonce). (3). nonces passed between both parties and combined to generate new nonces (similar to the way syn cookies work en.wikipedia.org/wiki/…).
Sep
27
answered How can I prevent a message replay with RSA?
Sep
27
comment How can I prevent a message replay with RSA?
Why would including the expiration time in the message be insecure?
Sep
27
asked Would the ability to efficiently find Discrete Logs have any impact on the security of RSA?
Sep
27
comment Is Diffie-Hellman mathematically the same as RSA?
I think I might be wrong, but I thought I've heard the claim that breaking discrete log breaks/threatens RSA as well. Maybe this should be a question.
Sep
26
comment What is the best method to determine the language used in a monoalphabetic substitution cipher?
@128 - absence of whitespace is typical, most classical ciphers assume you remove whitespace. Solving classical ciphers can get a bit tricky, if you are really interested I'd recommend: 'Cryptanalysis: a study of ciphers and their solution' ( books.google.com/books/about/Cryptanalysis.html?id=fKNB-7y_Hs4C ). Also 'The American Black Chamber' (amazon.com/American-Black-Chamber-Cryptographic/dp/0894121545) has a bit of advice, examples on solving classical ciphers.
Sep
26
comment What is the best method to determine the language used in a monoalphabetic substitution cipher?
Certainly you can use a monogram frequency chart to guess the language. Another idea would be to use a common word such as in german 'ein' and look for three letters that have the same distance from each other (assuming it is a shift cipher). Where did you get a ciphertext in which you know so little about it, yet you know that it is monoalphabetic?