搜索结果: 1-7 共查到“军事学 Modular Multiplication”相关记录7条 . 查询时间(0.078 秒)
Hardware Aspects of Montgomery Modular Multiplication
public-key cryptography RSA modular multiplication
font style='font-size:12px;'>
2017/11/22
This chapter compares Peter Montgomery's modular multiplication method with traditional techniques for suitability on hardware platforms. It also covers systolic array implementations and side channel...
A Systolic Hardware Architectures of Montgomery Modular Multiplication for Public Key Cryptosystems
Hardware Implementation Modular Multiplication Montgomery Algorithm
font style='font-size:12px;'>
2016/5/23
The arithmetic in a finite field constitutes the core of Public Key Cryptography like RSA, ECC or pairing-based cryptography. This paper discusses an efficient hardware implementation of the Coarsely ...
Low Power Montgomery Modular Multiplication on Reconfigurable Systems
elliptic curve cryptosystem modular multiplication montgomery algorithm
font style='font-size:12px;'>
2016/3/14
This paper presents an area-optimized FPGA architecture of the Montgomery modular multiplication algorithm on a low power reconfigurable IGLOO?2 FPGA of Microsemi? Our contributions consist of the map...
Montgomery Modular Multiplication on ARM-NEON Revisited
Public-key cryptography modular arithmetic SIMD-level parallelism
font style='font-size:12px;'>
2016/1/7
Montgomery modular multiplication constitutes the "arithmetic foundation" of modern public-key cryptography with applications ranging from RSA, DSA and Diffie-Hellman over elliptic curve schemes to pa...
New Speed Records for Montgomery Modular Multiplication on 8-bit AVR Microcontrollers
New Speed Records Microcontrollers
font style='font-size:12px;'>
2014/3/5
Modular multiplication of large integers is a performance-critical arithmetic operation of many public-key cryptosystems such as RSA, DSA, Diffie-Hellman (DH) and their elliptic curve-based variants E...
New modular multiplication and division algorithms based on continued fraction expansion
Modular arithmetic – Continued fraction – Euclidean algorithm – Ostrowski number system
font style='font-size:12px;'>
2013/4/18
In this paper, we apply results on number systems based on continued fraction expansions to modular arithmetic. We provide two new algorithms in order to compute modular multiplication and modular div...
Long Modular Multiplication for Cryptographic Applications
Computer Arithmetic Cryptography Modular multiplication
font style='font-size:12px;'>
2009/3/27
A digit-serial, multiplier-accumulator based cryptographic co-processor architecture is proposed, similar to fix-point DSP's with enhance-ments, supporting long modular arithmetic and general computat...