Article

NTRU in Constrained Devices

Authors:

Adam D. WoodburyAuthors Info & Claims

CHES '01: Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems

Pages 262 - 272

Published: 14 May 2001 Publication History

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 offeringb etter computational performance than previous practical systems. The efficiency of NTRU is applied to a wide variety of constrained devices in this paper, includingthe Palm ComputingPlatform, 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, enablinga new range of applications to make use of the power of public-key cryptography.

References

[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]

D. Coppersmith and A. Shamir. Lattice attacks on NTRU. In Advances in Cryptography -- EUROCRYPT '97, pages 52-61. Springer-Verlag, 1997. LNCS 1233.

Crossref

Google Scholar

[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.

Crossref

Google Scholar

[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]

J. Hoffstein and J. Silverman. Small hamming weight products in cryptography. preprint, September 2000.

Google Scholar

[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.

Crossref

Google Scholar

[7]

A. J. Menezes. Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston, 1993.

Crossref

Google Scholar

[8]

Xilinx Inc. Virtex 2.5V Field Programmable Gate Arrays, 1998.

Google Scholar

Cited By

View all

Camacho-Ruiz ESánchez-Solano SBrox PMartínez-Rodríguez M(2021)Timing-Optimized Hardware Implementation to Accelerate Polynomial Multiplication in the NTRU AlgorithmACM Journal on Emerging Technologies in Computing Systems10.1145/344597917:3(1-16)Online publication date: 11-May-2021
https://dl.acm.org/doi/10.1145/3445979
Guillen OPöppelmann TMera JBongenaar ESigl GSepulveda J(2017)Towards post-quantum security for IoT endpoints with NTRUProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130548(698-703)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130548
Hellaoui HKoudil MBouabdallah A(2017)Energy-efficient mechanisms in security of the internet of thingsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.08.006127:C(173-189)Online publication date: 9-Nov-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.08.006
Show More Cited By

Recommendations

NTRU-v-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus
CCS '22: Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security

NTRUEncrypt is one of the first lattice-based encryption schemes. Furthermore, the earliest fully homomorphic encryption (FHE) schemes rely on the NTRU problem. Currently, NTRU is one of the leading candidates in the NIST post-quantum standardization ...
Analysis and Improvements of NTRU Encryption Paddings
CRYPTO '02: Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology

NTRU is an efficient patented public-key cryptosystem proposed in 1996 by Hoffstein, Pipher and Silverman. Although no devastating weakness of NTRU has been found, Jaulmes and Joux presented at Crypto '00 a simple chosen-ciphertext attack against NTRU ...
Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

Lattice-based signature schemes following the Goldreich–Goldwasser–Halevi (GGH) design have the unusual property that each signature leaks information on the signer’s secret key, but this does not necessarily imply that such schemes are insecure. At ...

Comments

Information & Contributors

Information

Published In

CHES '01: Proceedings of the Third International Workshop on Cryptographic Hardware and Embedded Systems

May 2001

409 pages

ISBN:3540425217

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 14 May 2001

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

14
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Camacho-Ruiz ESánchez-Solano SBrox PMartínez-Rodríguez M(2021)Timing-Optimized Hardware Implementation to Accelerate Polynomial Multiplication in the NTRU AlgorithmACM Journal on Emerging Technologies in Computing Systems10.1145/344597917:3(1-16)Online publication date: 11-May-2021
https://dl.acm.org/doi/10.1145/3445979
Guillen OPöppelmann TMera JBongenaar ESigl GSepulveda J(2017)Towards post-quantum security for IoT endpoints with NTRUProceedings of the Conference on Design, Automation & Test in Europe10.5555/3130379.3130548(698-703)Online publication date: 27-Mar-2017
https://dl.acm.org/doi/10.5555/3130379.3130548
Hellaoui HKoudil MBouabdallah A(2017)Energy-efficient mechanisms in security of the internet of thingsComputer Networks: The International Journal of Computer and Telecommunications Networking10.1016/j.comnet.2017.08.006127:C(173-189)Online publication date: 9-Nov-2017
https://dl.acm.org/doi/10.1016/j.comnet.2017.08.006
Nuñez DAgudo ILopez JBao FMiller SZhou JAhn G(2015)NTRUReEncryptProceedings of the 10th ACM Symposium on Information, Computer and Communications Security10.1145/2714576.2714585(179-189)Online publication date: 14-Apr-2015
https://dl.acm.org/doi/10.1145/2714576.2714585
Boorghany ASarmadi SJalili R(2015)On Constrained Implementation of Lattice-Based Cryptographic Primitives and Schemes on Smart CardsACM Transactions on Embedded Computing Systems10.1145/270007814:3(1-25)Online publication date: 21-Apr-2015
https://dl.acm.org/doi/10.1145/2700078
Pöppelmann TGüneysu T(2013)Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable HardwareRevised Selected Papers on Selected Areas in Cryptography -- SAC 2013 - Volume 828210.1007/978-3-662-43414-7_4(68-85)Online publication date: 14-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-662-43414-7_4
Pöppelmann TGüneysu T(2012)Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardwareProceedings of the 2nd international conference on Cryptology and Information Security in Latin America10.1007/978-3-642-33481-8_8(139-158)Online publication date: 7-Oct-2012
https://dl.acm.org/doi/10.1007/978-3-642-33481-8_8
Heyse SGüneysu T(2012)Towards one cycle per bit asymmetric encryptionProceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems10.1007/978-3-642-33027-8_20(340-355)Online publication date: 9-Sep-2012
https://dl.acm.org/doi/10.1007/978-3-642-33027-8_20
Malekian EZakerolhosseini A(2010)NTRU-like public key cryptosystems beyond dedekind domain up to alternative algebraTransactions on computational science X10.5555/1985581.1985583(25-41)Online publication date: 1-Jan-2010
https://dl.acm.org/doi/10.5555/1985581.1985583
Hermans JVercauteren FPreneel B(2010)Speed records for NTRUProceedings of the 2010 international conference on Topics in Cryptology10.1007/978-3-642-11925-5_6(73-88)Online publication date: 1-Mar-2010
https://dl.acm.org/doi/10.1007/978-3-642-11925-5_6
Show More Cited By

Abstract

References

Cited By

Recommendations

NTRU-v-um: Secure Fully Homomorphic Encryption from NTRU with Small Modulus

Analysis and Improvements of NTRU Encryption Paddings

Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations