Advertisement

NTRU in Constrained Devices

  • Daniel V. Bailey
  • Daniel Coffin
  • Adam Elbirt
  • Joseph H. Silverman
  • Adam D. Woodbury
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2162)

Abstract

The growing connectivity offered by constrained computing devices signals a critical need for public-key cryptography in such environments. By their nature, however, public-key systems have been difficult to implement in systems with limited computational power. The NTRU public-key cryptosystem addresses this problem by offering better computational performance than previous practical systems. The efficiency of NTRU is applied to a wide variety of constrained devices in this paper, including the Palm Computing Platform, Advanced RISC Machines ARM7TDMI, the Research in Motion pager, and finally, the Xilinx Virtex 1000 family of FPGAs. On each of these platforms, NTRU offers exceptional performance, enabling a new range of applications to make use of the power of public-key cryptography.

Keywords

Elliptic Curve Cryptography Modular Reduction Gate Count Limited Computational Power Extended Euclidean Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    D. V. Bailey and C. Paar. Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology, to appear.Google Scholar
  2. 2.
    D. Coppersmith and A. Shamir. Lattice attacks on NTRU. In Advances in Cryptography — EUROCRYPT’ 97, pages 52–61. Springer-Verlag, 1997. LNCS 1233.Google Scholar
  3. 3.
    J. Hoffstein, J. Pipher, and J. Silverman. NTRU: A new high speed public key cryptosystem. In J. Buhler, editor, Lecture Notes in Computer Science 1423: Algorithmic Number Theory (ANTS III), pages 267–288. Springer-Verlag, Berlin, 1998.Google Scholar
  4. 4.
    J. Hoffstein and J. Silverman. Optimizations for NTRU. In Proceedings of Public-Key Cryptography and Computational Number Theory. de Gruyter, Warsaw, September 2000.Google Scholar
  5. 5.
    J. Hoffstein and J. Silverman. Small hamming weight products in cryptography, preprint, September 2000.Google Scholar
  6. 6.
    J. S. J. Hoffstein, J. Pipher. NSS: An NTRU lattice-based signature scheme. In Advances in Cryptography — EUROCRYPT 2001. Springer-Verlag, 2001. to appear.Google Scholar
  7. 7.
    A. J. Menezes. Elliptic Curve Public Key Crypto systems. Kluwer Academic Publishers, Boston, 1993.Google Scholar
  8. 8.
    Xilinx Inc. Virtex 2.5V Field Programmable Gate Arrays, 1998.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Daniel V. Bailey
    • 1
    • 2
  • Daniel Coffin
    • 2
  • Adam Elbirt
    • 2
    • 4
  • Joseph H. Silverman
    • 3
    • 2
  • Adam D. Woodbury
    • 4
    • 2
  1. 1.Computer Science DepartmentBrown UniversityUSA
  2. 2.NTRU Cryptosystems, Inc.USA
  3. 3.Mathematics DepartmentBrown UniversityUSA
  4. 4.Electrical and Computer Engineering DepartmentWorcester Polytechnic InstituteUSA

Personalised recommendations