meta user
network profile
| bio | website | |
|---|---|---|
| location | Wellington, New Zealand | |
| age | ||
| visits | member for | 1 year, 4 months |
| seen | 18 mins ago | |
| stats | profile views | 55 |
|
Oct 18 |
revised |
How can I implement the “Multiplication Modulo” and “Addition Modulo” operations in IDEA? added implicit modulo notes |
|
Oct 18 |
comment |
How can I implement the “Multiplication Modulo” and “Addition Modulo” operations in IDEA? @CodesInChaos thanks, I will add this to my answer. |
|
Oct 17 |
answered | How can I implement the “Multiplication Modulo” and “Addition Modulo” operations in IDEA? |
|
Oct 16 |
comment |
Are there secure stream ciphers that cannot be parallelized? There are ways to ensure the user can always compute the bitstream much faster than the attacker and still remain nonparallelizable, but these invariably require the user to know some secret "key". |
|
Oct 16 |
comment |
Are there secure stream ciphers that cannot be parallelized? "Time" is not a quantity usable by cryptographic algorithms. You've opened a can of worms - there is no way to reliably predict how long a hypothetical, possibly future attacker will take to compute your bitstream. Even assuming your cipher is ideally nonparallelizable, the attacker still gets constant speedup no matter what you do (perhaps he simply has a faster processor). You can always guesstimate, but by doing this you enter the realm of speculation. |
|
Oct 16 |
comment |
Are there secure stream ciphers that cannot be parallelized? Well, umm, current stream ciphers cannot be parallelized in general, the keystream generation is strictly sequential, although there are random-access schemes (such as a block cipher in CTR mode). |
|
Oct 14 |
comment |
password entropy calculation I think you meant 12.7 and not $2^{12.7}$ in your answer :) |
|
Oct 12 |
comment |
What is the recommended replacement for MD5? In their defense, it is hard to pronounce. |
|
Oct 12 |
revised |
Avalanche noise RNG for one-time pad use deleted incorrect stuff about mac |
|
Oct 12 |
comment |
Avalanche noise RNG for one-time pad use @CodesInChaos thanks for the heads up. |
|
Oct 10 |
comment |
Perfect security definitions I have typesetted your post to make it more readable - you can do it too by using LaTeX in between dollar signs. Feel free to edit your post if I accidentally changed the meaning of something. |
|
Oct 10 |
revised |
Perfect security definitions added latex |
|
Oct 10 |
comment |
In layman's terms, how does Shor's algorithm work? My take on it is that Shor's algorithm evaluates the period of $a^x \pmod{n}$ where $\gcd{(a, n)} = 1$. This is not efficient on a classical computer, but when run on a quantum computer, a miracle occurs and we get a congruence of squares with probability $0.5$ in polynomial time. The miracle part is, I guess, what you're asking.. but that requires physics and maths knowledge that's beyond me. |
|
Oct 9 |
answered | Avalanche noise RNG for one-time pad use |
|
Oct 8 |
awarded | Citizen Patrol |
|
Oct 6 |
revised |
RSA encryption input range - plaintexts that map to ciphertexts? wrong decryption exponent |
|
Oct 5 |
revised |
RSA encryption input range - plaintexts that map to ciphertexts? consistency is good |
|
Oct 5 |
answered | RSA encryption input range - plaintexts that map to ciphertexts? |
|
Oct 4 |
comment |
what is the best algorithm for file encryption to send over network? @RonanDejhero Perhaps you should add this relevant detail and everything else of importance in your original post. You can edit it. |
|
Oct 4 |
answered | what is the best algorithm for file encryption to send over network? |
