On the public citation graph
Parallel Collision Search with Cryptanalytic Applications
0 signed · 546 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/0-387-34805-0_38openalex-snapshot
How easy is collision search. New results and applications to DES
inferredcites →https://doi.org/10.1007/3-540-46877-3_29openalex-snapshot
A Known-Plaintext Attack on Two-Key Triple Encryption
inferredcites →https://doi.org/10.1007/3-540-46885-4_35openalex-snapshot
Factoring by electronic mail
inferredcites →https://doi.org/10.1007/3-540-46885-4_43openalex-snapshot
How easy is collision search? Application to DES
inferredcites →https://doi.org/10.1007/3-540-47555-9_38openalex-snapshot
A Note on Discrete Logarithms with Special Structure
inferredcites →https://doi.org/10.1007/3-540-47555-9_44openalex-snapshot
On the Development of a Fast Elliptic Curve Cryptosystem
inferredcites →https://doi.org/10.1007/3-540-48285-7_3openalex-snapshot
Factoring Integers Using SIMD Sieves
inferredcites →https://doi.org/10.1007/3-540-58691-1_38openalex-snapshot
Lattice sieving and trial division
inferredcites →https://doi.org/10.1007/3-540-60865-6_44openalex-snapshot
RIPEMD-160: A strengthened version of RIPEMD
inferredcites →https://doi.org/10.1007/3-540-68697-5_18openalex-snapshot
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
inferredcites →https://doi.org/10.1007/bf00196725openalex-snapshot
Efficient signature generation by smart cards
inferredcites →https://doi.org/10.1007/bf00206323openalex-snapshot
Is the Data Encryption Standard a group? (Results of cycling experiments on DES)
inferredcites →https://doi.org/10.1007/bf01933190openalex-snapshot
An improved Monte Carlo factorization algorithm
inferredcites →https://doi.org/10.1007/bf01933667openalex-snapshot
A monte carlo method for factorization
inferredcites →https://doi.org/10.1007/springerreference_11671openalex-snapshot
data encryption standard
inferredcites →https://doi.org/10.1016/0890-5401(91)90001-iopenalex-snapshot
Toward a theory of Pollard's rho method
inferredcites →https://doi.org/10.1088/0031-9112/26/1/044openalex-snapshot
Introduction to Applied Probability
inferredcites →https://doi.org/10.1090/psapm/042/1095551openalex-snapshot
The 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.1090/s0025-5718-1993-1182953-4openalex-snapshot
The Factorization of the Ninth Fermat Number
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/c-m.1977.217750openalex-snapshot
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
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.1980.1056220openalex-snapshot
A cryptanalytic time-memory trade-off
inferredcites →https://doi.org/10.1137/0211030openalex-snapshot
The Complexity of Finding Cycles in Periodic Functions
inferredcites →https://doi.org/10.1145/103418.103473openalex-snapshot
Rigorous time/space tradeoffs for inverting functions
inferredcites →https://doi.org/10.1145/191177.191231openalex-snapshot
Parallel collision search with application to hash functions and discrete logarithms
inferredcites →https://doi.org/10.1145/214438.214442openalex-snapshot
On the power of cascade ciphers
inferredcites →https://doi.org/10.1145/358699.358718openalex-snapshot
On the security of multiple encryption
inferredcites →https://doi.org/10.13182/nse70-a19705openalex-snapshot
The Art of Computer Programming
inferredcites →https://doi.org/10.2307/2006496openalex-snapshot
Monte Carlo Methods for Index Computation (mod p)
inferredcites →https://doi.org/10.2307/2287077openalex-snapshot
An Introduction to Applied Probability.
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/cpe.70502openalex-snapshot
Parallel Algorithm for Approximate State Graph Exploration With Restricted Memory Footprint
inferred← citeshttps://doi.org/10.1007/10722028_18openalex-snapshot
Counting Points on Hyperelliptic Curves over Finite Fields
inferred← citeshttps://doi.org/10.1007/11426639_28openalex-snapshot
Second Preimages on n-Bit Hash Functions for Much Less than 2 n Work
inferred← citeshttps://doi.org/10.1007/11596219_15openalex-snapshot
Time-Memory Trade-Offs: False Alarm Detection Using Checkpoints
inferred← citeshttps://doi.org/10.1007/11604938_3openalex-snapshot
Application of LFSRs in Time/Memory Trade-Off Cryptanalysis
inferred← citeshttps://doi.org/10.1007/11689522_30openalex-snapshot
Integrating Grid with Cryptographic Computing
inferred← citeshttps://doi.org/10.1007/11745853_12openalex-snapshot
An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve
inferred← citeshttps://doi.org/10.1007/11745853_14openalex-snapshot
Curve25519: New Diffie-Hellman Speed Records
inferred← citeshttps://doi.org/10.1007/11761679_12openalex-snapshot
Herding Hash Functions and the Nostradamus Attack
inferred← citeshttps://doi.org/10.1007/11792086_41openalex-snapshot
Hard Instances of the Constrained Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/11894063_9openalex-snapshot
Breaking Ciphers with COPACOBANA –A Cost-Optimized Parallel Code Breaker
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_18openalex-snapshot
Security of Cryptosystems Based on Class Groups of Imaginary Quadratic Orders
inferred← citeshttps://doi.org/10.1007/3-540-44448-3_37openalex-snapshot
Cryptanalysis of the Yi-Lam Hash
inferred← citeshttps://doi.org/10.1007/3-540-44495-5_17openalex-snapshot
Efficient Construction of Cryptographically Strong Elliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-44598-6_11openalex-snapshot
Key Recovery and Forgery Attacks on the MacDES MAC Algorithm
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-44706-7_4openalex-snapshot
Mercy: A Fast Large Block Cipher for Disk Sector Encryption
inferred← citeshttps://doi.org/10.1007/3-540-44983-3_8openalex-snapshot
Speeding up the Arithmetic on Koblitz Curves of Genus Two
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_2openalex-snapshot
Finding Secure Curves with the Satoh-FGH Algorithm and an Early-Abort Strategy
inferred← citeshttps://doi.org/10.1007/3-540-44987-6_3openalex-snapshot
How Secure Are Elliptic Curves over Composite Extension Fields?
inferred← citeshttps://doi.org/10.1007/3-540-45311-3_19openalex-snapshot
Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
inferred← citeshttps://doi.org/10.1007/3-540-45353-9_23openalex-snapshot
Analysis of the Weil Descent Attack of Gaudry, Hess and Smart
inferred← citeshttps://doi.org/10.1007/3-540-45473-x_18openalex-snapshot
Bias in the LEVIATHAN Stream Cipher
inferred← citeshttps://doi.org/10.1007/3-540-45537-x_17openalex-snapshot
Random Walks Revisited: Extensions of Pollard’s Rho Algorithm for Computing Multiple Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/3-540-45539-6_2openalex-snapshot
An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_19openalex-snapshot
A Generalized Birthday Problem
inferred← citeshttps://doi.org/10.1007/3-540-45708-9_21openalex-snapshot
Black-Box Analysis of the Block-Cipher-Based Hash-Function Constructions from PGV
inferred← citeshttps://doi.org/10.1007/3-540-48311-x_1openalex-snapshot
Some Parallel Algorithms for Integer Factorisation
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-68697-5_19openalex-snapshot
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
inferred← citeshttps://doi.org/10.1007/3-540-68697-5_20openalex-snapshot
How to Protect DES Against Exhaustive Key Search
inferred← citeshttps://doi.org/10.1007/978-0-387-71817-0_8openalex-snapshot
Elliptic and Hyperelliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-0-387-71829-3_5openalex-snapshot
Hardware design for Hash functions
inferred← citeshttps://doi.org/10.1007/978-0-387-76481-8_13openalex-snapshot
Public-Key Cryptography for RFID Tags and Applications
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_246openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-5906-5_452openalex-snapshot
Generic Attacks Against DLP
inferred← citeshttps://doi.org/10.1007/978-1-4757-6856-5_3openalex-snapshot
Discrete Logarithms: The Past and the Future
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-1-4757-6856-5_6openalex-snapshot
Efficient Arithmetic on Koblitz Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-03326-2_2openalex-snapshot
Practical Attacks Against the Walnut Digital Signature Scheme
inferred← citeshttps://doi.org/10.1007/978-3-030-03807-6_1openalex-snapshot
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
inferred← citeshttps://doi.org/10.1007/978-3-030-10970-7_15openalex-snapshot
On the Cost of Computing Isogenies Between Supersingular Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-17259-6_22openalex-snapshot
Factoring Products of Braids via Garside Normal Form
inferred← citeshttps://doi.org/10.1007/978-3-030-17659-4_18openalex-snapshot
From Collisions to Chosen-Prefix Collisions Application to Full SHA-1
inferred← citeshttps://doi.org/10.1007/978-3-030-25283-0_10openalex-snapshot
Energy-Efficient ARM64 Cluster with Cryptanalytic Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-30530-7_3openalex-snapshot
Cold Boot Attacks on Bliss
inferred← citeshttps://doi.org/10.1007/978-3-030-32101-7_24openalex-snapshot
Short Paper: The Proof is in the Pudding
inferred← citeshttps://doi.org/10.1007/978-3-030-33649-3_2openalex-snapshot
Cryptographic Building Blocks
inferred← citeshttps://doi.org/10.1007/978-3-030-33649-3_4openalex-snapshot
Authentication Protocols and Key Establishment
inferred← citeshttps://doi.org/10.1007/978-3-030-35199-1_9openalex-snapshot
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
inferred← citeshttps://doi.org/10.1007/978-3-030-38471-5_2openalex-snapshot
Supersingular Isogeny Key Exchange for Beginners
inferred← citeshttps://doi.org/10.1007/978-3-030-41025-4_7openalex-snapshot
Implementing Cryptography Pairings over Ordinary Pairing-Friendly Curves of Type $$ y^2 = x^5 +a \, x$$
inferred← citeshttps://doi.org/10.1007/978-3-030-42921-8_32openalex-snapshot
Improving ECDLP Computation in Characteristic 2
inferred← citeshttps://doi.org/10.1007/978-3-030-44223-1_9openalex-snapshot
The Supersingular Isogeny Problem in Genus 2 and Beyond
inferred← citeshttps://doi.org/10.1007/978-3-030-45388-6_18openalex-snapshot
Improved Classical Cryptanalysis of SIKE in Practice
inferred← citeshttps://doi.org/10.1007/978-3-030-45721-1_15openalex-snapshot
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications
inferred← citeshttps://doi.org/10.1007/978-3-030-45727-3_4openalex-snapshot
Low Weight Discrete Logarithm and Subset Sum in $$2^{0.65n}$$ with Polynomial Memory
inferred← citeshttps://doi.org/10.1007/978-3-030-51938-4_11openalex-snapshot
A SAT-Based Approach for Index Calculus on Binary Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_15openalex-snapshot
B-SIDH: Supersingular Isogeny Diffie-Hellman Using Twisted Torsion
inferred← citeshttps://doi.org/10.1007/978-3-030-64834-3_18openalex-snapshot
Oblivious Pseudorandom Functions from Isogenies
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_246openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-3-030-71522-9_452openalex-snapshot
Generic Attacks Against DLP
inferred← citeshttps://doi.org/10.1007/978-3-030-75245-3_20openalex-snapshot
Master-Key KDM-Secure ABE via Predicate Encoding
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_19openalex-snapshot
SoK: How (not) to Design and Implement Post-quantum Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_26openalex-snapshot
Improvements to RSA Key Generation and CRT on Embedded Devices
inferred← citeshttps://doi.org/10.1007/978-3-030-75539-3_27openalex-snapshot
On the Cost of ASIC Hardware Crackers: A SHA-1 Case Study
inferred← citeshttps://doi.org/10.1007/978-3-030-78120-0_10openalex-snapshot
Lattice-Based Weak Curve Fault Attack on ECDSA
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_13openalex-snapshot
Low-Gate Quantum Golden Collision Finding
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_15openalex-snapshot
Not Enough LESS: An Improved Algorithm for Solving Code Equivalence Problems over $$\mathbb {F}_q$$
inferred← citeshttps://doi.org/10.1007/978-3-030-81652-0_5openalex-snapshot
On Index Calculus Algorithms for Subfield Curves
inferred← citeshttps://doi.org/10.1007/978-3-030-83411-1_2openalex-snapshot
Cryptographic Building Blocks
inferred← citeshttps://doi.org/10.1007/978-3-030-83411-1_4openalex-snapshot
Authentication Protocols and Key Establishment
inferred← citeshttps://doi.org/10.1007/978-3-030-84245-1_24openalex-snapshot
How to Meet Ternary LWE Keys
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_13openalex-snapshot
Cryptanalysis of Full LowMC and LowMC-M with Algebraic Techniques
inferred← citeshttps://doi.org/10.1007/978-3-030-84252-9_14openalex-snapshot
The Cost to Break SIKE: A Comparative Hardware-Based Analysis with AES and SHA-3
inferred← citeshttps://doi.org/10.1007/978-3-030-88323-2_8openalex-snapshot
A New Approach for Finding Low-Weight Polynomial Multiples
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_6openalex-snapshot
Cryptanalysis of an Oblivious PRF from Supersingular Isogenies
inferred← citeshttps://doi.org/10.1007/978-3-030-92062-3_9openalex-snapshot
Automatic Classical and Quantum Rebound Attacks on AES-Like Hashing by Exploiting Related-Key Differentials
inferred← citeshttps://doi.org/10.1007/978-3-030-95312-6_14openalex-snapshot
A New Adaptive Attack on SIDH
inferred← citeshttps://doi.org/10.1007/978-3-030-97121-2_6openalex-snapshot
On the Isogeny Problem with Torsion Point Information
inferred← citeshttps://doi.org/10.1007/978-3-031-15255-9_6openalex-snapshot
Birthday-Bound Slide Attacks on TinyJAMBU’s Keyed-Permutations for All Key Sizes
inferred← citeshttps://doi.org/10.1007/978-3-031-15802-5_4openalex-snapshot
Triangulating Rebound Attack on AES-like Hashing
inferred← citeshttps://doi.org/10.1007/978-3-031-17433-9_24openalex-snapshot
Finding Low-Weight Polynomial Multiples Using the Rho Method
inferred← citeshttps://doi.org/10.1007/978-3-031-22829-2_8openalex-snapshot
Combining Montgomery Multiplication with Tag Tracing for the Pollard Rho Algorithm in Prime Order Fields
inferred← citeshttps://doi.org/10.1007/978-3-031-22912-1_13openalex-snapshot
Parallel Isogeny Path Finding with Limited Memory
inferred← citeshttps://doi.org/10.1007/978-3-031-23020-2_37openalex-snapshot
Rebound Attacks on $$\textsf{SKINNY}$$ Hashing with Automatic Tools
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_10openalex-snapshot
M-SIDH and MD-SIDH: Countering SIDH Attacks by Masking Information
inferred← citeshttps://doi.org/10.1007/978-3-031-30589-4_8openalex-snapshot
Finding Many Collisions via Reusable Quantum Walks
inferred← citeshttps://doi.org/10.1007/978-3-031-30634-1_4openalex-snapshot
Efficient Detection of High Probability Statistical Properties of Cryptosystems via Surrogate Differentiation
inferred← citeshttps://doi.org/10.1007/978-3-031-33491-7_10openalex-snapshot
Efficient Isogeny Proofs Using Generic Techniques
inferred← citeshttps://doi.org/10.1007/978-3-031-33491-7_11openalex-snapshot
Low Memory Attacks on Small Key CSIDH
inferred← citeshttps://doi.org/10.1007/978-3-031-54770-6_17openalex-snapshot
Exploring SIDH-Based Signature Parameters
inferred← citeshttps://doi.org/10.1007/978-3-031-57725-3_6openalex-snapshot
An Algorithm for Efficient Detection of (N, N)-Splittings and Its Application to the Isogeny Problem in Dimension 2
inferred← citeshttps://doi.org/10.1007/978-3-031-58411-4_10openalex-snapshot
Revisiting Meet-in-the-Middle Cryptanalysis of SIDH/SIKE with Application to the $IKEp182 Challenge
inferred← citeshttps://doi.org/10.1007/978-3-031-68385-5_1openalex-snapshot
Generic MitM Attack Frameworks on Sponge Constructions
inferred← citeshttps://doi.org/10.1007/978-3-031-68391-6_2openalex-snapshot
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
inferred← citeshttps://doi.org/10.1007/978-3-031-83490-5_7openalex-snapshot
Safe curves for elliptic-curve cryptography
inferred← citeshttps://doi.org/10.1007/978-3-031-86599-2_3openalex-snapshot
An Improved Algorithm for Code Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-031-91823-0_11openalex-snapshot
Memory-Efficient BKW Algorithm for Solving the LWE Problem
inferred← citeshttps://doi.org/10.1007/978-3-031-91826-1_10openalex-snapshot
PRISM: Simple and Compact Identification and Signatures from Large Prime Degree Isogenies
inferred← citeshttps://doi.org/10.1007/978-3-031-94448-2_14openalex-snapshot
Dynamically Expanding Factor Base of Index Calculus Algorithm to Solve Massive Discrete Logarithm Problems Faster
inferred← citeshttps://doi.org/10.1007/978-3-032-01901-1_5openalex-snapshot
Guess-and-Determine Rebound: Applications to Key Collisions on AES
inferred← citeshttps://doi.org/10.1007/978-3-032-13301-4_11openalex-snapshot
Beyond Sequential Walks: Parallelizing the GA-Dlog Problem
inferred← citeshttps://doi.org/10.1007/978-3-032-20026-6_19openalex-snapshot
An Embarrassingly Parallel Cryptanalysis of EC(H)MQV
inferred← citeshttps://doi.org/10.1007/978-3-032-35398-6_17openalex-snapshot
CORAL Faster Isogeny Group Action for Post-Quantum NIKE
inferred← citeshttps://doi.org/10.1007/978-3-032-35409-9_15openalex-snapshot
Guess-and-Determine Rebound Revisited: Full Quantum Collision Attack on AES-256 in DM Hash Mode
inferred← citeshttps://doi.org/10.1007/978-3-319-10683-0_2openalex-snapshot
The Past, Evolving Present, and Future of the Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-319-13039-2_13openalex-snapshot
Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-13051-4_22openalex-snapshot
Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
inferred← citeshttps://doi.org/10.1007/978-3-319-16763-3_7openalex-snapshot
Kangaroos in Side-Channel Attacks
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_23openalex-snapshot
Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory
inferred← citeshttps://doi.org/10.1007/978-3-319-31301-6_25openalex-snapshot
Bit Security of the CDH Problems over Finite Fields
inferred← citeshttps://doi.org/10.1007/978-3-319-31515-7_4openalex-snapshot
Elliptic Curve Cryptosystems
inferred← citeshttps://doi.org/10.1007/978-3-319-63688-7_19openalex-snapshot
The First Collision for Full SHA-1
inferred← citeshttps://doi.org/10.1007/978-3-319-63715-0_14openalex-snapshot
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
inferred← citeshttps://doi.org/10.1007/978-3-319-69453-5_14openalex-snapshot
New Second Preimage Attacks on Dithered Hash Functions with Low Memory Complexity
inferred← citeshttps://doi.org/10.1007/978-3-319-70697-9_9openalex-snapshot
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
inferred← citeshttps://doi.org/10.1007/978-3-319-72565-9_12openalex-snapshot
NTRU Prime: Reducing Attack Surface at Low Cost
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-319-76578-5_13openalex-snapshot
A Practical Cryptanalysis of WalnutDSA$$^{\text {TM}}$$
inferred← citeshttps://doi.org/10.1007/978-3-319-78556-1_13openalex-snapshot
Solving 114-Bit ECDLP for a Barreto-Naehrig Curve
inferred← citeshttps://doi.org/10.1007/978-3-322-84957-1_9openalex-snapshot
Wie sicher ist die Public-Key-Kryptographie?
inferred← citeshttps://doi.org/10.1007/978-3-540-24591-9_35openalex-snapshot
Fast Scalar Multiplication Method Using Change-of-Basis Matrix to Prevent Power Analysis Attacks on Koblitz Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-24632-9_13openalex-snapshot
Short Exponent Diffie-Hellman Problems
inferred← citeshttps://doi.org/10.1007/978-3-540-24654-1_13openalex-snapshot
Security Analysis of SHA-256 and Sisters
inferred← citeshttps://doi.org/10.1007/978-3-540-24660-2_2openalex-snapshot
Related-Key Attacks on Triple-DES and DESX Variants
inferred← citeshttps://doi.org/10.1007/978-3-540-24676-3_24openalex-snapshot
Hash Function Balance and Its Impact on Birthday Attacks
inferred← citeshttps://doi.org/10.1007/978-3-540-24847-7_15openalex-snapshot
A Low-Memory Parallel Version of Matsuo, Chao, and Tsujii’s Algorithm
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-30539-2_16openalex-snapshot
The MD2 Hash Function Is Not One-Way
inferred← citeshttps://doi.org/10.1007/978-3-540-45146-4_25openalex-snapshot
On Memory-Bound Functions for Fighting Spam
inferred← citeshttps://doi.org/10.1007/978-3-540-45238-6_28openalex-snapshot
Hyperelliptic Curve Cryptosystems: Closing the Performance Gap to Elliptic Curves
inferred← citeshttps://doi.org/10.1007/978-3-540-46588-1_30openalex-snapshot
Selecting Cryptographic Key Sizes
inferred← citeshttps://doi.org/10.1007/978-3-540-47942-0_20openalex-snapshot
Send Message into a Definite Future
inferred← citeshttps://doi.org/10.1007/978-3-540-48000-6_10openalex-snapshot
Speeding up the Discrete Log Computation on Curves with Automorphisms
inferred← citeshttps://doi.org/10.1007/978-3-540-72540-4_1openalex-snapshot
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities
inferred← citeshttps://doi.org/10.1007/978-3-540-74735-2_26openalex-snapshot
Collision Search for Elliptic Curve Discrete Logarithm over GF(2 m ) with FPGA
inferred← citeshttps://doi.org/10.1007/978-3-540-77026-8_2openalex-snapshot
A Meet-in-the-Middle Collision Attack Against the New FORK-256
inferred← citeshttps://doi.org/10.1007/978-3-540-77026-8_5openalex-snapshot
A Result on the Distribution of Quadratic Residues with Applications to Elliptic Curve Cryptography
inferred← citeshttps://doi.org/10.1007/978-3-540-79456-1_27openalex-snapshot
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm
inferred← citeshttps://doi.org/10.1007/978-3-540-89255-7_29openalex-snapshot
Speeding Up the Pollard Rho Method on Prime Fields
inferred← citeshttps://doi.org/10.1007/978-3-642-00468-1_4openalex-snapshot
Subset-Restricted Random Walks for Pollard rho Method on ${\mathbf{F}_{p^m}}$
inferred← citeshttps://doi.org/10.1007/978-3-642-03356-8_4openalex-snapshot
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
inferred← citeshttps://doi.org/10.1007/978-3-642-04474-8_8openalex-snapshot
On Free-Start Collisions and Collisions for TIB3
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_21openalex-snapshot
Improved Generic Algorithms for 3-Collisions
inferred← citeshttps://doi.org/10.1007/978-3-642-10366-7_9openalex-snapshot
MD5 Is Weaker Than Weak: Attacks on Concatenated Combiners
inferred← citeshttps://doi.org/10.1007/978-3-642-10868-6_22openalex-snapshot
An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-11925-5_1openalex-snapshot
The First 30 Years of Cryptographic Hash Functions and the NIST SHA-3 Competition
inferred← citeshttps://doi.org/10.1007/978-3-642-12678-9_25openalex-snapshot
Cryptanalysis of the 10-Round Hash and Full Compression Function of SHAvite-3-512
inferred← citeshttps://doi.org/10.1007/978-3-642-13013-7_22openalex-snapshot
Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
inferred← citeshttps://doi.org/10.1007/978-3-642-14518-6_9openalex-snapshot
On the Use of the Negation Map in the Pollard Rho Method
inferred← citeshttps://doi.org/10.1007/978-3-642-14623-7_35openalex-snapshot
Time Space Tradeoffs for Attacks against One-Way Functions and PRGs
inferred← citeshttps://doi.org/10.1007/978-3-642-14706-7_4openalex-snapshot
Cryptography for Network Security: Failures, Successes and Challenges
inferred← citeshttps://doi.org/10.1007/978-3-642-17401-8_23openalex-snapshot
ECC2K-130 on NVIDIA GPUs
inferred← citeshttps://doi.org/10.1007/978-3-642-17455-1_27openalex-snapshot
Pairing Computation on Elliptic Curves with Efficiently Computable Endomorphism and Small Embedding Degree
inferred← citeshttps://doi.org/10.1007/978-3-642-17610-4_5openalex-snapshot
On Distinguished Points Method to Implement a Parallel Collision Search Attack on ECDLP
inferred← citeshttps://doi.org/10.1007/978-3-642-19379-8_8openalex-snapshot
On the Correct Use of the Negation Map in the Pollard rho Method
inferred← citeshttps://doi.org/10.1007/978-3-642-19574-7_13openalex-snapshot
Optimal Covering Codes for Finding Near-Collisions
inferred← citeshttps://doi.org/10.1007/978-3-642-27739-9_246-2openalex-snapshot
Elliptic Curve Discrete Logarithm Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-27954-6_5openalex-snapshot
Reducing the Key Size of Rainbow Using Non-commutative Rings
inferred← citeshttps://doi.org/10.1007/978-3-642-28365-9_27openalex-snapshot
Constructing Cluster of Simple FPGA Boards for Cryptologic Computations
inferred← citeshttps://doi.org/10.1007/978-3-642-28496-0_18openalex-snapshot
Another Look at Tightness
inferred← citeshttps://doi.org/10.1007/978-3-642-29011-4_1openalex-snapshot
A Tutorial on High Performance Computing Applied to Cryptanalysis
inferred← citeshttps://doi.org/10.1007/978-3-642-32928-9_17openalex-snapshot
On the Strength Comparison of the ECDLP and the IFP
inferred← citeshttps://doi.org/10.1007/978-3-642-34931-7_19openalex-snapshot
Computing Small Discrete Logarithms Faster
inferred← citeshttps://doi.org/10.1007/978-3-642-34931-7_3openalex-snapshot
Using the Cloud to Determine Key Strengths
inferred← citeshttps://doi.org/10.1007/978-3-642-34961-4_33openalex-snapshot
Bicliques for Permutations: Collision and Preimage Attacks in Stronger Settings
inferred← citeshttps://doi.org/10.1007/978-3-642-35755-8_19openalex-snapshot
A Related-Key Attack against Multiple Encryption Based on Fixed Points
inferred← citeshttps://doi.org/10.1007/978-3-642-35999-6_14openalex-snapshot
All Subkeys Recovery Attack on Block Ciphers: Extending Meet-in-the-Middle Approach
inferred← citeshttps://doi.org/10.1007/978-3-642-36883-7_5openalex-snapshot
Two Improvements of Random Key Predistribution for Wireless Sensor Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-38348-9_15openalex-snapshot
New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-38616-9_17openalex-snapshot
Multivariate Signature Scheme Using Quadratic Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_1openalex-snapshot
New Generic Attacks against Hash-Based MACs
inferred← citeshttps://doi.org/10.1007/978-3-642-42045-0_17openalex-snapshot
Non-uniform Cracks in the Concrete: The Power of Free Precomputation
inferred← citeshttps://doi.org/10.1007/978-3-642-54631-0_12openalex-snapshot
Elliptic and Hyperelliptic Curves: A Practical Security Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-57189-3_4openalex-snapshot
Discrete Logarithms: Recent Progress
inferred← citeshttps://doi.org/10.1007/978-3-662-43933-3_11openalex-snapshot
Time-Memory Trade-Offs for Near-Collisions
inferred← citeshttps://doi.org/10.1007/978-3-662-44371-2_9openalex-snapshot
Improved Generic Attacks against Hash-Based MACs and HAIFA
inferred← citeshttps://doi.org/10.1007/978-3-662-44381-1_16openalex-snapshot
Scalable Zero Knowledge via Cycles of Elliptic Curves
showing the first 200 of 506 · page through all 506
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.