Speeding Up Bipartite Modular Multiplication

DOI10.1007/978-3-642-13797-6_12zbMath1245.11127OpenAlexW2168713059MaRDI QIDQ3578472

Miroslav Knežević, Frederik Vercauteren, Ingrid Verbauwhede

Publication date: 20 July 2010

Published in: Arithmetic of Finite Fields (Search for Journal in Brave)

Full work available at URL: https://www.cosic.esat.kuleuven.be/publications/article-1443.pdf

zbMATH Keywords

Barrett reductionMontgomery reductionBipartite modular multiplication (BMM)Public-key cryptography (PKC)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Complexity and performance of numerical algorithms (65Y20) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

Fast cryptography in genus 2 ⋮ Efficient Modular Reduction Algorithm Without Correction Phase ⋮ On Symmetric Encryption with Distinguishable Decryption Failures

This page was built for publication: Speeding Up Bipartite Modular Multiplication