A versatile Montgomery multiplier architecture with characteristic three support

DOI10.1016/J.COMPELECENG.2008.05.009MaRDI QIDQ1013337zbMATH OpenOpenAlexFDO

Authors Erdinç Öztürk, Berk Sunar, Erkay Savaş

Publication date 17 April 2009

Published in Computers and Electrical Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.compeleceng.2008.05.009

zbMATH Keywords

finite fieldsidentity-based cryptographymontgomery multiplicationpublic key cryptography

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25)

Recommendations

• An Optimized Hardware Architecture for the Montgomery Multiplication Algorithm
• scientific article; zbMATH DE number 1504803
• New Hardware Architectures for Montgomery Modular Multiplication Algorithm
• Applied Cryptography and Network Security
• Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
• scientific article; zbMATH DE number 1617930
• High-Radix Design of a Scalable Montgomery Modular Multiplier With Low Latency

This page was built for publication: A versatile Montgomery multiplier architecture with characteristic three support

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