meta user
network profile
| bio | website | |
|---|---|---|
| location | ||
| age | ||
| visits | member for | 1 year, 10 months |
| seen | Apr 24 at 2:36 | |
| stats | profile views | 29 |
|
Aug 28 |
comment |
How does asymmetric encryption work? Agreed regarding your specific constant, but perfect squares are easy to factor and there an infinite set of them. The fact that semiprime n=pq is vulnerable for certain values of p and q has led to the recommendation that p and q be "strong primes" in some RSA standards. (en.wikipedia.org/wiki/Strong_prime). |
|
Aug 27 |
comment |
How does asymmetric encryption work? Ah, like a semiprime then (en.wikipedia.org/wiki/Semiprime). These are not always hard to factor (perfect squares being the obvious example) but usually are, yes. |
|
Aug 27 |
comment |
How does asymmetric encryption work? 2^{243112609} is a very large number near a prime (it's one more than a prime). And I can factor it in my head. |
|
Aug 27 |
comment |
How does asymmetric encryption work? I would be careful to avoid saying that factorization is "extremely hard" but instead say that "no one knows how to do it efficiently." (And the truly correct statement is that "no one in the public community knows how to do it efficiently.") |
|
Aug 25 |
comment |
Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize? Thanks. Do you have any familiarity with the Morris, Rogaway, Stegers construction that uses Thorpe shuffles? (cs.ucdavis.edu/~rogaway/papers/thorp.pdf) |
|
Aug 24 |
comment |
Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize? Thanks Jack. I had never heard of FPE, but it's exactly what I was looking for. |
|
Aug 24 |
awarded | Quorum |
|
Aug 24 |
awarded | Student |
|
Aug 24 |
asked | Can you create a strong blockcipher with small blocksize, given a strong blockcipher of conventional blocksize? |
|
Aug 24 |
awarded | Supporter |
