Timeline for Cryptography with general RSA type integers?
Current License: CC BY-SA 4.0
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Aug 8, 2018 at 8:36 | comment | added | Turbo | Even there is a typo 'size' should be 'side' same typo as in other answer. | |
| Aug 8, 2018 at 8:35 | comment | added | Turbo | The best known factorization algorithms depend only on the modulus unless the factors are small enough to enter the range feasible with Elliptic Curve Multiplication which has a cost which depends (mostly) on the size of the smallest factor. More generally, a batch RSA algorithm (not multiprime RSA) can be used to speed up batch processing of many RSA signatures at once in a server setting, with substantial speedups. The paper by Boneh and Scacham [here][1] describes these ideas. [1]: hovav.net/ucsd/dist/survey.pdf' | |
| Aug 8, 2018 at 8:35 | comment | added | Turbo | 'Having more than two prime factors is already supported by the PKCS#1 standard. This is called a "multiprime RSA" algorithm. On the plus size, this may offer some computational performance improvement via the Chinese Remainder Theorem. For instance, if you use a modulus with $k$ factors, the CRT speedup factor is about $k^2.$ However, using too small factors may weaken the modulus. | |
| Aug 8, 2018 at 8:34 | comment | added | Turbo | i don't know why answer below is getting upvote. This answer was pulled up from crypto.stackexchange.com/questions/11287/…. | |
| Aug 8, 2018 at 4:31 | comment | added | Turbo | @GerryMyerson Is there a multiparty protocol? In Diffie-Hellman extending to three party is straightforward. | |
| Aug 7, 2018 at 23:35 | answer | added | kodlu | timeline score: 4 | |
| Aug 7, 2018 at 22:44 | comment | added | Gerry Myerson | Does it help ... what, exactly? The question is not clear. | |
| Aug 7, 2018 at 21:03 | history | asked | Turbo | CC BY-SA 4.0 |