Carryless addition

DOI10.1007/BF02366527zbMath0873.94032MaRDI QIDQ1364070

Anatoly V. Anisimov

Publication date: 20 October 1997

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

zbMATH Keywords

arithmetical modular functionsprocessing of long numberspublic-key systemssuperlarge numbers

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (2)

Parallel methods of representing multidigit numbers in numeral systems for testing multidigit arithmetic operations ⋮ Calculating the sum of multidigit values in a parallel computational model

Cites Work

• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• Fast multiplication of large numbers
• 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
• On Primality Testing Using Purely Divisionless Operations

This page was built for publication: Carryless addition