Highly parallel modular multiplication in the residue number system using sum of residues reduction

DOI10.1007/s00200-010-0124-2zbMath1185.94064OpenAlexW2166578346MaRDI QIDQ969623

Yinan Kong, Zhining Lim, Braden J. Phillips

Publication date: 7 May 2010

Published in: Applicable Algebra in Engineering, Communication and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00200-010-0124-2

zbMATH Keywords

public-key cryptographyRNSmodular multiplicationresidue number systems

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Parallel algorithms in computer science (68W10)

Related Items (2)

Modular multiplication using the core function in the residue number system ⋮ Partial-Collision Attack on the Round-Reduced Compression Function of Skein-256

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Modular Multiplication Without Trial Division
• A method for obtaining digital signatures and public-key cryptosystems

This page was built for publication: Highly parallel modular multiplication in the residue number system using sum of residues reduction