Article detail · 2000
A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m)
Journal
Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","Lecture Notes in Computer ScienceISSN 0302-9743
The ISSN points to another catalog journal; the name is from the YÖKSİS record.
- Year
- 2000
- Type
- conference-paper
Data source split
- YÖKSİS YÖKSİS article record
- YÖKSİS venue Cryptographic Hardware and Embedded Systems \u2014 CHES 2000","Lecture Notes in Computer Science
- Catalog match (ISSN) Lecture Notes in Computer Science
- OpenAlex OpenAlex enrichment (abstract, citations, topics)
Abstract
Abstract not compiled yet; it will appear after the DergiPark / OpenAlex queue runs.
Topics
Citations
OpenAlex cited_by_count. Not a WoS or Scopus citation count; those sources have no separate column here.
132 citations
OpenAlex cited_by_count (cache / database)
18 publications in the local catalog that cite this work (OpenAlex reference match; not the full global list).
- Constructing composite field representations for efficient conversion 2003
- High-Radix Design of a Scalable Modular Multiplier 2001
- Instruction Set Extensions for Fast Arithmetic in Finite Fields GF(p) and GF(2 m ) 2004
- Finite Field Arithmetic for Cryptography 2010
- Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2n) 2003
- Scalable and Unified Hardware to Compute Montgomery Inverse in GF(p) and GF(2n) 2002
- Multiplier architectures for GF(p) and GF(2n) 2004
- Architectures for unified field inversion with applications in elliptic curve cryptography 2003
- Architectures for unified field inversion with applications in elliptic curve cryptography 2002
- Efficient unified Montgomery inversion with multibit shifting 2005