Speeding up bipartite modular multiplication

DOI10.1007/978-3-642-13797-6_12MaRDI QIDQ3578472zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• Double-Size Bipartite Modular Multiplication
• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 1294069
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Performance-scalable array architectures for modular multiplication

Cited in

(6)

• Double-Size Bipartite Modular Multiplication
• Fast cryptography in genus 2
• Double-speed Barrett moduli
• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• On symmetric encryption with distinguishable decryption failures
• Efficient modular reduction algorithm without correction phase

This page was built for publication: Speeding up bipartite modular multiplication

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