Scalable and unified hardware to compute Montgomery inverse in GF(p) and GF(2n)

Conference proceeding

Peer reviewed

Adnan Abdul-Aziz Gutub, Alexandre F Tenca, Erkay Savas and Cetin K Koc

Lecture notes in computer science, Vol.2523, pp.484-499

CHES 2002 : cryptographic hardware and embedded systems (Redwood Shores, 13-15 August 2002, revised papers)

2002

Abstract

Applied sciences

Cryptography

Exact sciences and technology

Information, signal and communications theory

Signal and communications theory

Telecommunications and information theory

1 Record Views

Title: Scalable and unified hardware to compute Montgomery inverse in GF(p) and GF(2n)
Creators - without role: Adnan Abdul-Aziz Gutub - Oregon State University
Alexandre F Tenca - Oregon State University
Erkay Savas - Oregon State University
Cetin K Koc - Oregon State University
Publication Details: Lecture notes in computer science, Vol.2523, pp.484-499
Conference: CHES 2002 : cryptographic hardware and embedded systems (Redwood Shores, 13-15 August 2002, revised papers)
Publisher: Springer
Identifiers: 9931094808331
Academic Unit: Umm Al Qura University
Language: English
Resource Type: Conference proceeding