Timeline for How do I derive the time complexity of encryption and decryption based on modular arithmetic?
Current License: CC BY-SA 4.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 7, 2021 at 7:11 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish link to PKCS#1
|
| May 7, 2021 at 5:34 | history | edited | fgrieu♦ | CC BY-SA 4.0 |
Polish
|
| Feb 3, 2013 at 13:12 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Clarify what the time complexity formula given for Schönhage–Strassen covers.
|
| Feb 3, 2013 at 12:45 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Fix all-important capitalization in some formulas
|
| Feb 3, 2013 at 12:35 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Proofreading
|
| Feb 3, 2013 at 12:18 | comment | added | fgrieu♦ | @almodawan: I now have improved my own understanding to the point that I can say: Yes! to your above comment. | |
| Feb 3, 2013 at 12:16 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Major rewrite
|
| Feb 2, 2013 at 23:57 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Grammar
|
| Feb 2, 2013 at 23:51 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Further work on the cost of modular inversion, with no more conclusion
|
| Feb 1, 2013 at 23:22 | comment | added | almodawan | Thank you for all. but I have wondered simple in last algorithm MP = C * k^-1 mod N. I can say D = k ^ -1 mod N// here complexity equal O(n^2) and MP = D * C mod N // here complexity is O(n^2). Then Total time is O(n^2)+O(n^2)=O(2 n^2) = O(n^2)............Just to make sure | |
| Feb 1, 2013 at 17:45 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Add polish and links
|
| Feb 1, 2013 at 14:42 | history | edited | fgrieu♦ | CC BY-SA 3.0 |
Polish
|
| Feb 1, 2013 at 13:00 | history | answered | fgrieu♦ | CC BY-SA 3.0 |