On Elliptic Diophantine Equations That Defy Thue's Method: The Case of the Ochoa Curve. - Roel J. Stroeker; Benjamin M. M. de Weger (Exp. Math., 1994)

Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms. - Benjamin M. M. de Weger (Exp. Math., 1998)

On the Diophantine equation |axn - byn | = 1. - Michael A. Bennett; Benjamin M. M. de Weger (Math. Comput., 1998)

Elliptic binomial diophantine equations. - Roel J. Stroeker; Benjamin M. M. de Weger (Math. Comput., 1999)

Cryptanalysis of RSA with Small Prime Difference. - Benne de Weger (Appl. Algebra Eng. Commun. Comput., 2002)

Problem 11114. - Benne de Weger (Am. Math. Mon., 2004)

On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. - Arjen K. Lenstra; Benne de Weger (ACISP, 2005)

Partial Key Exposure Attacks on RSA up to Full Size Exponents. - Matthias Ernst; Ellen Jochemsz; Alexander May 001; Benne de Weger (EUROCRYPT, 2005)

Twin RSA. - Arjen K. Lenstra; Benjamin M. M. de Weger (IACR Cryptol. ePrint Arch., 2005)

Colliding X.509 Certificates. - Arjen K. Lenstra; Xiaoyun Wang 001; Benne de Weger (IACR Cryptol. ePrint Arch., 2005)

A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice. - Ellen Jochemsz; Benne de Weger (ISC, 2006)

Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities. - Marc Stevens 001; Arjen K. Lenstra; Benne de Weger (IACR Cryptol. ePrint Arch., 2006)

How Many Powers of 2 Must Survive? 11114. - Benne de Weger; et al. (Am. Math. Mon., 2006)

Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. - Marc Stevens 001; Arjen K. Lenstra; Benne de Weger (EUROCRYPT, 2007)

Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. - Marc Stevens 001; Alexander Sotirov; Jacob Appelbaum; Arjen K. Lenstra; David Molnar; Dag Arne Osvik; Benne de Weger (IACR Cryptol. ePrint Arch., 2009)

Modeling Identity-Related Properties and Their Privacy Strength. - Meilof Veeningen; Benne de Weger; Nicola Zannone (Formal Aspects in Security and Trust, 2010)

Formal Privacy Analysis of Communication Protocols for Identity Management. - Meilof Veeningen; Benne de Weger; Nicola Zannone (ICISS, 2011)

Formal Modelling of (De)Pseudonymisation: A Case Study in Health Care Privacy. - Meilof Veeningen; Benne de Weger; Nicola Zannone (STM, 2012)

The Collatz conjecture and De Bruijn graphs - Thijs Laarhoven; Benne de Weger (CoRR, 2012)

Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. - Thijs Laarhoven; Joop van de Pol; Benne de Weger (IACR Cryptol. ePrint Arch., 2012)

Chosen-prefix collisions for MD5 and applications. - Marc Stevens 001; Arjen K. Lenstra; Benne de Weger (Int. J. Appl. Cryptogr., 2012)

Symbolic Privacy Analysis through Linkability and Detectability. - Meilof Veeningen; Benne de Weger; Nicola Zannone (IFIPTM, 2013)

Discrete distributions in the tardos scheme, revisited. - Thijs Laarhoven; Benne de Weger (IH&MMSec, 2013)

Dynamic Tardos Traitor Tracing Schemes. - Thijs Laarhoven; Jeroen Doumen; Peter Roelse; Boris Skoric; Benne de Weger (IEEE Trans. Inf. Theory, 2013)

Optimal symmetric Tardos traitor tracing schemes. - Thijs Laarhoven; Benne de Weger (Des. Codes Cryptogr., 2014)

Data minimisation in communication protocols: a formal analysis framework and application to identity management. - Meilof Veeningen; Benne de Weger; Nicola Zannone (Int. J. Inf. Sec., 2014)

A Generalized Ramanujan-Nagell Equation Related to Certain Strongly Regular Graphs. - Benne de Weger (Integers, 2014)

Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. - Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2015)

Binomial Collisions and Near Collisions. - Aart Blokhuis; Andries E. Brouwer; Benne de Weger (Integers, 2017)

Finding Closest Lattice Vectors Using Approximate Voronoi Cells. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (PQCrypto, 2019)

Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2020)

The irreducible vectors of a lattice: Some theory and applications. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (IACR Cryptol. ePrint Arch., 2021)

Report on evaluation of KpqC candidates. - Jolijn Cottaar; Kathrin Hövelmanns; Andreas Hülsing; Tanja Lange 001; Mohammad Mahzoun; Alex Pellegrini; Alberto Ravagnani; Sven Schäge; Monika Trimoska; Benne de Weger (IACR Cryptol. ePrint Arch., 2023)

The irreducible vectors of a lattice. - Emmanouil Doulgerakis; Thijs Laarhoven; Benne de Weger (Des. Codes Cryptogr., 2023)