On the public citation graph

A New Baby-Step Giant-Step Algorithm and Some Applications to Cryptanalysis

https://doi.org/10.1007/11545262_4
0 signed · 42 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/10958513_9openalex-snapshot
A Fast Signature Scheme Based on New On-line Computation
inferredcites →https://doi.org/10.1007/3-540-36504-4_12openalex-snapshot
An Improved Fast Signature Scheme without Online Multiplication
inferredcites →https://doi.org/10.1007/3-540-45539-6_15openalex-snapshot
Practical Threshold Signatures
inferredcites →https://doi.org/10.1007/3-540-45961-8_11openalex-snapshot
A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory
inferredcites →https://doi.org/10.1007/3-540-46416-6_42openalex-snapshot
Self-certified public keys
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-47721-7_12openalex-snapshot
How To Prove Yourself: Practical Solutions to Identification and Signature Problems
inferredcites →https://doi.org/10.1007/978-3-540-28632-5_30openalex-snapshot
Public Key Authentication with One (Online) Single Addition
inferredcites →https://doi.org/10.1007/978-3-540-45126-6_10openalex-snapshot
Cryptanalysis of the OTM Signature Scheme from FC’02
inferredcites →https://doi.org/10.1007/978-3-662-02945-9openalex-snapshot
A Course in Computational Algebraic Number Theory
inferredcites →https://doi.org/10.1007/bfb0054143openalex-snapshot
Security analysis of a practical “on the fly” authentication and signature generation
inferredcites →https://doi.org/10.1016/s0166-218x(02)00588-7openalex-snapshot
Random small Hamming weight products with applications to cryptography
inferredcites →https://doi.org/10.1023/a:1008350005447openalex-snapshot
Discrete Logarithms: The Past and the Future
inferredcites →https://doi.org/10.1090/s0025-5718-01-01310-2openalex-snapshot
Some baby-step giant-step algorithms for the low hamming weight discrete logarithm problem
inferredcites →https://doi.org/10.1090/s0025-5718-1978-0491431-9openalex-snapshot
Monte Carlo methods for index computation (𝑚𝑜𝑑𝑝)
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1109/tit.1976.1055638openalex-snapshot
New directions in cryptography
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
inferredcites →https://doi.org/10.2307/2006496openalex-snapshot
Monte Carlo Methods for Index Computation (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.1007/11792086_41openalex-snapshot
Hard Instances of the Constrained Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/11967668_22openalex-snapshot
A Practical and Tightly Secure Signature Scheme Without Hash Function
inferred← citeshttps://doi.org/10.1007/11967668_24openalex-snapshot
Public Key Cryptography and RFID Tags
inferred← citeshttps://doi.org/10.1007/978-3-319-59870-3_31openalex-snapshot
Solving the DLP with Low Hamming Weight Product Exponents and Improved Attacks on the GPS Identification Scheme
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_6openalex-snapshot
Computing Low-Weight Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-540-78440-1_19openalex-snapshot
A Parameterized Splitting System and Its Application to the Discrete Logarithm Problem with Low Hamming Weight Product Exponents
inferred← citeshttps://doi.org/10.1007/978-3-540-85053-3_13openalex-snapshot
The Carry Leakage on the Randomized Exponent Countermeasure
inferred← citeshttps://doi.org/10.1016/j.dam.2007.09.018openalex-snapshot
Analysis of Low Hamming Weight Products
inferred← citeshttps://doi.org/10.1093/comjnl/bxz040openalex-snapshot
Cryptanalysis of Server-Aided RSA Protocols with Private-Key Splitting
inferred← citeshttps://doi.org/10.1109/fdtc.2009.36openalex-snapshot
Fault Attack on Schnorr Based Identification and Signature Schemes
inferred← citeshttps://doi.org/10.1109/icacci.2014.6968403openalex-snapshot
Smart card based password authentication and user anonymity scheme using ECC and steganography
inferred← citeshttps://doi.org/10.1109/reconfig.2012.6416754openalex-snapshot
Hardware implementation of the GPS authentication
inferred← citeshttps://doi.org/10.1109/roedunet68395.2025.11208453openalex-snapshot
Practical Cryptanalysis of ECDSA: Comparative Efficiency Analysis of Brute-Force and Baby-Step Giant-Step Key Recovery Methods
inferred← citeshttps://doi.org/10.1109/tdsc.2022.3218793openalex-snapshot
Hercules: Boosting the Performance of Privacy-Preserving Federated Learning
inferred← citeshttps://doi.org/10.1109/tdsc.2022.3228236openalex-snapshot
ACA: Anonymous, Confidential and Auditable Transaction Systems for Blockchain
inferred← citeshttps://doi.org/10.1109/tit.2010.2044071openalex-snapshot
Parameterized Splitting Systems for the Discrete Logarithm
inferred← citeshttps://doi.org/10.3390/e16095144openalex-snapshot
Nonlinearities in Elliptic Curve Authentication
inferred← citeshttps://doi.org/10.3390/math11010122openalex-snapshot
Optimal Elliptic-Curve Subspaces for Applications in Double-Authenticated Requests in Mobile Distributed Data Mining
inferred← citeshttps://doi.org/10.4018/ijdcf.2019070105openalex-snapshot
Cloud-ElGamal and Fast Cloud-RSA Homomorphic Schemes for Protecting Data Confidentiality in Cloud Computing
inferred← citeshttps://doi.org/10.4236/ijcns.2010.37077openalex-snapshot
Hybrid Authentication Cybersystem Based on Discrete Logarithm, Factorization and Array Entanglements
inferred← citeshttps://doi.org/10.48550/arxiv.math/0606771openalex-snapshot
Hard Instances of the Constrained Discrete Logarithm Problem
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.