Reputation
6,586
Top tag
Next privilege 10,000 Rep.
Access moderator tools
Badges
1 11 34
Newest
 Quorum
Impact
~161k people reached

2d
accepted Single Party Encryption, Multi Party Decryption
2d
revised Determining Involutary Keys in Substitution Ciphers
deleted 6 characters in body
2d
comment Determining Involutary Keys in Substitution Ciphers
The symmetric group $S_n$ is defined as the set of all permutations over the elements of $\mathbb{Z}_n$ with composition of permutations being the group operation. If and only if an element in such a group is of order 2, then it meets the condition in your question, yes.
Feb
2
answered Determining Involutary Keys in Substitution Ciphers
Jan
30
comment Side channel security of HMAC in software
True, if the hardware leaks the number of bits affected by instructions that would otherwise be assumed to be atomic, all bets are off. This obviously begs the question exactly what might be assumed about the hardware?
Jan
30
comment Side channel security of HMAC in software
Are you aware of any kind of side channel attacks against SHA-1 or SHA-2? There are no data dependent table look-ups like in AES and the algorithms appear to have a completely input independent operation flow.
Jan
30
revised Is TLS secure against VM reset attacks?
added 483 characters in body
Jan
28
comment Can I use a one time pad key twice with random plaintext?
Let us continue this discussion in chat.
Jan
28
comment Can I use a one time pad key twice with random plaintext?
I understand your point from a purely semantic point of view, but in practice, as the example in my answer is written, there is no practical meaning to the notion of guessing the message with probability $2^{-n}$. There will still be no way to test which guess is correct, all alternatives will be equally probable, exactly because the message was random, secret and has been discarded, as stipulated.
Jan
27
revised Can I use a one time pad key twice with random plaintext?
added 19 characters in body
Jan
27
comment Can I use a one time pad key twice with random plaintext?
Isn't your point covered by the second paragraph in my answer? You will preserve the entropy of the message if you discard it immediately after transmission, but only then, and that's typically not what you want to do with messages.
Jan
27
comment Can I use a one time pad key twice with random plaintext?
a xor b || a xor c = b xor a || c xor a. The entropy is exactly the same.
Jan
27
revised Is TLS secure against VM reset attacks?
added 459 characters in body
Jan
27
revised Difference between Pseudo Mersenne primes and Generalized Mersenne primes
added 12 characters in body
Jan
27
revised Is TLS secure against VM reset attacks?
added 485 characters in body
Jan
27
answered Is TLS secure against VM reset attacks?
Jan
27
revised Difference between Pseudo Mersenne primes and Generalized Mersenne primes
added 182 characters in body
Jan
27
revised Difference between Pseudo Mersenne primes and Generalized Mersenne primes
added 182 characters in body
Jan
27
answered Difference between Pseudo Mersenne primes and Generalized Mersenne primes
Jan
21
revised Are there any successful preimage attacks?
added 592 characters in body