Long modular multiplication for cryptographic applications

DOI10.1007/978-3-540-28632-5_4MaRDI QIDQ5311461zbMATH OpenOpenAlexFDO

Authors Laszlo Hars

Publication date 23 August 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b99451

zbMATH Keywords

Computer arithmeticcryptographymodular multiplicationModular reductionMontgomery multiplicationmultiply-accumulate architectureoptimizationQuisquater multiplicationreciprocal

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Recommendations

• A fast modular multiplication algorithm
• Parallel modular multiplication with table look-up
• A modular exponentiation unit based on systolic arrays
• Systolic multiplier for Montgomery’s algorithm
• Low Complexity Systolic Architecture for Modular Multiplication over GF(2 m )

Cited in

(1)

• Speeding up bipartite modular multiplication

This page was built for publication: Long modular multiplication for cryptographic applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5311461)