Efficient algorithms for remainder computation and exponentiation of long numbers

DOI10.1007/BF02366510MaRDI QIDQ1364066zbMATH OpenFDO

Authors L. S. Danil'chenko

Publication date 13 December 1998

Published in Cybernetics and Systems Analysis (Search for Journal in Brave)

zbMATH Keywords

algorithmscomplexityexponentiation of long numbersremainder computation

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 1024055
• New frameworks for Montgomery’s modular multiplication method
• Fast algorithms for implemention of Montgomery's modular multiplication technique
• Montgomery reduction with even modulus
• scientific article; zbMATH DE number 3961705
• Fast parallel modular exponentiation
• A faster modular multiplication algorithm
• scientific article; zbMATH DE number 1946644
• High-radix and bit recoding techniques for modular exponentiation

Cites work

• scientific article; zbMATH DE number 3649960 (Why is no real title available?)
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• Modular Multiplication Without Trial Division

Cited in

(1)

• Exponent Recoding and Regular Exponentiation Algorithms

This page was built for publication: Efficient algorithms for remainder computation and exponentiation of long numbers

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