Carryless addition

DOI10.1007/BF02366527zbMATH Open0873.94032MaRDI QIDQ1364070FDOQ1364070

Authors: Anatoly V. Anisimov 

Publication date: 20 October 1997

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

Recommendations

• Performance analysis of ``addition machines
• Analysis of Carry Propagation in Addition: An Elementary Approach
• Carry-free addition of recoded binary signed-digit numbers
• On the number of carries occurring in an addition mod \(2^k -1\)

zbMATH Keywords

arithmetical modular functionsprocessing of long numberspublic-key systemssuperlarge numbers

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• A method for obtaining digital signatures and public-key cryptosystems
• Fast multiplication of large numbers
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Modular Multiplication Without Trial Division
• Fibonacci linear forms and parallel arithmetic algorithms for large numbers
• Addition Machines
• On Primality Testing Using Purely Divisionless Operations

Cited In (8)

• Carry-save multiplication schemes without final addition
• Calculating the sum of multidigit values in a parallel computational model
• Title not available (Why is that?)
• An intelligent VCR addition computing without both of overflowing and perturbation motion
• Multiple Operand Addition and Multiplication
• Analysis of Carry Propagation in Addition: An Elementary Approach
• Parallel methods of representing multidigit numbers in numeral systems for testing multidigit arithmetic operations
• Carryless arithmetic\(\mod 10\)

This page was built for publication: Carryless addition

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