Hardware implementation of an elliptic curve processor over GF(p)

Berna Örs; Lejla Batina; Bart Preneel; Joos Vandewalle

doi:10.1109/asap.2003.1212866

ScienceGate Book Chapters

JOURNAL ARTICLE

Hardware implementation of an elliptic curve processor over GF(p)

Berna Örs Lejla Batina Bart Preneel Joos Vandewalle

Year: 2004 Pages: 433-443

DOI: 10.1109/asap.2003.1212866

Get Full-Text PDF Get Analytical Report

Abstract

\n Contains fulltext :\n 127482.pdf (Author’s version preprint ) (Open Access)\n

Keywords:

Elliptic curve cryptography Arithmetic Modular arithmetic Computer science Elliptic curve Modular design Parallel computing Subtraction Affine transformation Elliptic curve point multiplication Cryptosystem Public-key cryptography Cryptography Mathematics Algorithm Encryption Operating system

Metrics

100

Cited By

29.18

FWCI (Field Weighted Citation Impact)

Refs

0.99

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Hardware implementation of an elliptic curve processor over GF(p)

Abstract

Metrics

Citation History

Topics

Related Documents

Hardware implementation of an elliptic curve processor over GF(p) with Montgomery modular multiplier

Efficient Hardware Implementation of Elliptic Curve Cryptography over GF(p m )

Efficient Hardware Implementation Of An Elliptic Curve Cryptographic Processor Over Gf (2 163)

A Scalable GF(p) Elliptic Curve Processor Architecture for Programmable Hardware

High Performance SM2 Elliptic Curve Cryptographic Processor over GF(p)