Back to Search
Start Over
Research in Fast Modular Exponentiation Algorithm Based on FPGA
- Source :
- 2019 11th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA).
- Publication Year :
- 2019
- Publisher :
- IEEE, 2019.
-
Abstract
- Modular exponentiation of large number is widely applied in public-key cryptosystem, also the bottleneck in the computation of public-key algorithm. Modular multiplication is the key calculation in modular exponentiation. An improved Montgomery algorithm is utilized to achieve modular multiplication and converted into systolic array to increase the running frequency. A high efficiency fast modular exponentiation structure is developed to bring the best out of the modular multiplication module and enhance the ability of defending timing attacks and power attacks. For 1024-bit key operands, the design can be run at 170MHz and finish a modular exponentiation in 4,402,374 clock cycles.
- Subjects :
- Modular exponentiation
Modular arithmetic
Computer science
020206 networking & telecommunications
Systolic array
02 engineering and technology
Operand
Timing attack
0202 electrical engineering, electronic engineering, information engineering
Key (cryptography)
Cryptosystem
020201 artificial intelligence & image processing
Field-programmable gate array
Algorithm
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- 2019 11th International Conference on Measuring Technology and Mechatronics Automation (ICMTMA)
- Accession number :
- edsair.doi...........73d8f681fe5f9b7a72bb9950306bdd08