New modular multiplication algorithms for fast modular exponentiation

DOI10.1007/3-540-68339-9_15MaRDI QIDQ2876897zbMATH OpenOpenAlexFDO

Authors Seong-Min Hong, Sangyeop Oh, Hyunsoo Yoon

Publication date 20 August 2014

Published in Advances in Cryptology — EUROCRYPT ’96 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-68339-9_15

Mathematics Subject Classification ID

Mathematical problems of computer architecture (68M07) Cryptography (94A60)

Recommendations

• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 1294069
• Parallel modular multiplication with table look-up
• scientific article; zbMATH DE number 2118995
• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation

Cited in

(34)

• An efficient common-multiplicand-multiplication method to the Montgomery algorithm for speeding up exponentiation
• A generalisation of Brickell's algorithm for fast modular multiplication
• Fast direct computation of modular reduction
• Bilevel programming and applications
• A fast modular square computing method based on the generalized Chinese remainder theorem for prime moduli
• Analysis of the variable length nonzero window method for exponentiation
• Efficient big integer multiplication and squaring algorithms for cryptographic applications
• Inefficiency of common-multiplicand multiplication and exponentiation algorithms by performing binary complements
• Computational efficiency analysis of Wu et al.'s fast modular multi-exponentiation algorithm
• New algorithms for relaxed multiplication
• An efficient modulo p multiplication algorithm with moderate factors of p+1 and p-1
• How to compute modular exponentiation with large operators based on the right-to-left binary algorithm
• Accelerating oblivious transfer with batch multi-exponentiation
• Another look at some fast modular arithmetic methods
• Analysis and improvement of modular inverse algorithm
• A new fast modular arithmetic method in public key cryptography
• scientific article; zbMATH DE number 1294069 (Why is no real title available?)
• A fast modular multiplication algorithm
• scientific article; zbMATH DE number 1024055 (Why is no real title available?)
• scientific article; zbMATH DE number 2043438 (Why is no real title available?)
• New frameworks for Montgomery’s modular multiplication method
• scientific article; zbMATH DE number 2085209 (Why is no real title available?)
• scientific article; zbMATH DE number 2104055 (Why is no real title available?)
• scientific article; zbMATH DE number 2118995 (Why is no real title available?)
• Exploiting Linearity of Modular Multiplication
• Efficient Modular Arithmetic
• Energy efficient modular exponentiation for public-key cryptography based on bit forwarding techniques
• scientific article; zbMATH DE number 5679233 (Why is no real title available?)
• scientific article; zbMATH DE number 2215630 (Why is no real title available?)
• Implementing Montgomery multiplication to speed-up the computation of modular exponentiation of multi-bit numbers
• Fast modular multi-exponentiation using modified complex arithmetic
• New iterative algorithms for modular multiplication
• Should one always use repeated squaring for modular exponentiation?
• A low-complexity LUT-based squaring algorithm

This page was built for publication: New modular multiplication algorithms for fast modular exponentiation

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