Benne de Weger

Des. Codes Cryptogr., February, 2023

Report on evaluation of KpqC candidates.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

2021

The irreducible vectors of a lattice: Some theory and applications.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2021

2020

Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

2019

Finding Closest Lattice Vectors Using Approximate Voronoi Cells.

[BibT_eX]

[DOI]

Proceedings of the Post-Quantum Cryptography - 10th International Conference, 2019

2017

Binomial Collisions and Near Collisions.

[BibT_eX]

[DOI]

Aart Blokhuis

Andries E. Brouwer

Integers, 2017

2015

Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2015

2014

A Generalized Ramanujan-Nagell Equation Related to Certain Strongly Regular Graphs.

[BibT_eX]

[DOI]

Integers, 2014

Data minimisation in communication protocols: a formal analysis framework and application to identity management.

[BibT_eX]

[DOI]

Int. J. Inf. Sec., 2014

Optimal symmetric Tardos traitor tracing schemes.

[BibT_eX]

[DOI]

Des. Codes Cryptogr., 2014

2013

Dynamic Tardos Traitor Tracing Schemes.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2013

Discrete distributions in the tardos scheme, revisited.

[BibT_eX]

[DOI]

Proceedings of the ACM Information Hiding and Multimedia Security Workshop, 2013

Symbolic Privacy Analysis through Linkability and Detectability.

[BibT_eX]

[DOI]

Proceedings of the Trust Management VII - 7th IFIP WG 11.11 International Conference, 2013

2012

Chosen-prefix collisions for MD5 and applications.

[BibT_eX]

[DOI]

Marc Stevens

Int. J. Appl. Cryptogr., 2012

Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems.

[BibT_eX]

[DOI]

Joop van de Pol

IACR Cryptol. ePrint Arch., 2012

The Collatz conjecture and De Bruijn graphs

[BibT_eX]

[DOI]

CoRR, 2012

Formal Modelling of (De)Pseudonymisation: A Case Study in Health Care Privacy.

[BibT_eX]

[DOI]

Proceedings of the Security and Trust Management - 8th International Workshop, 2012

2011

Formal Privacy Analysis of Communication Protocols for Identity Management.

[BibT_eX]

[DOI]

Proceedings of the Information Systems Security - 7th International Conference, 2011

2010

Modeling Identity-Related Properties and Their Privacy Strength.

[BibT_eX]

[DOI]

Proceedings of the Formal Aspects of Security and Trust - 7th International Workshop, 2010

2009

Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

2007

Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities.

[BibT_eX]

[DOI]

Marc Stevens

Proceedings of the Advances in Cryptology, 2007

2006

How Many Powers of 2 Must Survive? 11114.

[BibT_eX]

[DOI]

et al.

Am. Math. Mon., 2006

Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities.

[BibT_eX]

[DOI]

Marc Stevens

IACR Cryptol. ePrint Arch., 2006

A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice.

[BibT_eX]

[DOI]

Ellen Jochemsz

Proceedings of the Information Security, 9th International Conference, 2006

2005

Colliding X.509 Certificates.

[BibT_eX]

[DOI]

Xiaoyun Wang

IACR Cryptol. ePrint Arch., 2005

Twin RSA.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2005

Partial Key Exposure Attacks on RSA up to Full Size Exponents.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2005

On the Possibility of Constructing Meaningful Hash Collisions for Public Keys.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 10th Australasian Conference, 2005

2004

Problem 11114.

[BibT_eX]

[DOI]

Am. Math. Mon., 2004

2002

Cryptanalysis of RSA with Small Prime Difference.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2002

1999

Elliptic binomial diophantine equations.

[BibT_eX]

[DOI]

Roel J. Stroeker

Math. Comput., 1999

1998

On the Diophantine equation |ax<sup>n</sup> - by<sup>n</sup> | = 1.

[BibT_eX]

[DOI]

Michael A. Bennett

Math. Comput., 1998

Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms.

[BibT_eX]

[DOI]

Exp. Math., 1998

1994

On Elliptic Diophantine Equations That Defy Thue's Method: The Case of the Ochoa Curve.

[BibT_eX]

[DOI]

Roel J. Stroeker