Timeline for Random Galois fields
Current License: CC BY-SA 3.0
3 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 12, 2015 at 17:02 | comment | added | Robert NACIRI | Take also a look at: web.itu.edu.tr/~orssi/dersler/cryptography/Montgomery.pdf The montgomery multiplication can be easily adapted to binary arithmetic, and allows more tricks in Hardware implementations. | |
| Jan 8, 2015 at 17:19 | history | edited | Dilip Sarwate | CC BY-SA 3.0 |
added 88 characters in body
|
| Jan 8, 2015 at 17:14 | history | answered | Dilip Sarwate | CC BY-SA 3.0 |