


default search action
45th CRYPTO 2025, Santa Barbara, CA, USA - Part I
- Yael Tauman Kalai, Seny F. Kamara:

Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part I. Lecture Notes in Computer Science 16000, Springer 2025, ISBN 978-3-032-01854-0
Mathematical Foundations and Isogeny-Based Cryptography
- Yansong Feng, Hengyi Luo, Qiyuan Chen, Abderrahmane Nitaj, Yanbin Pan:

Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory. 3-32 - Jun Xu, Jun Song, Lei Hu:

New Results on the φ-Hiding Assumption and Factoring Related RSA Moduli. 33-66 - Pierrick Dartois

, Jonathan Komada Eriksen, Tako Boris Fouotsa, Arthur Herlédan Le Merdy, Riccardo Invernizzi, Damien Robert, Ryan Rueger, Frederik Vercauteren, Benjamin Wesolowski:
PEGASIS: Practical Effective Class Group Action using 4-Dimensional Isogenies. 67-99 - Marc Houben

:
Deterministic Algorithms for Class Group Actions. 100-130 - Thomas den Hollander

, Sören Kleine, Marzio Mula
, Daniel Slamanig
, Sebastian A. Spindler
:
More Efficient Isogeny Proofs of Knowledge via Canonical Modular Polynomials. 131-166 - Wouter Castryck

, Thomas Decru
, Péter Kutas, Abel Laval, Christophe Petit
, Yan Bo Ti
:
KLPT2: Algebraic Pathfinding in Dimension Two and Applications. 167-200
Code-Based Cryptography
- Andrej Bogdanov, Alon Rosen, Kel Zin Tan:

Sample Efficient Search to Decision for kLIN. 203-220 - Sarah Arpin

, Jun Bo Lau, Antoine Mesnard
, Ray A. Perlner, Angela Robinson, Jean-Pierre Tillich, Valentin Vasseur:
Error Floor Prediction with Markov Models for QC-MDPC Codes. 221-252 - Alain Couvreur, Christophe Levrat:

Highway to Hull: An Algorithm for Solving the General Matrix Code Equivalence Problem. 253-283 - Vladimir Kolesnikov, Stanislav Peceny, Srinivasan Raghuraman, Peter Rindal:

Stationary Syndrome Decoding for Improved PCGs. 284-317
Lattice-Based Cryptography
- Maiara F. Bollauf

, Maja Lie, Cong Ling
:
On Gaussian Sampling for q-ary Lattices and Linear Codes with Lee Weight. 321-352 - Léo Ducas, Lynn Engelberts

, Johanna Loyer:
Wagner's Algorithm Provably Runs in Subexponential Time for rmSIS∞. 353-384 - Jinzheng Cao, Haodong Jiang, Qingfeng Cheng:

Refined Attack on LWE with Hints: Constructing Lattice via Gaussian Elimination. 385-416 - Paco Azevedo Oliveira, Andersson Calle Viera, Benoît Cogliati, Louis Goubin:

Uncompressing Dilithium's Public Key. 417-443 - Kévin Carrier, Charles Meyer-Hilfiger, Yixin Shen, Jean-Pierre Tillich:

Assessing the Impact of a Variant of MATZOV's Dual Attack on Kyber. 444-476 - Corentin Jeudy

, Olivier Sanders
:
Improved Lattice Blind Signatures from Recycled Entropy. 477-513 - Joel Gärtner

:
Compact Lattice Signatures via Iterative Rejection Sampling. 514-547 - Chenzhi Zhu

, Stefano Tessaro
:
The Algebraic One-More MISIS Problem and Applications to Threshold Signatures. 548-581
Complexity-Theoretic Foundations
- Marshall Ball

, Dana Dachman-Soled
:
Uniform Black-Box Separations via Non-malleable Extractors. 585-616 - Yanyi Liu, Rafael Pass:

Hardness Along the Boundary: Towards One-Way Functions from the Worst-Case Hardness of Time-Bounded Kolmogorov Complexity. 617-650 - William Gay, William He, Nicholas Kocurek, Ryan O'Donnell:

Pseudorandomness Properties of Random Reversible Circuits. 651-678 - Divesh Aggarwal, Pranjal Dutta, Saswata Mukherjee, Satyajeet Nagargoje, Maciej Obremski:

Efficient Randomized Strong 2-Source Non-malleable Extractor for Any Linear Min-Entropy. 679-713

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














