[KNYGA][B] Residue number systems

PVA Mohan, PVA Mohan - 2016 - Springer
The design of algorithms and hardware implementation for signal processing systems has
received considerable attention over the last few decades. The primary area of application …

Combining residue arithmetic to design efficient cryptographic circuits and systems

L Sousa, S Antao, P Martins - IEEE Circuits and Systems …, 2016 - ieeexplore.ieee.org
Cryptography plays a major role assuring security in computation and communication. In
particular, public-key cryptography enables the asymmetrical ciphering of data along with …

High-speed ECC processor over NIST prime fields applied with Toom–Cook multiplication

J Ding, S Li, Z Gu - IEEE Transactions on Circuits and Systems I …, 2018 - ieeexplore.ieee.org
In this paper, a high-speed elliptic curve cryptography (ECC) processor specialized for
primes recommended by the National Institute of Standards and Technology (NIST) was …

RNS-based elliptic curve point multiplication for massive parallel architectures

S Antão, JC Bajard, L Sousa - The Computer Journal, 2012 - academic.oup.com
Acceleration of cryptographic applications on massive parallel computing platforms, such as
Graphic Processing Units (GPUs), becomes a real challenge concerning practical …

Montgomery reduction within the context of residue number system arithmetic

JC Bajard, J Eynard, N Merkiche - Journal of Cryptographic Engineering, 2018 - Springer
This paper is a survey of Montgomery reduction in the context of residue number system
arithmetic. We present the main variants of RNS Montgomery reduction, some efficient …

Memory-efficient implementation of elliptic curve cryptography for the Internet-of-Things

Z Liu, H Seo, A Castiglione… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
In this paper, we present memory-efficient and scalable implementations of NIST
standardized elliptic curves P-256, P-384 and P-521 on three ARMv6-M processors (ie …

Single base modular multiplication for efficient hardware RNS implementations of ECC

K Bigou, A Tisserand - … Hardware and Embedded Systems--CHES 2015 …, 2015 - Springer
The paper describes a new RNS modular multiplication algorithm for efficient
implementations of ECC over F _P FP. Thanks to the proposition of RNS-friendly Mersenne …

Efficient modular operations using the adapted modular number system

LS Didier, FY Dosso, P Véron - Journal of Cryptographic Engineering, 2020 - Springer
The adapted modular number system (AMNS) is an integer number system which aims to
speed up arithmetic operations modulo a prime p. Such a system is defined by a tuple (p, n …

Hierarchical approach in RNS base extension for asymmetric cryptography

L Djath, K Bigou, A Tisserand - 2019 IEEE 26th Symposium on …, 2019 - ieeexplore.ieee.org
Base extension is a critical operation in RNS implementations of asymmetric cryptosystems.
In this paper, we propose a new way to perform base extensions using a hierarchical …

A reconfigurable high-speed ECC processor over NIST primes

J Ding, S Li - 2017 IEEE Trustcom/BigDataSE/ICESS, 2017 - ieeexplore.ieee.org
Elliptic curve cryptography (ECC) is widely used in the field of cyber security such as TLS
protocol. Compared with symmetric cryptography, the computation of ECC is much slower. In …