An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basis

Pradeep Kumar Goud Nadikuda; Lakshmi Boppana

doi:10.1016/j.micpro.2022.104525

ScienceGate Book Chapters

JOURNAL ARTICLE

An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basis

Pradeep Kumar Goud Nadikuda Lakshmi Boppana

Year: 2022 Journal: Microprocessors and Microsystems Vol: 91 Pages: 104525-104525 Publisher: Elsevier BV

DOI: 10.1016/j.micpro.2022.104525

Get Full-Text PDF Get Analytical Report

Keywords:

Computer science Elliptic curve cryptography Multiplication (music) Arithmetic Cryptosystem Multiplication algorithm Polynomial basis Cryptography Finite field Elliptic curve Architecture Algorithm Mathematics Discrete mathematics Public-key cryptography Encryption Binary number Computer network

Metrics

Cited By

3.42

FWCI (Field Weighted Citation Impact)

Refs

0.92

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Cryptography and Residue Arithmetic

Physical Sciences → Computer Science → Information Systems

Coding theory and cryptography

Physical Sciences → Computer Science → Artificial Intelligence

Cryptography and Data Security

Physical Sciences → Computer Science → Artificial Intelligence

An area-time efficient point-multiplication architecture for ECC over GF(2m) using polynomial basis

Metrics

Citation History

Topics

Related Documents

An area-efficient architecture for finite field inversion over GF(2m) using polynomial basis

Low area-time complexity point multiplication architecture for ECC over GF($$2^{\textrm{m}}$$) using polynomial basis

Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m)

A Novel Approach for Multiplication over GF(2m) in Polynomial Basis Representation

Error Detecting Dual Basis Bit Parallel Systolic Multiplication Architecture over GF(2m)