High-performance public-key cryptoprocessor for wireless mobile applications

Mobile Networks and Applications

Volumn 12, Issue 4, 2007, Pages 245-258

  Sakiyama, Kazuo ^a   Batina, Lejla ^a   Preneel, Bart ^a   Verbauwhede, Ingrid ^a  

^a UNIVERSITY OF LEUVEN   (Belgium)

Author keywords

Binary fields; Elliptic curve cryptography(ECC); Parallel processing; Public key cryptosystem

Indexed keywords

DIGITAL ARITHMETIC; MOBILE COMPUTING; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

BINARY FIELDS; CRYPTOPROCESSORS; ELLIPTIC CURVE CRYPTOGRAPHY; GENERIC CURVES; KOBLITZ CURVES; MONTGOMERY METHODS; PARALLELIZED MODULAR ARITHMETIC LOGIC UNITS; SCALAR MULTIPLICATIONS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 35348878140     PISSN: 1383469X     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11036-007-0020-6     Document Type: Article

References (36)

1. Diffie W, Hellman ME (1976) New directions in cryptography. IEEE Trans Inf Theor 22:644-654
2. Rivest RL, Shamir A, Adleman L (1978) A method for obtaining digital signatures and public-key cryptosystems. Commun ACM 21(2):120-126
3. Koblitz N (1987) Elliptic curve cryptosystem. Math Comput 48:203-209
4. Miller V (1985) Uses of elliptic curves in cryptography. In: Williams HC (ed) Advances in cryptology: Proceedings of CRYPTO'85, number 218 in lecture notes in computer science. Springer, pp 417-426
5. Blake I, Seroussi G, Smart NP (1999) Elliptic curves in cryptography. London mathematical society lecture note series. Cambridge Univ. Press
6. Hodjat A, Verbauwhede I (2006) Area-throughput trade-offs for fully pipelined 30 to 70 Gbits/s AES processors. IEEE Trans Comput 55(4):366-372, April
7. Wolkerstorfer J (2005) Scaling ECC hardware to a minimum. In: ECRYPT workshop-cryptographic advances in secure hardware-CRASH 2005, September 6-7 2005 (invited talk)
8. Kumar S, Paar C (2006) Are standards compliant elliptic curve cryptosystems feasible on RFID? In: Proceedings of Workshop on RFID Security
9. Batina L, Mentens N, Sakiyama K, Preneel B, Verbauwhede I (2006) Low-cost elliptic curve cryptography for wireless sensor networks. In: Proceedings of Third European Workshop on Security and Privacy in Ad Hoc and Sensor Networks, number 4357 in lecture notes in computer science. Springer, pp 415-429
10. Juels A (2006) RFID security and privacy: a research survey. IEEE J Sel Areas Commun 24(2):381-394, February
11. Abe M (1998) Universally verifiable mix-net with verification work independent of the number of mix-servers. In: Nyberg N (ed) Advances in cryptology: proceedings of EUROCRYPT'98, number 1403 in lecture notes in computer science. Springer, pp 437-447
12. Neff CA (2001) A verifiable secret shuffle and its application to e-voting. In: Proceedings of the 8th ACM Conference on Computer and Communications Security (CCS 2001), pp 116-125, November
13. Ostrovsky R, WE Skeith III (2005) Private searching on streaming data. In: Shoup V (ed) Advances in cryptology: proceedings of CRYPTO'05, number 3621 in lecture notes in computer science. Springer, pp 223-240
14. Smart NP (2001) The Hessian form of an elliptic curve. In: Koç ÇK, Naccache D, Paar C (eds) Proceedings of 3rd International Workshop on Cryptograpic Hardware and Embedded Systems (CHES), number 2162 in lecture notes in computer science. Springer, Paris, France, pp 121-128, May 14-16
15. IEEE P1363 / D13 (Draft Version 13) (1999) Standard specifications for public key cryptography, November
16. US Department of Commerce and National Institute of Standards and Technology (2000) Digital signature standard (DSS), FIPS PUB 186-2, January
17. Montgomery P (1987) Speeding the Pollard and elliptic curve methods of factorization. Math Comput 48(177):243-264
18. Solinas J (2000) Efficient arithmetic on koblitz curves. Designs Codes Cryptogr 19:195-249
19. Agnew GB, Mullin RC, Vanstone SA (1989) A fast elliptic curve cryptosystem. In: Quisquater J-J, Vandewalle J (eds) Advances in cryptology: proceedings of EUROCRYPT'89, number 434 in lecture notes in computer science. Springer, pp 706-708
20. Gao L, Shrivastava S, Lee H, Sobelman GE (1999) A compact fast variable key size elliptic curve cryptosystem coprocessor. In: Proceedings of the seventh annual IEEE symposium on field-programmable custom computing machines (FCCM), pp 304-305
21. m ). In: Koç ÇK, Paar C (eds) Proceedings of 2nd International Workshop on Cryptograpic Hardware and Embedded Systems (CHES), number 1965 in lecture notes in computer science. Springer-Verlag, pp 41-56
22. m ). In: Schulte M, Bhattacharyya S, Burgess N, Schreiber R (eds) Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, and Processors (ASAP), pp 444-454, June 24-26
23. Satoh A, Takano K (2003) A scalable dual-field elliptic curve cryptographic processor. IEEE Transactions on Computers, special issue on cryptographic hardware and embedded systems 52(4):449-460, April
24. Tenca AF, Koç ÇK (2003) A scalable architecture for modular multiplication based on Montgomerys algorithm. IEEE Trans Comput 52(9):1215-1221, September
25. Harris D, Krishnamurthy R, Andres M, Mathew S, Hsu S (2005) An improved unified scalable radix-2 montgomery multiplier. In: Proceedings of 14th IEEE Symposium on Computer Arithmetic (ARITH-17), pp 172-178
26. Saqib NA, Rodríguez-Henruez F, Díaz-Prez, A (2005) A reconfigurable processor for high speed point multiplication in elliptic curves. Int J of Embed Syst 2005 1(3/4):237-249
27. Sozzani F, Bertoni G, Turcato S, Breveglieri L (2005) A parallelized design for an elliptic curve cryptosystem coprocessor. In: International symposium on information technology: Coding and computing (ITCC 2005), pp 626-630
28. Sakiyama K, Batina L, Preneel B, Verbauwhede I (2006) Superscalar coprocessor for high-speed curve-based cryptography. In: Goublin L, Matsui M (eds) Proceedings of 8th International Workshop on Cryptographic Hardware and Embedded Systems (CHES), number 4249 in lecture notes in computer science. Springer, pp 415-429
29. Koblitz N (1998) Algebraic aspects of cryptography, 1st edn. Springer
30. Menezes A, Wu Y-H, Zuccherato R (1998) An elementary introduction to hyperelliptic curves-appendix. In: Koblitz N (ed) Algebraic aspects of cryptography. Springer, pp 155-178
31. Hankerson D, Menezes A, Vanstone S (2004) Guide to elliptic curves cryptography. Springer
32. m ). In: Koç ÇK, Paar C (eds) Proceedings of 1st International Workshop on Cryptographic Hardware and Embedded Systems (CHES), vol 1717 of lecture notes in computer science. Springer, pp 316-327
33. m ). Electron Lett 24(6):334-335
34. n ) for elliptic curve cryptosystems. In: The 12th IEEE Mediterranean Electrotechnical Conference (MELECON 2004), pp 779-782
35. Sakiyama K, Preneel B, Verbauwhede I (2006) A fast dual-field modular arithmetic logic unit and its hardware imlementation. In: Proceedings of IEEE International Symposium On Circuits and Systems (ISCAS'06), pp 787-790
36. Smyth N, McLoone M, McCanny JV (2006) An adaptable and scalable asymmetric cryptographic processor. In: Proceedings of the IEEE International Conference on Application-Specific Systems, Architectures, And Processors (ASAP). IEEE Computer Society, pp 341-346