Elliptic curve digital signature algorithm over GF(p) on a residue number system enabled microprocessor

2009 ◽  
Author(s):  
Zhining Lim ◽  
Braden J. Phillips ◽  
Michael Liebelt
Keyword(s):  
Elliptic Curve ◽  
Digital Signature ◽  
Number System ◽  
Residue Number System ◽  
Digital Signature Algorithm ◽  
Residue Number

scholarly journals White-Box Implementation of ECDSA Based on the Cloud Plus Side Mode

2020 ◽  
Vol 2020 ◽  
pp. 1-10
Author(s):  
Jie Zhou ◽  
Jian Bai ◽  
Meng Shan Jiang
Keyword(s):  
Elliptic Curve ◽  
Digital Signature ◽  
Random Number ◽  
Number System ◽  
Residue Number System ◽  
Lookup Table ◽  
Private Key ◽  
Digital Signature Algorithm ◽  
Residue Number ◽  
Side Mode

White-box attack context assumes that the running environments of algorithms are visible and modifiable. Algorithms that can resist the white-box attack context are called white-box cryptography. The elliptic curve digital signature algorithm (ECDSA) is one of the most widely used digital signature algorithms which can provide integrity, authenticity, and nonrepudiation. Since the private key in the classical ECDSA is plaintext, it is easy for attackers to obtain the private key. To increase the security of the private key under the white-box attack context, this article presents an algorithm for the white-box implementation of ECDSA. It uses the lookup table technology and the “cloud plus side” mode to protect the private key. The residue number system (RNS) theory is used to reduce the size of storage. Moreover, the article analyzes the security of the proposed algorithm against an exhaustive search attack, a random number attack, a code lifting attack, and so on. The efficiency of the proposed scheme is compared with that of the classical ECDSA through experiments.

scholarly journals Neural network method for base extension in residue number system

2020 ◽  
Author(s):  
M. Babenko ◽  
E. Shiriaev ◽  
A. Tchernykh ◽  
E. Golimblevskaia
Keyword(s):  
Neural Network ◽  
Elliptic Curve ◽  
Chinese Remainder Theorem ◽  
Homomorphic Encryption ◽  
Computational Cost ◽  
Number System ◽  
Residue Number System ◽  
Pseudorandom Sequence ◽  
Base Extension ◽  
Residue Number

Confidential data security is associated with the cryptographic primitives, asymmetric encryption, elliptic curve cryptography, homomorphic encryption, cryptographic pseudorandom sequence generators based on an elliptic curve, etc. For their efficient implementation is often used Residue Number System that allows executing additions and multiplications on parallel computing channels without bit carrying between channels. A critical operation in Residue Number System implementations of asymmetric cryptosystems is base extension. It refers to the computing a residue in the extended moduli without the application of the traditional Chinese Remainder Theorem algorithm. In this work, we propose a new way to perform base extensions using a Neural Network of a final ring. We show that it reduces 11.7% of the computational cost, compared with state-of-the-art approaches.

scholarly journals Montgomery reduction within the context of residue number system arithmetic

2017 ◽  
Vol 8 (3) ◽  
pp. 189-200 ◽  
Author(s):  
Jean-Claude Bajard ◽  
Julien Eynard ◽  
Nabil Merkiche
Keyword(s):  
Number System ◽  
Residue Number System ◽  
Residue Number ◽  
Montgomery Reduction

scholarly journals Computationally Efficient Approach to Implementation of the Chinese Remainder Theorem Algorithm in Minimally Redundant Residue Number System

2021 ◽  
Author(s):  
Mikhail Selianinau
Keyword(s):  
Chinese Remainder Theorem ◽  
Number System ◽  
Residue Number System ◽  
Computer Applications ◽  
Efficient Approach ◽  
Residue Modulo ◽  
Modern Computer ◽  
New Variant ◽  
Residue Number ◽  
Residue Code

AbstractIn this paper, we deal with the critical problem of performing non-modular operations in the Residue Number System (RNS). The Chinese Remainder Theorem (CRT) is widely used in many modern computer applications. Throughout the article, an efficient approach for implementing the CRT algorithm is described. The structure of the rank of an RNS number, a principal positional characteristic of the residue code, is investigated. It is shown that the rank of a number can be represented by a sum of an inexact rank and a two-valued correction to it. We propose a new variant of minimally redundant RNS, which provides low computational complexity for the rank calculation, and its effectiveness analyzed concerning conventional non-redundant RNS. Owing to the extension of the residue code, by adding the excess residue modulo 2, the complexity of the rank calculation goes down from $O\left (k^{2}\right )$ O k 2 to $O\left (k\right )$ O k with respect to required modular addition operations and lookup tables, where k equals the number of non-redundant RNS moduli.

Sign in / Sign up

Export Citation Format

Share Document