Efficient algorithms for remainder computation and exponentiation of long numbers

DOI10.1007/BF02366510zbMath0902.11054MaRDI QIDQ1364066

L. S. Danil'chenko

Publication date: 13 December 1998

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

zbMATH Keywords

complexityalgorithmsexponentiation of long numbersremainder computation

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• Modular Multiplication Without Trial Division

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