1 |
MIRACL, Multiprecision Integer and Rational Artihmetic C/C++ Library. hppt://www.shamus.ie/.
|
2 |
Koc. C. K, "High-Speed RSA Implementation," Technical Report TR-201, version 2.0, RSA Laboratiories, November 1994.
|
3 |
M. Scott and P. Szczechowiak, "Optimizing Multiprecision Multiplication for Public Key Cryptography," Cryptology ePrint Archive, Report 2007/299, 2007. http://eprint.iacr.org/.
|
4 |
H. Thapliyal and M.B. Srinivas, "An Efficient Method of Elliptic Curve Encryption Using Ancient Indian Vedic Mathematice," 48th IEEE MIDWEST Symposium on Circuits and Systems (MWSCAS 2005).
|
5 |
P. Szczechowiak, L. Olveira, M.Scott, M. Collier and R. Dahab, NonoECC: "Testing the limits of elliptic curve cryptography in sensor networks, Wireless Sensor Networks," (EWSN 2008), LNCS 4913 (2008), 305-320.
|
6 |
N. Gura, A. Patel,A. Wander, H. Eberle, and S.C. Shantz, "Comparing Elleptic Curve Cryptography and RSA on 8-bit CPUs. Proceedings of Workshop on Cryptographic Hardware and Embedded Systems," CHES 2004, 6th Intermational Workshop, pp.119-132, 2004.
|
7 |
P. Comba, "Exponentiation cryptosystems on the IBM PC," IBM Systems Journal, 29(4):526(538, 1990.
DOI
|
8 |
D. Zuras, "More on Squaring and Multiplying Large Integers," IEEE Transactions on Computers, vol.43, no.8, pp.899-908, August 1994.
DOI
ScienceOn
|
9 |
Leif Uhsadel, Axel Poschmann, and Christof Paar, "Enabling Full-Size Public-Key Algorithms on 8-bit Sensor Nodes," In Proceedings of ESAS 2007, volume 4572 of LNCS. Spriner, 2007. http://www.ist-ubisecsens.org/publications/ecc_esas2007.pdf.
|
10 |
Donald Knuth, The Art of Computer Programming, Third Edition, Volume Two, Seminumerical Algorithms, Addison-Wesley, 1998.
|
11 |
A. Karastuba and Y. Ofman, "Multiplication of Multidigit Numbers on Automata," Soviet PhysicsDoklady (English translation), vol.7, no.7, pp.595-596, 1963.
|