Results 341 to 350 of about 9,865,590 (355)

High performance prime field multiplication for GPU

2012 IEEE International Symposium on Circuits and Systems, 2012
This paper presents a high performance algorithm for modular multiplication on a graphics processing unit (GPU) implemented in assembler. The proposed algorithm carries out finite field multiplication over the NIST prime fields of size 192, 224, 256 and ...
Karl Leboeuf, R. Muscedere, M. Ahmadi
semanticscholar   +1 more source

An Integrated Prime-Field ECDLP Hardware Accelerator with High-Performance Modular Arithmetic Units

International Conference on Reconfigurable Computing and FPGAs, 2011
This paper reports a successful demonstration of Pollard rho algorithm on a hardware-software co-integrated platform. It targets the Elliptic curve discrete logarithmic problem (ECDLP) for a NIST-standardized curve over 112- bit prime field.
Suvarna Mane, L. Judge, P. Schaumont
semanticscholar   +1 more source

Efficient prime-field arithmetic for elliptic curve cryptography on wireless sensor nodes

Proceedings of 2011 International Conference on Computer Science and Network Technology, 2011
Public-Key Cryptography (PKC) is essential to ensure the authenticity and confidentiality of communication in open computer networks such as the Internet.
Yang Zhang, J. Grossschadl
semanticscholar   +1 more source

Low-Power Low-Energy Prime-Field ECC Processor Based on Montgomery Modular Inverse Algorithm

2009 12th Euromicro Conference on Digital System Design, Architectures, Methods and Tools, 2009
In this paper, we present a fast low-power low- energy standard public-key cryptography processor for use in power/energy-limited applications. The proposed prime-field elliptic-curve cryptography hardware uses a modified Montgomery modular inverse ...
H. Ahmadi, A. Afzali-Kusha
semanticscholar   +1 more source

Computation of a 768-Bit Prime Field Discrete Logarithm

International Conference on the Theory and Application of Cryptographic Techniques, 2017
T. Kleinjung, C. Diem, A. Lenstra, C. Priplata, C. Stahlke   +4 more
semanticscholar   +1 more source

A New Characterization of Finite Prime Fields

Canadian Mathematical Bulletin, 1968
Let N ≡ <N, +,.> be a (right) near-ring with 1 (we say N is a unitary near-ring)[1] and recall that a near-field is a unitary near-ring in which <N - {0}, . > is a multiplicative group. In [2], Beidelman characterizes near-fields as those unitary near-rings without non-trivial N-subgroups. We show that in the finite case this absence of non-
openaire   +2 more sources

High performance hardware support for elliptic curve cryptography over general prime field

Microprocessors and microsystems, 2017
Khalid Javeed, Xiaojun Wang, Mike Scott
semanticscholar   +1 more source

Some properties of elements of the prime field

Russian Mathematics (Izvestiya VUZ. Matematika), 2016
S. A. Tyurin
semanticscholar   +1 more source

Interrelation of families of points of high order on the Edwards curve over a prime field

Problems of Information Transmission, 2015
A. Bessalov, O. Tsygankova
semanticscholar   +1 more source

On singular primes in function fields

Archiv der Mathematik, 1988
openaire   +2 more sources