An efficient RSA implementation without precomputation

DOI10.1007/978-3-642-34704-7_19MaRDI QIDQ4899212zbMATH OpenOpenAlexFDO

Authors Wuqiong Pan, Jiwu Jing, Luning Xia, Zongbin Liu, Meng Yu

Publication date 7 January 2013

Published in Information Security and Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-34704-7_19

zbMATH Keywords

field programmable gate arrayshardware implementationmodular multiplicationRSA

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A design of fast pipelined modular multiplier based on a diminished-radix algorithm
• scientific article; zbMATH DE number 1456815
• Modular Reduction in GF(2 n ) without Pre-computational Phase
• A fast modular multiplication algorithm
• Faster Montgomery modular multiplication without pre-computational phase for some classes of finite fields

Cited in

(3)

• scientific article; zbMATH DE number 503341 (Why is no real title available?)
• scientific article; zbMATH DE number 1882024 (Why is no real title available?)
• scientific article; zbMATH DE number 1878332 (Why is no real title available?)

This page was built for publication: An efficient RSA implementation without precomputation

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