On the public citation graph

A fast software implementation for arithmetic operations in GF(2n)

0 signed · 115 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/3-540-39799-x_31openalex-snapshot

Use of Elliptic Curves in Cryptography

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-49264-x_7openalex-snapshot

Counting the number of points on elliptic curves over finite fields: strategies and performances

inferredcites →https://doi.org/10.1007/978-1-4615-3198-2openalex-snapshot

Elliptic Curve Public Key Cryptosystems

inferredcites →https://doi.org/10.1016/0166-218x(88)90090-xopenalex-snapshot

Optimal normal bases in GF(pn)

inferredcites →https://doi.org/10.1090/s0025-5718-1985-0777280-6openalex-snapshot

Elliptic curves over finite fields and the computation of square roots mod 𝑝

inferredcites →https://doi.org/10.1090/s0025-5718-1987-0866109-5openalex-snapshot

Elliptic Curve Cryptosystems

inferredcites →https://doi.org/10.1090/s0025-5718-60-99239-5openalex-snapshot

Mathematics of Computation

inferredcites →https://doi.org/10.1109/12.238496openalex-snapshot

On computing multiplicative inverses in GF(2/sup m/)

inferredcites →https://doi.org/10.1109/49.223883openalex-snapshot

An implementation of elliptic curve cryptosystems over F/sub 2/155

inferredcites →https://doi.org/10.1109/tit.1978.1055817openalex-snapshot

An improved algorithm for computing logarithms overGF(p)and its cryptographic significance (Corresp.)

inferredcites →https://doi.org/10.2307/2007968openalex-snapshot

Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p

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.1140openalex-snapshot

An effective ECC‐based user access control scheme with attribute‐based encryption for wireless sensor networks

inferred← citeshttps://doi.org/10.1006/ffta.1999.0270openalex-snapshot

Rings of Low Multiplicative Complexity

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/11545262_30openalex-snapshot

Efficient Hardware for the Tate Pairing Calculation in Characteristic Three

inferred← citeshttps://doi.org/10.1007/11593447_4openalex-snapshot

Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains

inferred← citeshttps://doi.org/10.1007/3-540-36400-5_9openalex-snapshot

Implementation of Elliptic Curve Cryptography with Built-In Counter Measures against Side Channel Attacks

inferred← citeshttps://doi.org/10.1007/3-540-44495-5_18openalex-snapshot

High-Speed Software Multiplication in F2m

inferred← citeshttps://doi.org/10.1007/3-540-44499-8_1openalex-snapshot

Software Implementation of Elliptic Curve Cryptography over Binary Fields

inferred← citeshttps://doi.org/10.1007/3-540-44499-8_7openalex-snapshot

Power Analysis Attacks and Algorithmic Approaches to their Countermeasures for Koblitz Curve Cryptosystems

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-45067-x_8openalex-snapshot

Generic GF(2m) Arithmetic in Software and Its Application to ECC

inferred← citeshttps://doi.org/10.1007/3-540-45439-x_18openalex-snapshot

Efficient Implementation of Elliptic Curve Cryptosystems on an ARM7 with Hardware Accelerator

inferred← citeshttps://doi.org/10.1007/3-540-45600-7_21openalex-snapshot

Efficient Software Implementation for Finite Field Multiplication in Normal Basis

inferred← citeshttps://doi.org/10.1007/3-540-46665-7_25openalex-snapshot

Look-Up Table Based Large Finite Field Multiplication in Memory Constrained Cryptosystems (Extended Abstract)

inferred← citeshttps://doi.org/10.1007/3-540-48059-5_12openalex-snapshot

Fast Multiplication in Finite Fields GF(2n)

inferred← citeshttps://doi.org/10.1007/3-540-48059-5_27openalex-snapshot

Fast Multiplication on Elliptic Curves Over GF(2m) without precomputation

inferred← citeshttps://doi.org/10.1007/3-540-48892-8_15openalex-snapshot

Faster Attacks on Elliptic Curve Cryptosystems

inferred← citeshttps://doi.org/10.1007/3-540-48892-8_16openalex-snapshot

Improved Algorithms for Elliptic Curve Arithmetic in GF(2n)

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-49162-7_2openalex-snapshot

A New Aspect of Dual Basis for Efficient Field Arithmetic

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/3-540-49649-1_6openalex-snapshot

Efficient Elliptic Curve Exponentiation Using Mixed Coordinates

inferred← citeshttps://doi.org/10.1007/3-540-49649-1_8openalex-snapshot

Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2 n

inferred← citeshttps://doi.org/10.1007/3-540-69053-0_25openalex-snapshot

Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m)

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-1-4615-3198-2openalex-snapshot

Elliptic Curve Public Key Cryptosystems

inferred← citeshttps://doi.org/10.1007/978-3-319-16763-3_5openalex-snapshot

On the Cost of Lazy Engineering for Masked Software Implementations

inferred← citeshttps://doi.org/10.1007/978-3-322-89203-4_12openalex-snapshot

Implementierung Elliptischer Kurven auf Chipkarten

inferred← citeshttps://doi.org/10.1007/978-3-540-24767-8_50openalex-snapshot

A Parallel Solution to Reverse Engineering Genetic Networks

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-31815-6_34openalex-snapshot

Secure and Efficient AES Software Implementation for Smart Cards

inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_17openalex-snapshot

Efficient Modular Reduction Algorithm in $$ \mathbb{F}_q $$ [x] and Its Application to “Left to Right” Modular Multiplication in $$ \mathbb{F}_2 $$ [x]

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-48000-6_8openalex-snapshot

Fast Algorithms for Elliptic Curve Cryptosystems over Binary Finite Field

inferred← citeshttps://doi.org/10.1007/978-3-642-12827-1_7openalex-snapshot

Accelerating Inverse of GF(2 n ) with Precomputation

inferred← citeshttps://doi.org/10.1007/978-3-642-27708-5_25openalex-snapshot

Low Cost Dual-Basis Multiplier over GF(2m) Using Multiplexer Approach

inferred← citeshttps://doi.org/10.1007/978-3-642-35606-3_58openalex-snapshot

Compact Multiplicative Inverter for Hardware Elliptic Curve Cryptosystem

inferred← citeshttps://doi.org/10.1007/978-3-662-46800-5_19openalex-snapshot

Inner Product Masking Revisited

inferred← citeshttps://doi.org/10.1007/978-3-662-53887-6_7openalex-snapshot

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity

inferred← citeshttps://doi.org/10.1007/bfb0028484openalex-snapshot

Efficient elliptic curve exponentiation

inferred← citeshttps://doi.org/10.1007/bfb0052247openalex-snapshot

Efficient algorithms for elliptic curve cryptosystems

inferred← citeshttps://doi.org/10.1007/bfb0054024openalex-snapshot

A practical implementation of elliptic curve cryptosystems over GF(p) on a 16-bit microcomputer

inferred← citeshttps://doi.org/10.1007/bfb0054867openalex-snapshot

On the performance of signature schemes based on elliptic curves

inferred← citeshttps://doi.org/10.1007/bfb0055739openalex-snapshot

An elliptic curve implementation of the finite field digital signature algorithm

inferred← citeshttps://doi.org/10.1007/bfb0055748openalex-snapshot

Optimal extension fields for fast arithmetic in public-key algorithms

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/s10440-006-9046-1openalex-snapshot

Efficient Software-Implementation of Finite Fields with Applications to Cryptography

inferred← citeshttps://doi.org/10.1007/s10916-011-9700-7openalex-snapshot

An Efficient Key-Management Scheme for Hierarchical Access Control in E-Medicine System

inferred← citeshttps://doi.org/10.1007/s10916-012-9920-5openalex-snapshot

An Effective and Secure Key-Management Scheme for Hierarchical Access Control in E-Medicine System

inferred← citeshttps://doi.org/10.1007/springerreference_315openalex-snapshot

Itoh-Tsujii Inversion Algorithm

inferred← citeshttps://doi.org/10.1016/j.compeleceng.2010.01.001openalex-snapshot

Efficient bit-parallel multipliers over finite fields GF(2m)

inferred← citeshttps://doi.org/10.1016/j.future.2003.09.005openalex-snapshot

A threshold signature scheme for group communications without a shared distribution center

inferred← citeshttps://doi.org/10.1016/j.jksuci.2013.10.007openalex-snapshot

A novel and efficient user access control scheme for wireless body area sensor networks

inferred← citeshttps://doi.org/10.1016/j.mee.2006.02.009openalex-snapshot

An area-efficient bit-serial integer and GF(2n) multiplier

inferred← citeshttps://doi.org/10.1016/j.vlsi.2026.102769openalex-snapshot

An area-efficient and low-latency GF(2m) multiplier for FPGA applications

inferred← citeshttps://doi.org/10.1016/s0920-5489(03)00002-3openalex-snapshot

A new anonymous conference key distribution system based on the elliptic curve discrete logarithm problem

inferred← citeshttps://doi.org/10.1023/a:1008208521515openalex-snapshot

Montgomery Multiplication in GF(2k)

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.2012.0210openalex-snapshot

Low-complexity design of bit-parallel dual-basis multiplier over GF(2 m )

inferred← citeshttps://doi.org/10.1049/ip-com:20050022openalex-snapshot

Lookup table based multiplication technique for GF(2m) with cryptographic significance

inferred← citeshttps://doi.org/10.1090/s0025-5718-03-01515-1openalex-snapshot

Irreducible trinomials over finite fields

inferred← citeshttps://doi.org/10.1090/s0025-5718-07-02048-0openalex-snapshot

The double-base number system and its application to elliptic curve cryptography

inferred← citeshttps://doi.org/10.1109/12.805153openalex-snapshot

Fast arithmetic for public-key algorithms in Galois fields with composite exponents

inferred← citeshttps://doi.org/10.1109/12.863045openalex-snapshot

Look-up table-based large finite field multiplication in memory constrained cryptosystems

inferred← citeshttps://doi.org/10.1109/12.888041openalex-snapshot

Testing SRAM-based content addressable memories

inferred← citeshttps://doi.org/10.1109/12.956092openalex-snapshot

Power analysis attacks and algorithmic approaches to their countermeasures for Koblitz curve cryptosystems

inferred← citeshttps://doi.org/10.1109/arith.1997.614899openalex-snapshot

Fast software exponentiation in GF(2/sup k/)

inferred← citeshttps://doi.org/10.1109/arith.2001.930105openalex-snapshot

Efficient computation of multiplicative inverses for cryptographic applications

inferred← citeshttps://doi.org/10.1109/icact.2008.4493939openalex-snapshot

A Novel Algebraic Approach to Power Analysis Attack-Resistant Countermeasure for Koblitz Curve Cryptosystems in Mobile Devices

inferred← citeshttps://doi.org/10.1109/icassp.2017.7952342openalex-snapshot

New residue arithmetic based Barrett algorithms: Modular polynomial computations

inferred← citeshttps://doi.org/10.1109/isbast.2008.4547661openalex-snapshot

Faster polynomial basis finite field squaring and inversion for GF(2m) with cryptographic software application

inferred← citeshttps://doi.org/10.1109/mascot.2001.948875openalex-snapshot

Performance of finite field arithmetic in an elliptic curve cryptosystem

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/msmw.2001.947284openalex-snapshot

Q-factors of a waveguide dielectric resonator with two-layer dielectric on the H/sub onδ/ modes oscillations types

inferred← citeshttps://doi.org/10.1109/sccc.1998.730787openalex-snapshot

An improvement of the Guajardo-Paar method for multiplication on non-supersingular elliptic curves

inferred← citeshttps://doi.org/10.1109/securecomm.2005.52openalex-snapshot

Soft-Timeout Distributed Key Generation for Digital Signature based on Elliptic Curve D-log for Low-Power Devices

inferred← citeshttps://doi.org/10.1109/sips.2001.957349openalex-snapshot

Hardware/software co-design of an elliptic curve public-key cryptosystem

inferred← citeshttps://doi.org/10.1109/tc.2002.1024743openalex-snapshot

A new addition formula for elliptic curves over GF(2/sup n/)

inferred← citeshttps://doi.org/10.1109/tc.2003.1244937openalex-snapshot

Constructing composite field representations for efficient conversion

inferred← citeshttps://doi.org/10.1109/tc.2004.43openalex-snapshot

Field inversion and point halving revisited

inferred← citeshttps://doi.org/10.1109/tc.2005.109openalex-snapshot

Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems

inferred← citeshttps://doi.org/10.1109/tc.2010.141openalex-snapshot

Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation

inferred← citeshttps://doi.org/10.1109/tcsi.2006.880184openalex-snapshot

Hardware Elliptic Curve Cryptographic Processor Over $rm GF(p)$

inferred← citeshttps://doi.org/10.1109/tdsc.2015.2445760openalex-snapshot

Optimized Identity-Based Encryption from Bilinear Pairing for Lightweight Devices

inferred← citeshttps://doi.org/10.1109/tla.2008.4917435openalex-snapshot

A Scalable Finite Field Multiplier

inferred← citeshttps://doi.org/10.1145/2093139.2093141openalex-snapshot

Efficient software implementations of large finite fields GF (2 n ) for secure storage applications

inferred← citeshttps://doi.org/10.1145/2925426.2926259openalex-snapshot

Fast Multiplication in Binary Fields on GPUs via Register Cache

inferred← citeshttps://doi.org/10.1145/384101.384146openalex-snapshot

Irreducible trinomials over finite fields

inferred← citeshttps://doi.org/10.13067/jkiecs.2015.10.3.387openalex-snapshot

Fast Elliptic Curve Cryptosystems using Anomalous Bases over Finite Fields

inferred← citeshttps://doi.org/10.1504/ijcnds.2014.059434openalex-snapshot

An efficient access control scheme in user hierarchy based on polynomial interpolation and hash function

inferred← citeshttps://doi.org/10.1504/ijtmcc.2014.067303openalex-snapshot

A survey on user access control in wireless sensor networks with formal security verification

inferred← citeshttps://doi.org/10.15388/informatica.2003.008openalex-snapshot

Simple Generalized Group‐Oriented Cryptosystems Using ElGamal Cryptosystem

inferred← citeshttps://doi.org/10.25916/sut.26294107openalex-snapshot

VLSI implementation and its optimisation for digital cryptosystems

inferred← citeshttps://doi.org/10.3390/e22070790openalex-snapshot

A Protocol Design Paradigm for Batched Sparse Codes

inferred← citeshttps://doi.org/10.4018/978-1-4666-5808-0.ch009openalex-snapshot

An Area-Efficient Composite Field Inverter for Elliptic Curve Cryptosystems

inferred← citeshttps://doi.org/10.4134/ckms.2003.18.1.159openalex-snapshot

IMPLEMENTATION ISSUES FOR ARITHMETIC OVER EXTENSION FIELDS OF CHARACTERISTIC ODD

inferred← citeshttps://doi.org/10.46586/tches.v2022.i3.192-222openalex-snapshot

On Efficient and Secure Code-based Masking: A Pragmatic Evaluation

inferred← citeshttps://doi.org/10.5120/6159-8564openalex-snapshot

Performance Analysis of Spread Spectrum with Prime Codes in a Wireless System Over a fading Channel

inferred← citeshttps://doi.org/10.5121/ijcsit.2011.3307openalex-snapshot

A Review on Elliptic Curve Cryptography for Embedded Systems

inferred← citeshttps://doi.org/10.7840/kics.2015.40.9.1786openalex-snapshot

Practical Implementation and Performance Evaluation of Random Linear Network Coding

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.