Fast direct computation of modular reduction

DOI10.1007/BF02835848zbMath0963.68068MaRDI QIDQ1570258

Anatoly V. Anisimov

Publication date: 9 July 2000

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

zbMATH Keywords

multiprecision modular reduction

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Related Items (1)

Addition machines, automatic functions and open problems of Floyd and Knuth

Uses Software

• DSP56000

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• New Modular Multiplication Algorithms for Fast Modular Exponentiation
• Modular Multiplication Without Trial Division
• Addition Machines
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Parallel implementation of the rsa public-key cryptosystem

This page was built for publication: Fast direct computation of modular reduction