Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers

DOI10.1016/0898-1221(92)90209-ZzbMath0800.68401MaRDI QIDQ1205890

Ching-Yu Hung, Çetin Kaya Koç

Publication date: 1 April 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

zbMATH Keywords

multiplicationMarkov chain model\(m\)-ary segmentationcanonical recording algorithmslarge binary numbersvariable-length segmentation

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data encryption (aspects in computer science) (68P25) Parallel numerical computation (65Y05)

Related Items (3)

Fast RNS division algorithms for fixed divisors with application to RSA encryption ⋮ Redundant integer representations and fast exponentiation ⋮ Compact SD: a new encoding algorithm and its application in multiplication

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite Continuous Time Markov Chains
• A SIGNED BINARY MULTIPLICATION TECHNIQUE

This page was built for publication: Adaptive \(m\)-ary segmentation and canonical recoding algorithms for multiplication of large binary numbers