This is a continuation of a discussion from a comment thread elsewhere.
Here is the basic question. When I see an incorrect answer, what would you recommend that I do?
I have always assumed that what I should do is downvote an incorrect answer, and (ideally) post a comment explaining why the a...
So suppose in order to avoid lose in transmission, a private key scheme $(Gen, Enc, Dec)$ is modified to be $(Gen, Enc^', Dec^')$, such that the message m is encrypted independently three times as $Enc^'(m)=(c_1,c_2,c_3)$ each $c_i=Enc(m)$. When for decryption, the 3 ciphertexts are d...
I have a simple problem: I have a set of users' ECDSA key pairs, and say I want to encrypt them with a simple algorithm. I have access to one variable that uniquely identifies the user, so I hash it with a SHA-2 algorithm and have a string of bytes longer than each of the keys.
Is it safe to XO...
Is Hiffie Hellman key exchange the same as RSA? - Diffie Hellman allows
key exchange on a observed wire - but so can RSA.
Alice and Bob want to exchange a key - Big brother is watching everything.
1) Bob makes an fresh RSA key pair and sends his public key to Alice.
2) Alice makes a random ses...
I`m currently implementing an ECDSA library based on curves like secp256k1. I would like to test it using some test vectors, like http://csrc.nist.gov/groups/STM/cavp/documents/dss/ecdsatestvectors.zip . Is there any place where I can get some vectors for testing encryption with that curve?
Exam...
I am using RSA to encrypt some data but I would like to eliminate the possibility of message replay. By message replay I mean sending a valid message multiple times to the original recipient. It is obvious that an attacker can capture a valid message without knowing its contents and replaying it....
This answer makes the claim that the Discrete Log problem and RSA are independent from a security perspective.
RSA labs makes a similar statement:
The discrete logarithm problem bears the same relation to these systems as factoring does to the RSA system: the security of these systems rests...
A (synchronous) stream cipher is an algorithm which maps some fixed-length key to an arbitrary-length key-stream (i.e. a sequence of bits): $C : \{0,1\}^k \to \{0,1\}^{\infty}$.
This key-stream is then XOR-ed with the plain text stream, giving the ciphertext stream.
For decrypting, the same key-...
@e5 No, go ahead. Edit also the titles of questions, if you are anyway editing them, and can think of a better wording. You might want to stop when the home page is filled by only your edits :-)
So suppose in order to avoid lose in transmission, a private key scheme $(Gen, Enc, Dec)$ is modified to be $(Gen, Enc^', Dec^')$, such that the message m is encrypted independently three times as $Enc^'(m)=(c_1,c_2,c_3)$ each $c_i=Enc(m)$. When for decryption, the 3 ciphertexts are d...
This answer makes the claim that the Discrete Log problem and RSA are independent from a security perspective.
RSA labs makes a similar statement:
The discrete logarithm problem bears the same relation to these systems as factoring does to the RSA system: the security of these systems rests...
