Fast RNS division algorithms for fixed divisors with application to RSA encryption

DOI10.1016/0020-0190(94)00099-9zbMath0813.94008OpenAlexW2103983091MaRDI QIDQ1334636

Behrooz Parhami, Ching-Yu Hung

Publication date: 25 September 1994

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(94)00099-9

zbMATH Keywords

complexitycryptographycomputer arithmeticmodular multiplicationRSA encryptionresidue number systemssign detection

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (1)

Arithmetic division in RNS using Galois field \(GF(p)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers
• A new residue number system division algorithm
• An approximate sign detection method for residue numbers and its application to RNS division
• A new technique for fast number comparison in the residue number system
• A novel division algorithm for the residue number system

This page was built for publication: Fast RNS division algorithms for fixed divisors with application to RSA encryption