Achieving NTRU with montgomery multiplication

DOI10.1109/TC.2003.1190585zbMath1231.68040OpenAlexW2106962972MaRDI QIDQ3417018

Colleen O'Rourke, Berk Sunar

Publication date: 9 January 2007

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2003.1190585

zbMATH Keywords

finite fieldsmodular multiplication for integers and binary polynomialsMontgomery multiplication algorithmNTRU polynomial multiplications

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Mathematical problems of computer architecture (68M07) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Related Items (2)

BLS-based adaptive fault tolerant control for a class of space unmanned systems with time-varying state constraints and input nonlinearities ⋮ GLDH: toward more efficient global low-density locality-sensitive hashing for high dimensions

This page was built for publication: Achieving NTRU with montgomery multiplication