Finding Short Integer Solutions When the Modulus Is Small

• Sharper and Closed-Form Attacks on SIS When the Modulus Is Small

  2026 IACR Communications in Cryptology article Computer Science Cryptography and Data Security Open access

  0

  citations
• Message recovery attack in NTRU via knapsack

  2026 Applicable Algebra in Engineering Communication and Computing article Computer Science Cryptography and Data Security

  0

  citations
• A Closer Look at Falcon

  2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  3

  citations
• Cool + Cruel = Dual, and New Benchmarks for Sparse LWE

  2026 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  1

  citations
• Rethinking IoT Security in the Era of Quantum Computing: Literature Reviews

  2026 Studies in computational intelligence book-chapter Computer Science Quantum Information and Cryptography

  1

  citations
• NTRU+Sign: compact NTRU-based signatures using bimodal distributions

  2025 Designs Codes and Cryptography article Computer Science Cryptography and Data Security

  2

  citations
• GPV Preimage Sampling with Weak Smoothness and Its Applications to Lattice Signatures

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  3

  citations
• Lattice-Based Commitment Scheme for Proving Linear Relations between Hidden Values

  2025 Automatic Control and Computer Sciences article Computer Science Cryptography and Data Security

  0

  citations
• A Review of Lattice Cryptography Attack Cost Model

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  1

  citations
• Lattice-Based Identity Authentication Protocol with Enhanced Privacy and Scalability for Vehicular Ad Hoc Networks

  2025 Future Internet article Engineering Vehicular Ad Hoc Networks (VANETs) Open access

  3

  citations
• Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  2

  citations
• Cryptanalysis of an Efficient Signature Based on Isotropic Quadratic Forms

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  3

  citations
• Discrete Gaussian Sampling for BKZ-Reduced Basis

  2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  0

  citations
• Design of advanced post-quantum signature schemes

  2024 dissertation Computer Science Cryptography and Data Security

  0

  citations
• Polytopes in the Fiat-Shamir with Aborts Paradigm

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  5

  citations
• Phoenix: Hash-and-Sign with Aborts from Lattice Gadgets

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  9

  citations
• Lattice-Based Threshold, Accountable, and Private Signature

  2024 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  1

  citations
• On Gaussian Sampling, Smoothing Parameter and Application to Signatures

  2023 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  11

  citations

18 results

• Factoring polynomials with rational coefficients

  1982 Mathematische Annalen article Computer Science Polynomial and algebraic computation Open access

  4,060

  citations
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems

  1994 Mathematical Programming article Computer Science Complexity and Algorithms in Graphs

  1,444

  citations
• Generating hard instances of lattice problems (extended abstract)

  1996 ACM Symposium on Theory of Computing (STOC) conference-paper Computer Science Cryptography and Data Security Open access

  1,412

  citations
• On Lovász’ lattice reduction and the nearest lattice point problem

  1986 COMBINATORICA article Computer Science Complexity and Algorithms in Graphs

  956

  citations
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures

  2007 SIAM Journal on Computing article Computer Science Cryptography and Data Security

  912

  citations
• New directions in nearest neighbor searching with applications to lattice sieving

  2015 ACM-SIAM Symposium on Discrete Algorithms (SODA) conference-paper Computer Science Advanced Image and Video Retrieval Techniques Open access

  289

  citations
• Sieve algorithms for the shortest vector problem are practical

  2008 Journal of Mathematical Cryptology article Computer Science Cryptography and Data Security Open access

  235

  citations
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU

  2007 Springer eBooks conference-paper Computer Science Cryptography and Data Security Open access

  185

  citations
• The General Sieve Kernel and New Records in Lattice Reduction

  2019 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  160

  citations
• Lattice Reduction by Random Sampling and Birthday Methods

  2003 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  134

  citations
• Shortest Vector from Lattice Sieving: A Few Dimensions for Free

  2018 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  114

  citations
• Improved Progressive BKZ Algorithms and Their Precise Cost Estimation by Sharp Simulator

  2016 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  111

  citations
• Mitaka: A Simpler, Parallelizable, Maskable Variant of Falcon

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  67

  citations
• NTRU Fatigue: How stretched is overstretched?

  2021 Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands conference-paper Computer Science Cryptography and Data Security Open access

  67

  citations
• Hawk: Module LIP Makes Lattice Signatures Fast, Compact and Simple

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  61

  citations
• Random Sampling Revisited: Lattice Enumeration with Discrete Pruning

  2017 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security

  48

  citations
• Shorter Hash-and-Sign Lattice-Based Signatures

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  38

  citations
• Lattice Attacks on NTRU and LWE: A History of Refinements

  2021 Cambridge University Press eBooks book-chapter Computer Science Cryptography and Data Security

  26

  citations
• On Rejection Sampling in Lyubashevsky’s Signature Scheme

  2022 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access

  20

  citations
• Problems and Solutions

  1997 SIAM Review article

  3

  citations

20 results