Effective implementation of Wang method using approximate method in RNS

Червяков, Николай Иванович; Babenko, Mikhail; Shabalina, Maria Nikolaevna

doi:10.1109/scm.2017.7970634

Cited by 1 publication

(1 citation statement)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…6) Division by a constant is difficult to implement with RNS representation [34]- [37]. 7) It is inefficient to perform the division operation with RNS representation due to the combination of iterated subtractions and comparisons operations [38]- [43]. As will be seen in the sequel, the attribute-based large integer number representation proposed here does not suffer from these disadvantages.…”

Section: Related Workmentioning

confidence: 99%

Fast Large Integer Modular Addition in GF(p) Using Novel Attribute-Based Representation

Alhazmi

Gebali

2019

IEEE Access

View full text Add to dashboard Cite

Addition is an essential operation in all cryptographic algorithms. Higher levels of security require larger key sizes and this becomes a limiting factor in GF(p) using large integers because of the carry propagation problem. We propose a novel and efficient attribute-based large integer representation scheme suitable for large integers commonly used in cryptography such as the five NIST primes and the Pierpont primes used in supersingular isogeny Diffie-Hellman (SIDH) for post-quantum cryptography. Algorithms are proposed for this new representation to implement arithmetic operations such as two's complement, addition/subtraction, comparison, sign detection, and modular reduction. Algorithms are also developed for converting binary numbers to attribute representation and vice versa. The extensive numerical simulations were done to verify the performance of the new number representation. Results show that addition is done faster in our proposed representation when compared with binary and residue number system (RNS)-based additions. Attribute addition outperformed RNS addition for all values of m where 128 ≤ m ≤ 32 768 bits for all machine word sizes w where 4 ≤ w ≤ 128 bits. Attribute-based addition outperforms Kogge-Stone binary adders for a wide range of m when w is small. For increasing values of w, the speed advantages are evident only for large values of m. This makes the proposed number representation suitable for implementing cryptographic applications in embedded processors for IoT and consumer electronic devices where w is small. INDEX TERMS Prime fields GF(p), large integer arithmetic, modular arithmetic, Kogge-Stone adder, number representation, post-quantum cryptography, SIDH, cryptographic processor, embedded systems, NIST primes, generalized pierpont prime, parallel algorithms.BADER ALHAZMI received the B.Sc. degree in electrical and computer engineering from King Abdulaziz University, Jeddah, Saudi Arabia, and the master's degree in information systems security from Concordia University, Montreal, QC, Canada. He is currently pursuing the Ph.D. degree with the Department of Electrical and Computer Engineering, University of Victoria, Canada. His research interests include cryptosystems, hardware security, computer arithmetic, and parallel algorithms.FAYEZ GEBALI received the B.Sc. degree (Hons.) in electrical engineering from Cairo University, the B.Sc. degree (Hons.) in mathematics from Ain Shams University, and the Ph.D. degree in electrical engineering from the University of British Columbia. He is currently a Professor of electrical and computer engineering with the University of Victoria. His research interests include parallel algorithms, dataflow computing, finite-field arithmetic, and radar signal processing.

show abstract

Section: Related Workmentioning

confidence: 99%