A design of low latency multiplier/mac unit for public-key cryptography

MaRDI QIDQ3609537zbMATH OpenFDO

Authors Jiahong Zhang, Jianhua Chen, Lina Zhang

Publication date 6 March 2009

zbMATH Keywords

multipliercompressorBooth recoderlook-ahead adder

Mathematics Subject Classification ID

Cryptography (94A60) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30)

Recommendations

• Algorithm and circuit design for secondary Booth encoded multiplier
• A systolic, linear-array multiplier for a class of right-shift algorithms
• A high-speed elliptic curve cryptographic processor for generic curves over \(\mathrm{GF}(p)\)
• A fully-pipeline linear systolic architecture for modular multiplier in public-key crypto-systems
• Digit-serial-in-serial-out systolic multiplier for Montgomery algorithm

Cited in

(3)

• A 16-bit by 16-bit MAC design using fast 5:3 compressor cells
• A method for speed optimized partial product reduction and generation of fast parallel multipliers using an algorithmic approach
• Algorithm and circuit design for secondary Booth encoded multiplier

This page was built for publication: A design of low latency multiplier/mac unit for public-key cryptography

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