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

DOI10.1016/0020-0190(94)00099-9zbMATH Open0813.94008OpenAlexW2103983091MaRDI QIDQ1334636FDOQ1334636

Authors: Ching-Yu Hung, Behrooz Parhami 

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

Recommendations

• A new residue number system division algorithm
• An approximate sign detection method for residue numbers and its application to RNS division
• A high-speed division algorithm in residue number system using parity-checking technique
• Integer division in residue number systems
• Division in residue number systems involving length indicators

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)

Cites Work

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

Cited In (4)

• Title not available (Why is that?)
• A high-speed division algorithm in residue number system using parity-checking technique
• Title not available (Why is that?)
• Arithmetic division in RNS using Galois field \(GF(p)\)

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

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