Public-key cryptography on the top of a needle

Proceedings - IEEE International Symposium on Circuits and Systems

Volumn , Issue , 2007, Pages 1831-1834

  Batina, Lejla ^a   Mentens, Nele ^a   Sakiyama, Kazuo ^a   Preneel, Bart ^b   Verbauwhede, Ingrid ^b  

^a UNIVERSITY OF LEUVEN   (Belgium)

^b IBBT Kasteelpark Arenberg 10   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY SEQUENCES; DIGITAL ARITHMETIC; ELECTRIC POWER UTILIZATION; IDENTIFICATION (CONTROL SYSTEMS);

ARITHMETIC UNITS; PERFORMANCE FEATURES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 34548838049     PISSN: 02714310     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/iscas.2007.378270     Document Type: Conference Paper

References (12)

1. L. Batina, N. Mentens, K. Sakiyama, B. Preneel, and I. Verbauwhede. Low-cost Elliptic Curve Cryptography for wireless sensor networks. In L. Buttyan, V. Gligor, and D. Westhoff, editors, In Proceedings of Third European Workshop on Security and Privacy in Ad hoc and Sensor Networks, volume 4357 of LNCS, pages 6-17. Springer-Verlag, 2006.
2. I. Blake, G. Seroussi, and N. P. Smart. Elliptic Curves in Cryptography. London Mathematical Society Lecture Note Series. Cambridge University Press, 1999.
3. 2n and optimization of their arithmetic. Cryptology ePrint Archive: Report 2004/107.
4. G. Frey. How to disguise an elliptic curve (Weil descent). Presentation given at the 2nd Elliptic Curve Cryptography Workshop (ECC '98). Slides available at http://www.cacr.math.uwaterloo.ca/, September 14-16, 1998.
5. G. Gaubatz, J.-P. Kaps, E. Öztürk, and B. Sunar. State of the Art in Ultra-Low Power Public Key Cryptography for Wireless Sensor Networks. In 2nd IEEE International Workshop on Pervasive Computing and Communication Security (PerSec 2005), Kauai Island, Hawaii, March 2005.
6. A. Hodjat, L. Batina, D. Hwang, and I. Verbauwhede. HW/SW Codesign of a Hyperelliptic Curve Cryptosystem using a μCode Instruction Set Coprocessor. Elsevier Science Integration the VLSI Journal, 40(1):45-51, 2006.
7. N. Koblitz. A family of Jacobians suitable for Discrete Log Cryptosystems. In S. Goldwasser, editor, Advances in Cryptology: Proceedings of CRYPTO'88, number 403 in Lecture Notes in Computer Science, pages 94-99. Springer-Verlag, 1988.
8. S. Kumar and C. Paar. Are standards compliant elliptic curve cryptosystems feasible on RFID? In Proceedings of Workshop on RFID Security, page 19, Graz, Austria, July 2006.
9. m). In Ç. K. Koç and C. Paar, editors, Proceedings of 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES), volume 1717 of Lecture Notes in Computer Science, pages 316-327. Springer-Verlag, 1999.
10. A. Menezes, Y.-H. Wu, and R. Zuccherato. An Elementary Introduction to Hyperelliptic Curves - Appendix, pages 155-178. Springer-Verlag, 1998. N. Koblitz: Algebraic Aspects of Cryptography.
11. P. Montgomery. Speeding the Pollard and Elliptic Curve Methods of Factorization. Mathematics of Computation, Vol. 48:243-264, 1987.
12. J. Wolkerstorfer. Scaling ECC Hardware to a Minimum. In ECRYPT workshop - Cryptographic Advances in Secure Hardware - CRASH 2005, September 6-7 2005. invited talk.