On the public citation graph

Efficient elliptic curve exponentiation

https://doi.org/10.1007/bfb0028484
0 signed · 101 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/0-387-34805-0_22openalex-snapshot
Efficient Identification and Signatures for Smart Cards
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-46885-4_68openalex-snapshot
Efficient Identification and Signatures for Smart Cards
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-47555-9_18openalex-snapshot
Fast Exponentiation with Precomputation
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/978-1-4757-1920-8openalex-snapshot
The Arithmetic of Elliptic Curves
inferredcites →https://doi.org/10.1007/bfb0034836openalex-snapshot
A fast software implementation for arithmetic operations in GF(2n)
inferredcites →https://doi.org/10.1016/0196-8858(86)90023-0openalex-snapshot
Sequences of numbers generated by addition in formal groups and new primality and factorization tests
inferredcites →https://doi.org/10.1051/ita/1990240605311openalex-snapshot
Speeding up the computations on an elliptic curve using addition-subtraction chains
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
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/tit.1976.1055638openalex-snapshot
New directions in cryptography
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.1109/tit.1985.1057074openalex-snapshot
A public key cryptosystem and a signature scheme based on discrete logarithms
inferredcites →https://doi.org/10.1145/103418.103434openalex-snapshot
Reducing elliptic curve logarithms to logarithms in a finite field
inferredcites →https://doi.org/10.1145/357980.358017openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems
inferredcites →https://doi.org/10.1145/359340.359342openalex-snapshot
A method for obtaining digital signatures and public-key cryptosystems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1002/dac.3327openalex-snapshot
Accelerated precomputation points–based scalar reduction on elliptic curve cryptography for wireless sensor networks
inferred← citeshttps://doi.org/10.1002/sec.1047openalex-snapshot
Elliptic‐curve scalar multiplication algorithm using ZOT structure
inferred← citeshttps://doi.org/10.1007/10718964_6openalex-snapshot
Efficient Scalar Multiplications on Elliptic Curves without Repeated Doublings and Their Practical Performance
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/11496618_11openalex-snapshot
Fractional Windows Revisited:Improved Signed-Digit Representations for Efficient Exponentiation
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/11599371_19openalex-snapshot
A Note on Signed Binary Window Algorithm for Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/11601494_16openalex-snapshot
An Advanced Method for Joint Scalar Multiplications on Memory Constraint Devices
inferred← citeshttps://doi.org/10.1007/11693383_24openalex-snapshot
SPA Resistant Left-to-Right Integer Recodings
inferred← citeshttps://doi.org/10.1007/11745853_13openalex-snapshot
Efficient Scalar Multiplication by Isogeny Decompositions
inferred← citeshttps://doi.org/10.1007/11935308_37openalex-snapshot
Efficient Implementation of Public Key Cryptosystems on Mote Sensors (Short Paper)
inferred← citeshttps://doi.org/10.1007/11941378_24openalex-snapshot
Extended Double-Base Number System with Applications to Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/3-540-36400-5_22openalex-snapshot
The Montgomery Powering Ladder
inferred← citeshttps://doi.org/10.1007/3-540-36552-4_21openalex-snapshot
Improved Techniques for Fast Exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-36563-x_23openalex-snapshot
The Width-w NAF Method Provides Small Memory and Fast Elliptic Scalar Multiplications Secure against Side Channel Attacks
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-44647-8_11openalex-snapshot
Faster Point Multiplication on Elliptic Curves with Efficient Endomorphisms
inferred← citeshttps://doi.org/10.1007/3-540-44709-1_31openalex-snapshot
Protections against Differential Analysis for Elliptic Curve Cryptography — An Algebraic Approach —
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_19openalex-snapshot
Software Implementation of the NIST Elliptic Curves Over Prime Fields
inferred← citeshttps://doi.org/10.1007/3-540-45439-x_22openalex-snapshot
Securing Elliptic Curve Point Multiplication against Side-Channel Attacks
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_13openalex-snapshot
Algorithms for Multi-exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_21openalex-snapshot
On the Power of Multidoubling in Speeding Up Elliptic Scalar Multiplication
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_8openalex-snapshot
Design of Hyperelliptic Cryptosystems in Small Characteristic and a Software Implementation over F2 n
inferred← citeshttps://doi.org/10.1007/3-7643-7394-6_5openalex-snapshot
Efficient and Secure Public-Key Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-030-42921-8_19openalex-snapshot
Evaluating the Cache Side Channel Attacks Against ECDSA
inferred← citeshttps://doi.org/10.1007/978-3-540-28628-8_8openalex-snapshot
Signed Binary Representations Revisited
inferred← citeshttps://doi.org/10.1007/978-3-540-28632-5_11openalex-snapshot
Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations
inferred← citeshttps://doi.org/10.1007/978-3-540-30144-8_9openalex-snapshot
Radix-r Non-Adjacent Form
inferred← citeshttps://doi.org/10.1007/978-3-540-30564-4_9openalex-snapshot
A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_31openalex-snapshot
A More Flexible Countermeasure against Side Channel Attacks Using Window Method
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-74462-7_15openalex-snapshot
Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-540-76788-6_23openalex-snapshot
Generalized MMM-Algorithm Secure Against SPA, DPA, and RPA
inferred← citeshttps://doi.org/10.1007/978-3-540-85855-3_4openalex-snapshot
Faster Multi-exponentiation through Caching: Accelerating (EC)DSA Signature Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-23300-5_16openalex-snapshot
Shifting Primes: Extension of Pseudo-Mersenne Primes to Optimize ECC for MSP430-Based Future Internet of Things Devices
inferred← citeshttps://doi.org/10.1007/978-3-642-35668-1_21openalex-snapshot
Parallel Scalar Multiplication on Elliptic Curves in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-662-43414-7_23openalex-snapshot
Faster Repeated Doublings on Binary Elliptic Curves
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/s00145-004-0218-8openalex-snapshot
Analysis of the Sliding Window Powering Algorithm
inferred← citeshttps://doi.org/10.1007/s00145-004-0229-5openalex-snapshot
The Complexity of Certain Multi-Exponentiation Techniques in Cryptography
inferred← citeshttps://doi.org/10.1007/s00453-006-0105-9openalex-snapshot
Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and Its Combination with Point Halving: Extensions and Mathematical Analysis
inferred← citeshttps://doi.org/10.1016/j.ipl.2004.02.015openalex-snapshot
Addition chains with a bounded number of registers
inferred← citeshttps://doi.org/10.1016/s0167-9260(02)00053-6openalex-snapshot
Hardware architectures for public key cryptography
inferred← citeshttps://doi.org/10.1017/cbo9780511546570.012openalex-snapshot
Cryptography from Pairings
inferred← citeshttps://doi.org/10.1049/iet-cds.2012.0367openalex-snapshot
Randomised multi‐modulo residue number system architecture for double‐and‐add to prevent power analysis side channel attacks
inferred← citeshttps://doi.org/10.1090/s0025-5718-05-01769-2openalex-snapshot
Minimality and other properties of the width-𝑤 nonadjacent form
inferred← citeshttps://doi.org/10.1093/ietfec/e89-a.8.2207openalex-snapshot
Secure Elliptic Curve Exponentiation against RPA, ZRA, DPA, and SPA
inferred← citeshttps://doi.org/10.1093/ietfec/e91-a.10.2833openalex-snapshot
Generalized Scalar Multiplication Secure against SPA, DPA, and RPA
inferred← citeshttps://doi.org/10.1109/aspdac.2013.6509667openalex-snapshot
DARNS:A randomized multi-modulo RNS architecture for double-and-add in ECC to prevent power analysis side channel attacks
inferred← citeshttps://doi.org/10.1109/cmce.2010.5609834openalex-snapshot
An efficient elliptic curve scalar multiplication algorithm against side channel attacks
inferred← citeshttps://doi.org/10.1109/ent47717.2019.9030592openalex-snapshot
Efficient Implementation of Cryptography on Points of an Elliptic Curve in Residue Number System
inferred← citeshttps://doi.org/10.1109/icaicta.2015.7335349openalex-snapshot
Elliptic curve cryptography: Algorithms and implementation analysis over coordinate systems
inferred← citeshttps://doi.org/10.1109/icccas.2005.1495347openalex-snapshot
A timing-and-area tradeoff GF(p) elliptic curve processor architecture for FPGA
inferred← citeshttps://doi.org/10.1109/icccas.2006.285150openalex-snapshot
A Resource Efficient Architecture for RSA and Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1109/ichit.2006.167openalex-snapshot
Left-to-right Generalized Non-adjacent Form Recoding for Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1109/ichit.2006.253503openalex-snapshot
Left-to-right Generalized Non-adjacent Form Recoding for Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1109/icicisys.2009.5358153openalex-snapshot
New m-DBL based evaluation scheme for efficient scalar multiplication in ECC
inferred← citeshttps://doi.org/10.1109/mwscas.2013.6674908openalex-snapshot
Timing analysis in software and hardware to implement NIST elliptic curves over prime fields
inferred← citeshttps://doi.org/10.1109/tifs.2024.3435062openalex-snapshot
ZeroShield: Transparently Mitigating Code Page Sharing Attacks With Zero-Cost Stand-By
inferred← citeshttps://doi.org/10.1109/waina.2010.47openalex-snapshot
Analytical Study of Implementation Issues of Elliptical Curve Cryptography for Wireless Sensor networks
inferred← citeshttps://doi.org/10.1142/9789812793430_0010openalex-snapshot
Trace Zero Varieties over Fields of Characteristic 2 for Cryptographic Applications
inferred← citeshttps://doi.org/10.1145/2976749.2978400openalex-snapshot
Attacking OpenSSL Implementation of ECDSA with a Few Signatures
inferred← citeshttps://doi.org/10.11591/eei.v13i2.5437openalex-snapshot
Challenges in data representation for efficient execution of encryption operation
inferred← citeshttps://doi.org/10.11606/d.3.2019.tde-15042019-141848openalex-snapshot
z-NAF e clipping: two improvements for post-quantum hash-based digital signatures.
inferred← citeshttps://doi.org/10.1504/ijsn.2006.011772openalex-snapshot
Elliptic curve cryptography-based access control in sensor networks
inferred← citeshttps://doi.org/10.17762/ijcnis.v11i1.3827openalex-snapshot
Efficient and Secure ECDSA Algorithm and its Applications: A Survey
inferred← citeshttps://doi.org/10.20381/ruor-12517openalex-snapshot
Accelerating the scalar multiplication on genus 2 hyperelliptic curve cryptosystems
inferred← citeshttps://doi.org/10.20533/ijrfidsc.2046.3715.2013.0009openalex-snapshot
Comparative Study of Elliptic Curve Cryptography Hardware Implementations in Wireless Sensor Networks
inferred← citeshttps://doi.org/10.3217/8yzsz-1x027openalex-snapshot
Analysis of digital expansions to imaginary quadratic bases
inferred← citeshttps://doi.org/10.3923/itj.2009.403.410openalex-snapshot
Hardware/Software Co-Design Implementations of Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.3929/ethz-a-006206981openalex-snapshot
Improving a privacy-preserving clone detection mechanism with elliptic curve cryptography
inferred← citeshttps://doi.org/10.3934/amc.2010.4.261openalex-snapshot
Efficient reduction of large divisors on hyperelliptic curves
inferred← citeshttps://doi.org/10.4304/jcm.7.8.622-633openalex-snapshot
A Secure Message Transaction Protocol for Delay Tolerant Networks
inferred← citeshttps://doi.org/10.47277/ijcncs/2(12)6openalex-snapshot
Improved Arithmetic on Elliptic Curves over Prime Field
inferred← citeshttps://doi.org/10.54039/ijcnis.v11i1.3827openalex-snapshot
Efficient and Secure ECDSA Algorithm and its Applications: A Survey
inferred← citeshttps://doi.org/10.70675/86212ed3z3b5bz489bz8cb3z87ef3f85dd6bopenalex-snapshot
Elliptic curve cryptography algorithms resistant against power analysis attacks on resource constrained devices
inferred← citeshttps://doi.org/10.7763/ijiee.2013.v3.269openalex-snapshot
A Proposed Implementation of Elliptic Curve Exponentiation over Prime Field (Fp) in the Global Smart Cards
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.