New Hardware Architectures for Montgomery Modular Multiplication Algorithm
From MaRDI portal
Publication:5280558
DOI10.1109/TC.2010.247zbMATH Open1367.65225MaRDI QIDQ5280558FDOQ5280558
Authors: Miaoqing Huang, Kris Gaj, Tarek El-Ghazawi 
Publication date: 27 July 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Cryptography (94A60) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)
Cited In (5)
- Title not available (Why is that?)
- A versatile Montgomery multiplier architecture with characteristic three support
- New frameworks for Montgomery’s modular multiplication method
- Hardware implementation of multiplication over quartic extension fields
- Scalable Montgomery Modular Multiplication Architecture with Low-Latency and Low-Memory Bandwidth Requirement
This page was built for publication: New Hardware Architectures for Montgomery Modular Multiplication Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5280558)
