On the public citation graph
Efficient exponentiation using precomputation and vector addition chains
0 signed · 98 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-46877-3_6openalex-snapshot
An Interactive Identification Scheme Based on Discrete Logarithms and Factoring
inferredcites →https://doi.org/10.1007/3-540-47555-9_18openalex-snapshot
Fast Exponentiation with Precomputation
inferredcites →https://doi.org/10.1007/3-540-57220-1_82openalex-snapshot
The fast cascade exponentiation algorithm and its applications on cryptography
inferredcites →https://doi.org/10.1007/bf00191319openalex-snapshot
An interactive identification scheme based on discrete logarithms and factoring
inferredcites →https://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferredcites →https://doi.org/10.1049/ip-cdt:19941271openalex-snapshot
Multi-exponentiation (cryptographic protocols)
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/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.1006/jagm.1997.0913openalex-snapshot
A Survey of Fast Exponentiation Methods
inferred← citeshttps://doi.org/10.1007/10719994_9openalex-snapshot
Speeding Up Elliptic Scalar Multiplication with Precomputation
inferred← citeshttps://doi.org/10.1007/11573937_48openalex-snapshot
A Parallel Modular Exponentiation Scheme for Transformed Exponents
inferred← citeshttps://doi.org/10.1007/3-540-36231-2_16openalex-snapshot
Authentication of Concast Communication
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_12openalex-snapshot
Fast Generation of Pairs (k, [k]P) for Koblitz Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_13openalex-snapshot
Algorithms for Multi-exponentiation
inferred← citeshttps://doi.org/10.1007/3-540-46513-8_12openalex-snapshot
Improving and Extending the Lim/Lee Exponentiation Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-48405-1_3openalex-snapshot
The Hardness of the Hidden Subset Sum Problem and Its Cryptographic Implications
inferred← citeshttps://doi.org/10.1007/3-540-49264-x_6openalex-snapshot
Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures
inferred← citeshttps://doi.org/10.1007/3-540-63163-1_8openalex-snapshot
Exponentiation in finite fields: Theory and practice
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-3-030-71522-9_29openalex-snapshot
Fixed-Base Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-031-52163-8_5openalex-snapshot
Rational Approximations, Multidimensional Continued Fractions, and Lattice Reduction
inferred← citeshttps://doi.org/10.1007/978-3-031-56326-3_9openalex-snapshot
PointPuff: An Ed25519 Optimization Implementation
inferred← citeshttps://doi.org/10.1007/978-3-032-06754-8_4openalex-snapshot
Fast Elliptic Curve Scalar Multiplications in SN(T)ARK Circuits
inferred← citeshttps://doi.org/10.1007/978-3-032-32560-0_10openalex-snapshot
Faster Signature Verification with 3-Dimensional Decomposition
inferred← citeshttps://doi.org/10.1007/978-3-032-34519-6_26openalex-snapshot
Translocation Distance in Unary Encodings: Exact and Approximation Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-0348-8295-8_24openalex-snapshot
Distribution of Modular Sums and the Security of the Server Aided Exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-319-04873-4_14openalex-snapshot
PandA: Pairings and Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-319-17533-1_14openalex-snapshot
Batch Blind Signatures on Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-319-40253-6_19openalex-snapshot
Accelerating Oblivious Transfer with Batch Multi-exponentiation
inferred← citeshttps://doi.org/10.1007/978-3-319-66402-6_14openalex-snapshot
Reusing Nonces in Schnorr Signatures
inferred← citeshttps://doi.org/10.1007/978-3-540-24587-2_75openalex-snapshot
Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic
inferred← citeshttps://doi.org/10.1007/978-3-540-30576-7_15openalex-snapshot
How to Securely Outsource Cryptographic Computations
inferred← citeshttps://doi.org/10.1007/978-3-540-31815-6_27openalex-snapshot
Signed Digit Representation with NAF and Balanced Ternary Form and Efficient Exponentiation in GF(q n ) Using a Gaussian Normal Basis of Type II
inferred← citeshttps://doi.org/10.1007/978-3-540-45215-7_36openalex-snapshot
Authentication of Anycast Communication
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_19openalex-snapshot
Efficient Exponentiation for a Class of Finite Fields GF(2 n ) Determined by Gauss Periods
inferred← citeshttps://doi.org/10.1007/978-3-540-76900-2_3openalex-snapshot
Faster Addition and Doubling on Elliptic Curves
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-540-89255-7_20openalex-snapshot
Twisted Edwards Curves Revisited
inferred← citeshttps://doi.org/10.1007/978-3-642-23951-9_9openalex-snapshot
High-Speed High-Security Signatures
inferred← citeshttps://doi.org/10.1007/978-3-642-24669-2_31openalex-snapshot
Binary Addition Chain on EREW PRAM
inferred← citeshttps://doi.org/10.1007/978-3-642-27257-8_12openalex-snapshot
A Hardware Processor Supporting Elliptic Curve Cryptography for Less than 9 kGEs
inferred← citeshttps://doi.org/10.1007/978-3-642-29615-4_18openalex-snapshot
Exploring the Design Space of Prime Field vs. Binary Field ECC-Hardware Implementations
inferred← citeshttps://doi.org/10.1007/978-3-642-34931-7_26openalex-snapshot
Faster Batch Forgery Identification
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_14openalex-snapshot
Worst-Case Analysis of an Algorithm for Computing the Greatest Common Divisor of n Inputs
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/978-981-95-3551-4_3openalex-snapshot
A New Asymmetric Three-Party Key Agreement Protocol Based on Secure Multiparty Computation
inferred← citeshttps://doi.org/10.1007/bfb0054129openalex-snapshot
Speeding up discrete log and factoring based schemes via precomputations
inferred← citeshttps://doi.org/10.1007/bfb0054130openalex-snapshot
Fast batch verification for modular exponentiation and digital signatures
inferred← citeshttps://doi.org/10.1007/s00453-020-00750-2openalex-snapshot
Privately Outsourcing Exponentiation to a Single Server: Cryptanalysis and Optimal Constructions
inferred← citeshttps://doi.org/10.1007/s00607-010-0119-7openalex-snapshot
A new strategy for generating shortest addition sequences
inferred← citeshttps://doi.org/10.1007/s00607-010-0122-zopenalex-snapshot
Star reduction among minimal length addition chains
inferred← citeshttps://doi.org/10.1007/s10586-018-2840-5openalex-snapshot
A fast GPU-based hybrid algorithm for addition chains
inferred← citeshttps://doi.org/10.1007/s10623-005-3710-8openalex-snapshot
Speeding up Exponentiation using an Untrusted Computational Resource
inferred← citeshttps://doi.org/10.1007/s10623-006-9016-7openalex-snapshot
Sparse polynomials, redundant bases, gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields
inferred← citeshttps://doi.org/10.1007/s10817-005-9022-xopenalex-snapshot
Mechanically Proving Termination Using Polynomial Interpretations
inferred← citeshttps://doi.org/10.1007/s11227-017-2129-0openalex-snapshot
A fast optimal parallel algorithm for a short addition chain
inferred← citeshttps://doi.org/10.1007/s13389-012-0027-1openalex-snapshot
High-speed high-security signatures
inferred← citeshttps://doi.org/10.1007/s13389-012-0032-4openalex-snapshot
Multi-exponentiation algorithm based on binary GCD computation and its application to side-channel countermeasure
inferred← citeshttps://doi.org/10.1007/s13389-026-00393-zopenalex-snapshot
Computing multi-scalar multiplication on memory-constrained devices
inferred← citeshttps://doi.org/10.1016/j.comnet.2017.08.006openalex-snapshot
Energy-efficient mechanisms in security of the internet of things: A survey
inferred← citeshttps://doi.org/10.1016/j.future.2015.12.009openalex-snapshot
Batch Public Key Cryptosystem with batch multi-exponentiation
inferred← citeshttps://doi.org/10.1016/j.jisa.2024.103898openalex-snapshot
High-speed batch verification for discrete-logarithm-based signatures via Multi-Scalar Multiplication Algorithm
inferred← citeshttps://doi.org/10.1016/j.jsc.2017.07.004openalex-snapshot
The Brun gcd algorithm in high dimensions is almost always subtractive
inferred← citeshttps://doi.org/10.1016/j.vlsi.2024.102286openalex-snapshot
Accelerating large-scale multi-scalar multiplication in Zk-SNARK through exploiting its multilevel parallelism
inferred← citeshttps://doi.org/10.1016/s0020-0190(98)00044-1openalex-snapshot
An algorithm for modular exponentiation
inferred← citeshttps://doi.org/10.1016/s0164-1212(98)00007-7openalex-snapshot
An adaptive exponentiation method
inferred← citeshttps://doi.org/10.1017/s0004972722000442openalex-snapshot
PRIMITIVE ELEMENT PAIRS WITH A PRESCRIBED TRACE IN THE CUBIC EXTENSION OF A FINITE FIELD
inferred← citeshttps://doi.org/10.1090/s0025-5718-2012-02633-0openalex-snapshot
ECM using Edwards curves
inferred← citeshttps://doi.org/10.1109/12.709375openalex-snapshot
Exponentiation using division chains
inferred← citeshttps://doi.org/10.1109/arith.1997.614883openalex-snapshot
Exponentiation using division chains
inferred← citeshttps://doi.org/10.1109/cns.2018.8433140openalex-snapshot
Delegating Elliptic-Curve Operations with Homomorphic Encryption
inferred← citeshttps://doi.org/10.1109/jiot.2023.3279283openalex-snapshot
ACKE: Asymmetric Computing Key Exchange Protocol for IoT Environments
inferred← citeshttps://doi.org/10.1109/mcas.2003.1242832openalex-snapshot
Loading the bases: a new number representation with applications
inferred← citeshttps://doi.org/10.1109/tc.2015.2500570openalex-snapshot
Precomputation Methods for Hash-Based Signatures on Energy-Harvesting Platforms
inferred← citeshttps://doi.org/10.1109/tcad.2014.2387866openalex-snapshot
Secure and Efficient Architectures for Single Exponentiations in Finite Fields Suitable for High-Performance Cryptographic Applications
inferred← citeshttps://doi.org/10.1109/tit.2010.2059831openalex-snapshot
Fast Exponentiation Using Split Exponents
inferred← citeshttps://doi.org/10.1145/2835043.2835046openalex-snapshot
Computing Modular Exponentiation for Fixed-Exponent
inferred← citeshttps://doi.org/10.1145/2994603openalex-snapshot
Low-Cost Standard Signatures for Energy-Harvesting Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1145/3338466.3358913openalex-snapshot
Secure Delegation of Isogeny Computations and Cryptographic Applications
inferred← citeshttps://doi.org/10.17487/rfc2522openalex-snapshot
Photuris: Session-Key Management Protocol
inferred← citeshttps://doi.org/10.20948/mvk-2022-119openalex-snapshot
Bellman's, Knut's, Lupanov's, Pippenger's problems and their variations as generalizations of the addition chain problem
inferred← citeshttps://doi.org/10.23919/cje.2025.00.209openalex-snapshot
A Survey on the Implementation of zk-SNARK Hardware Accelerators
inferred← citeshttps://doi.org/10.46586/tches.v2023.i2.358-380openalex-snapshot
Speeding Up Multi-Scalar Multiplication over Fixed Points Towards Efficient zkSNARKs
inferred← citeshttps://doi.org/10.46586/tches.v2023.i3.194-220openalex-snapshot
cuZK: Accelerating Zero-Knowledge Proof with A Faster Parallel Multi-Scalar Multiplication Algorithm on GPUs
inferred← citeshttps://doi.org/10.5121/ijcsit.2011.3307openalex-snapshot
A Review on Elliptic Curve Cryptography for Embedded Systems
inferred← citeshttps://doi.org/10.70675/16812547z40d8z411cz8e13z65480ff1cf00openalex-snapshot
Try again. Fail again. Fail better : new notions of security, broken assumptions, and increased efficiency in cryptography
inferred← citeshttps://doi.org/10.70675/2e2fdb37z73a5z4b8eza105z21f0379f27b8openalex-snapshot
Lattice-based digital signature and discrete gaussian sampling
inferred← citeshttps://doi.org/10.70675/990b2e4ez19fcz4589z9730z1849d78815d4openalex-snapshot
Advances in public-key cryptology and computer exploitation
inferred← citeshttps://doi.org/10.70675/d79e8374z27e1z4823z9204z2c614d5eb724openalex-snapshot
Application of cryptographic and verification techniques to the security and privacy of information systems
inferred← citeshttps://doi.org/10.7146/dpb.v24i499.7027openalex-snapshot
Exponentiation, Modular Multiplication and VLSI Implementation of High-Speed RSA Cryptography
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.