On the public citation graph
Optimal extension fields for fast arithmetic in public-key algorithms
0 signed · 120 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-44750-4_4openalex-snapshot
Fast Key Exchange with Elliptic Curve Systems
inferredcites →https://doi.org/10.1007/3-540-47555-9_14openalex-snapshot
Public-Key Cryptosystems with Very Small Key Lengths
inferredcites →https://doi.org/10.1007/3-540-48071-4_25openalex-snapshot
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
inferredcites →https://doi.org/10.1007/bfb0034836openalex-snapshot
A fast software implementation for arithmetic operations in GF(2n)
inferredcites →https://doi.org/10.1007/bfb0052247openalex-snapshot
Efficient algorithms for elliptic curve cryptosystems
inferredcites →https://doi.org/10.1017/cbo9781107360211openalex-snapshot
Elliptic Curves in Cryptography
inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot
Elliptic Curve Cryptosystems
inferredcites →https://doi.org/10.1201/9781439821916openalex-snapshot
Handbook of Applied Cryptography
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.5860/choice.34-4512openalex-snapshot
Handbook of applied cryptography
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/sec.1670openalex-snapshot
Elliptic‐curve cryptography for wireless sensor network nodes without hardware multiplier support
inferred← citeshttps://doi.org/10.1007/10719994_8openalex-snapshot
Over F p vs. over F $_{2^{n}}$ and on Pentium vs. on Alpha in Software Implementation of Hyperelliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/10719994_9openalex-snapshot
Speeding Up Elliptic Scalar Multiplication with Precomputation
inferred← citeshttps://doi.org/10.1007/10722028_28openalex-snapshot
Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/11424826_11openalex-snapshot
Efficient Multi-bit Shifting Algorithm in Multiplicative Inversion Problems
inferred← citeshttps://doi.org/10.1007/11596219_31openalex-snapshot
Scalar Multiplication on Elliptic Curves Defined over Fields of Small Odd Characteristic
inferred← citeshttps://doi.org/10.1007/11604938_16openalex-snapshot
Efficient Hardware Implementation of Elliptic Curve Cryptography over GF(p m )
inferred← citeshttps://doi.org/10.1007/11693383_25openalex-snapshot
Efficient FPGA-Based Karatsuba Multipliers for Polynomials over ${\mathbb F}_{2}$
inferred← citeshttps://doi.org/10.1007/11751632_64openalex-snapshot
Efficient Exponentiation in GF(p m ) Using the Frobenius Map
inferred← citeshttps://doi.org/10.1007/11927587_10openalex-snapshot
A High-Speed Square Root Algorithm in Extension Fields
inferred← citeshttps://doi.org/10.1007/11958239_10openalex-snapshot
Compressed Jacobian Coordinates for OEF
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_41openalex-snapshot
Fast Multi-scalar Multiplication Methods on Elliptic Curves with Precomputation Strategy Using Montgomery Trick
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_2openalex-snapshot
Integer Decomposition for Fast Scalar Multiplication on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-36492-7_24openalex-snapshot
Optimal Extension Fields for XTR
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_19openalex-snapshot
New Frobenius Expansions for Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_11openalex-snapshot
Efficient GF(p m ) Arithmetic Architectures for Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_16openalex-snapshot
Power Analysis Breaks Elliptic Curve Cryptosystems Even Secure against the Timing Attack
inferred← citeshttps://doi.org/10.1007/3-540-44499-8_4openalex-snapshot
Fast Implementation of Elliptic Curve Defined over GF(pm) on CalmRISC with MAC2424 Coprocessor
inferred← citeshttps://doi.org/10.1007/3-540-44586-2_27openalex-snapshot
Efficient Implementation of Elliptic Curve Cryptosystems on the TI MSP430x33x Family of Microcontrollers
inferred← citeshttps://doi.org/10.1007/3-540-44647-8_11openalex-snapshot
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_12openalex-snapshot
Efficient Elliptic Curve Cryptosystems from a Scalar Multiplication Algorithm with Recovery of the y-Coordinate on a Montgomery-Form Elliptic Curve
inferred← citeshttps://doi.org/10.1007/3-540-44839-x_36openalex-snapshot
Efficient Inversion Algorithm for Optimal Normal Bases Type II
inferred← citeshttps://doi.org/10.1007/3-540-44864-0_103openalex-snapshot
An Efficient Algorithm for Computing Inverses in GF(2m) Using Dual Bases
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_10openalex-snapshot
Elliptic Curves of Prime Order over Optimal Extension Fields for Use in Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_20openalex-snapshot
Fast Simultaneous Scalar Multiplication on Elliptic Curve with Montgomery Form
inferred← citeshttps://doi.org/10.1007/3-540-45600-7_8openalex-snapshot
A Cyclic Window Algorithm for ECC Defined over Extension Fields
inferred← citeshttps://doi.org/10.1007/3-540-48910-x_13openalex-snapshot
Fast Elliptic Curve Algorithm Combining Frobenius Map and Table Reference to Adapt to Higher Characteristic
inferred← citeshttps://doi.org/10.1007/3-540-49248-8_5openalex-snapshot
Elliptic Curve Public-Key Cryptosystems — An Introduction
inferred← citeshttps://doi.org/10.1007/978-0-387-35528-3_5openalex-snapshot
Elliptic Curve Cryptography on Smart Cards without Coprocessors
inferred← citeshttps://doi.org/10.1007/978-0-387-71829-3_1openalex-snapshot
Modular Integer Arithmetic for Public Key Cryptography
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_5openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-16815-4_25openalex-snapshot
Efficient Software Implementation of GMT6-672 and GMT8-542 Pairing-Friendly Curves for a 128-Bit Security Level
inferred← citeshttps://doi.org/10.1007/978-3-319-06773-5_68openalex-snapshot
Fast Computation of Frobenius Map Iterates in Optimal Extension Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-09153-2_37openalex-snapshot
Elliptic Curve Cryptography on Constrained Microcontrollers Using Frequency Domain Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-56549-1_19openalex-snapshot
Efficient Scalar Multiplication for Ate Based Pairing over KSS Curve of Embedding Degree 18
inferred← citeshttps://doi.org/10.1007/978-3-319-78556-1_14openalex-snapshot
On the Computational Complexity of ECDLP for Elliptic Curves in Various Forms Using Index Calculus
inferred← citeshttps://doi.org/10.1007/978-3-540-24582-7_26openalex-snapshot
Systolic and Scalable Architectures for Digit-Serial Multiplication in Fields GF(p m )
inferred← citeshttps://doi.org/10.1007/978-3-540-24633-6_4openalex-snapshot
Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_10openalex-snapshot
A General Expansion Method Using Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-24691-6_13openalex-snapshot
Efficient Scalar Multiplication in Hyperelliptic Curves Using A New Frobenius Expansion
inferred← citeshttps://doi.org/10.1007/978-3-540-24707-4_62openalex-snapshot
Computation of Multiplicative Inverses in GF(2 n ) Using Palindromic Representation
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_9openalex-snapshot
Comparing Elliptic Curve Cryptography and RSA on 8-bit CPUs
inferred← citeshttps://doi.org/10.1007/978-3-540-30117-2_60openalex-snapshot
Reconfigurable Instruction Set Extension for Enabling ECC on an 8-Bit Processor
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_17openalex-snapshot
Elliptic Curves with the Montgomery-Form and Their Cryptographic Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_27openalex-snapshot
Fast Implementation of Elliptic Curve Arithmetic in GF(p n )
inferred← citeshttps://doi.org/10.1007/978-3-540-69499-1_5openalex-snapshot
Optimal Extension Field Inversion in the Frequency Domain
inferred← citeshttps://doi.org/10.1007/978-3-540-74735-2_10openalex-snapshot
Highly Regular Right-to-Left Algorithms for Scalar Multiplication
inferred← citeshttps://doi.org/10.1007/978-3-540-77360-3_11openalex-snapshot
Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-77360-3_12openalex-snapshot
Explicit Formulas for Efficient Multiplication in $\mathbb{F}_{3^{6m}}$
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_13openalex-snapshot
Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions
inferred← citeshttps://doi.org/10.1007/978-3-642-13797-6_13openalex-snapshot
Constructing Tower Extensions of Finite Fields for Implementation of Pairing-Based Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-642-15031-9_16openalex-snapshot
Mixed Bases for Efficient Inversion in ${{\mathbb F}{((2^2)^2)}{2}}$ and Conversion Matrices of SubBytes of AES
inferred← citeshttps://doi.org/10.1007/978-3-642-36334-4_1openalex-snapshot
On Efficient Pairings on Elliptic Curves over Extension Fields
inferred← citeshttps://doi.org/10.1007/978-981-15-3654-0openalex-snapshot
Security Infrastructure Technology for Integrated Utilization of Big Data: Applied to the Living Safety and Medical Fields
inferred← citeshttps://doi.org/10.1007/978-981-15-3654-0_2openalex-snapshot
Cryptography Core Technology
inferred← citeshttps://doi.org/10.1007/bf02828643openalex-snapshot
Addition sequence method of scalar multiplication of elliptic curve over OEF
inferred← citeshttps://doi.org/10.1007/s001450010012openalex-snapshot
Efficient Arithmetic in Finite Field Extensions with Application in Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/s10586-022-03611-5openalex-snapshot
An ECC processor for IoT using Edwards curves and DFT modular multiplication
inferred← citeshttps://doi.org/10.1016/j.vlsi.2016.08.007openalex-snapshot
Design exploration of a Symmetric Pass Gate Adiabatic Logic for energy-efficient and secure hardware
inferred← citeshttps://doi.org/10.1016/s0898-1221(01)00133-xopenalex-snapshot
A comparison of different finite fields for elliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1023/a:1008354106356openalex-snapshot
The State of Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1023/a:1013860532636openalex-snapshot
Itoh-Tsujii Inversion in Standard Basis and Its Application in Cryptography and Codes
inferred← citeshttps://doi.org/10.1049/iet-ifs:20060033openalex-snapshot
Improved base- ɸ expansion method for Koblitz curves over optimal extension fields
inferred← citeshttps://doi.org/10.1109/access.2024.3495995openalex-snapshot
Efficient ECC Processor Designs for IoT Using Edwards Curves and Exploiting FPGA Embedded Components
inferred← citeshttps://doi.org/10.1109/acssc.2004.1399187openalex-snapshot
Optimal tower fields for hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.1109/ants.2013.6802866openalex-snapshot
Lightweight IBE scheme for Wireless Sensor nodes
inferred← citeshttps://doi.org/10.1109/arith.2003.1207677openalex-snapshot
Efficient multiplication in GF(p/sup k/) for elliptic curve cryptography
inferred← citeshttps://doi.org/10.1109/asap.2004.1342463openalex-snapshot
Architectural support for arithmetic in optimal extension fields
inferred← citeshttps://doi.org/10.1109/asap.2005.15openalex-snapshot
Architectural Extensions for Elliptic Curve Cryptography over GF(2^m ) on 8-bit Microprocessors
inferred← citeshttps://doi.org/10.1109/asap.2005.46openalex-snapshot
Multiply-Accumulate Architecture for a Special Class of Optimal Extension Fields
inferred← citeshttps://doi.org/10.1109/fpl.2007.4380669openalex-snapshot
Efficient FPGA-Based Multipliers for F397 and F36.97
inferred← citeshttps://doi.org/10.1109/icc.2013.6654986openalex-snapshot
Network coding over the 232−5 prime field
inferred← citeshttps://doi.org/10.1109/iccit.2008.166openalex-snapshot
An Improvement of Cyclic Vector Multiplication Algorithm
inferred← citeshttps://doi.org/10.1109/iccit.2008.171openalex-snapshot
Systematic Generation of An Irreducible Polynomial of an Arbitrary Degree m over Fp Such That p ≫ m
inferred← citeshttps://doi.org/10.1109/iccit.2008.172openalex-snapshot
Efficient Pairings on Twisted Elliptic Curve
inferred← citeshttps://doi.org/10.1109/iccit.2008.193openalex-snapshot
An Improvement of Twisted Ate Pairing with Barreto–Naehrig Curve by Using Frobenius Mapping
inferred← citeshttps://doi.org/10.1109/iccsnt.2011.6181997openalex-snapshot
Efficient prime-field arithmetic for elliptic curve cryptography on wireless sensor nodes
inferred← citeshttps://doi.org/10.1109/icics52457.2021.9464611openalex-snapshot
FPGA Implementation of an ECC Processor Using Edwards Curves and DFT Modular Multiplication
inferred← citeshttps://doi.org/10.1109/icme.2004.1394341openalex-snapshot
Efficient implementation of elliptic curve cryptography (ECC) on VLIW-micro-architecture media processor
inferred← citeshttps://doi.org/10.1109/imis.2011.62openalex-snapshot
Rho Method with Period k on Non -- symmetric Ordinary Pairings of Embedding Degree k -- Especially for Barreto -- Naehrig Curves
inferred← citeshttps://doi.org/10.1109/itw.2006.1633791openalex-snapshot
Fast arithmetic for polynomials over F>inf<2>/inf
inferred← citeshttps://doi.org/10.1109/mascot.2008.4770564openalex-snapshot
Optimizing Galois Field Arithmetic for Diverse Processor Architectures and Applications
inferred← citeshttps://doi.org/10.1109/nbis.2010.89openalex-snapshot
Accelerating Cross Twisted Ate Pairing with Ordinary Pairing Friendly Curve of Composite Order That Has Two Large Prime Factors
inferred← citeshttps://doi.org/10.1109/tc.2006.136openalex-snapshot
Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation
inferred← citeshttps://doi.org/10.1109/tc.2009.132openalex-snapshot
Conversion Algorithms and Implementations for Koblitz Curve Cryptography
inferred← citeshttps://doi.org/10.1109/tencon.1999.818451openalex-snapshot
Shamir's shared secret scheme in GF(p/sup m/)
inferred← citeshttps://doi.org/10.1109/tit.2012.2191477openalex-snapshot
Finding a Basis Conversion Matrix Using a Polynomial Basis Derived by a Small Multiplicative Cyclic Group
inferred← citeshttps://doi.org/10.1109/wispnet.2017.8300158openalex-snapshot
Hardware implementation and performance comparison of normal basis multiplication methods over GF (2m)
inferred← citeshttps://doi.org/10.1109/wsc.2007.4419752openalex-snapshot
An elliptical cryptographic algorithm for rf wireless devices
inferred← citeshttps://doi.org/10.1145/1055626.1055643openalex-snapshot
An architecture for elliptic curve cryptograph computation
inferred← citeshttps://doi.org/10.1145/2490428.2490438openalex-snapshot
An identity based encryption using elliptic curve cryptography for secure M2M communication
inferred← citeshttps://doi.org/10.1145/3476883.3520223openalex-snapshot
On fast implementations of elliptic curve point multiplication
inferred← citeshttps://doi.org/10.14209/sbrt.2005.1246openalex-snapshot
Criptografia baseada em curvas elípticas: otimização de algoritmos básicos em plataforma DSP
inferred← citeshttps://doi.org/10.1504/ijsn.2006.011772openalex-snapshot
Elliptic curve cryptography-based access control in sensor networks
inferred← citeshttps://doi.org/10.1587/transfun.e100.a.1838openalex-snapshot
An Improvement of Scalar Multiplication by Skew Frobenius Map with Multi-Scalar Multiplication for KSS Curve
inferred← citeshttps://doi.org/10.1587/transfun.e102.a.1061openalex-snapshot
Differences among Summation Polynomials over Various Forms of Elliptic Curves
inferred← citeshttps://doi.org/10.1587/transfun.e94.a.1318openalex-snapshot
Mixed Bases for Efficient Inversion in F((22)2)2 and Conversion Matrices of SubBytes of AES
inferred← citeshttps://doi.org/10.21914/anziamj.v44i0.686openalex-snapshot
Implementing an efficient elliptic curve cryptosystem over $GF(p)$ on a smart card
inferred← citeshttps://doi.org/10.3390/s20051507openalex-snapshot
Elliptic Curve Cryptography for Wireless Sensor Networks Using the Number Theoretic Transform
inferred← citeshttps://doi.org/10.4218/etrij.07.0107.0040openalex-snapshot
Cyclic Vector Multiplication Algorithm Based on a Special Class of Gauss Period Normal Basis
inferred← citeshttps://doi.org/10.4218/etrij.08.0107.0182openalex-snapshot
Basis Translation Matrix between Two Isomorphic Extension Fields via Optimal Normal Basis
inferred← citeshttps://doi.org/10.5772/235openalex-snapshot
Convergence and Hybrid Information Technologies
inferred← citeshttps://doi.org/10.5772/9630openalex-snapshot
Systematic Generation of An Irreducible Polynomial of An Arbitrary Degree m over Fp Such That p > m
inferred← citeshttps://doi.org/10.5772/9635openalex-snapshot
An Improvement of Twisted Ate Pairing with Barreto-Naehrig Curve by using Frobenius Mapping
inferred← citeshttps://doi.org/10.5772/9639openalex-snapshot
An Improvement of Cyclic Vector Multiplication Algorithm
inferred← citeshttps://doi.org/10.70675/76017351z212cz4040z8d7cz30b9743dca52openalex-snapshot
Recherche de primitives pour la cryptographie à base de couplage.
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.