default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBenne de Weger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j14]Emmanouil Doulgerakis
, Thijs Laarhoven, Benne de Weger:
The irreducible vectors of a lattice. Des. Codes Cryptogr. 91(2): 609-643 (2023)- [i14]Jolijn Cottaar, Kathrin Hövelmanns, Andreas Hülsing, Tanja Lange, Mohammad Mahzoun, Alex Pellegrini, Alberto Ravagnani, Sven Schäge, Monika Trimoska, Benne de Weger:
Report on evaluation of KpqC candidates. IACR Cryptol. ePrint Arch. 2023: 1853 (2023) - 2021
- [i13]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
The irreducible vectors of a lattice: Some theory and applications. IACR Cryptol. ePrint Arch. 2021: 1203 (2021) - 2020
- [c14]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Sieve, Enumerate, Slice, and Lift: - Hybrid Lattice Algorithms for SVP via CVPP. AFRICACRYPT 2020: 301-320 - [i12]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Sieve, Enumerate, Slice, and Lift: Hybrid Lattice Algorithms for SVP via CVPP. IACR Cryptol. ePrint Arch. 2020: 487 (2020)
2010 – 2019
- 2019
- [c13]Emmanouil Doulgerakis, Thijs Laarhoven, Benne de Weger:
Finding Closest Lattice Vectors Using Approximate Voronoi Cells. PQCrypto 2019: 3-22 - 2017
- [j13]Aart Blokhuis, Andries E. Brouwer, Benne de Weger:
Binomial Collisions and Near Collisions. Integers 17: A64 (2017) - 2015
- [c12]Thijs Laarhoven, Benne de Weger:
Faster Sieving for Shortest Lattice Vectors Using Spherical Locality-Sensitive Hashing. LATINCRYPT 2015: 101-118 - [i11]Thijs Laarhoven, Benne de Weger:
Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing. IACR Cryptol. ePrint Arch. 2015: 211 (2015) - 2014
- [j12]Thijs Laarhoven, Benne de Weger:
Optimal symmetric Tardos traitor tracing schemes. Des. Codes Cryptogr. 71(1): 83-103 (2014) - [j11]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Data minimisation in communication protocols: a formal analysis framework and application to identity management. Int. J. Inf. Sec. 13(6): 529-569 (2014) - [j10]Benne de Weger:
A Generalized Ramanujan-Nagell Equation Related to Certain Strongly Regular Graphs. Integers 14: A35 (2014) - 2013
- [j9]Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger:
Dynamic Tardos Traitor Tracing Schemes. IEEE Trans. Inf. Theory 59(7): 4230-4242 (2013) - [c11]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Symbolic Privacy Analysis through Linkability and Detectability. IFIPTM 2013: 1-16 - [c10]Thijs Laarhoven, Benne de Weger:
Discrete distributions in the tardos scheme, revisited. IH&MMSec 2013: 13-18 - [i10]Thijs Laarhoven, Benne de Weger:
Discrete Distributions in the Tardos Scheme, Revisited. CoRR abs/1302.1741 (2013) - 2012
- [j8]Marc Stevens, Arjen K. Lenstra, Benne de Weger:
Chosen-prefix collisions for MD5 and applications. Int. J. Appl. Cryptogr. 2(4): 322-359 (2012) - [c9]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Formal Modelling of (De)Pseudonymisation: A Case Study in Health Care Privacy. STM 2012: 145-160 - [i9]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Data Minimisation in Communication Protocols: A Formal Analysis Framework and Application to Identity Management. CoRR abs/1206.7111 (2012) - [i8]Thijs Laarhoven, Benne de Weger:
The Collatz conjecture and De Bruijn graphs. CoRR abs/1209.3495 (2012) - [i7]Thijs Laarhoven, Joop van de Pol, Benne de Weger:
Solving Hard Lattice Problems and the Security of Lattice-Based Cryptosystems. IACR Cryptol. ePrint Arch. 2012: 533 (2012) - 2011
- [c8]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Formal Privacy Analysis of Communication Protocols for Identity Management. ICISS 2011: 235-249 - [i6]Thijs Laarhoven, Benne de Weger:
Optimal symmetric Tardos traitor tracing schemes. CoRR abs/1107.3441 (2011) - [i5]Thijs Laarhoven, Jeroen Doumen, Peter Roelse, Boris Skoric, Benne de Weger:
Dynamic Tardos Traitor Tracing Schemes. CoRR abs/1111.3597 (2011) - 2010
- [c7]Meilof Veeningen, Benne de Weger, Nicola Zannone:
Modeling Identity-Related Properties and Their Privacy Strength. Formal Aspects in Security and Trust 2010: 126-140
2000 – 2009
- 2009
- [c6]Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. CRYPTO 2009: 55-69 - [i4]Marc Stevens, Alexander Sotirov, Jacob Appelbaum, Arjen K. Lenstra, David Molnar, Dag Arne Osvik, Benne de Weger:
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate. IACR Cryptol. ePrint Arch. 2009: 111 (2009) - 2007
- [c5]Marc Stevens, Arjen K. Lenstra, Benne de Weger:
Chosen-Prefix Collisions for MD5 and Colliding X.509 Certificates for Different Identities. EUROCRYPT 2007: 1-22 - 2006
- [j7]Benne de Weger, et al.:
How Many Powers of 2 Must Survive? 11114. Am. Math. Mon. 113(8): 760-761 (2006) - [c4]Ellen Jochemsz, Benne de Weger:
A Partial Key Exposure Attack on RSA Using a 2-Dimensional Lattice. ISC 2006: 203-216 - [i3]Marc Stevens, Arjen K. Lenstra, Benne de Weger:
Target Collisions for MD5 and Colliding X.509 Certificates for Different Identities. IACR Cryptol. ePrint Arch. 2006: 360 (2006) - 2005
- [c3]Arjen K. Lenstra, Benne de Weger:
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys. ACISP 2005: 267-279 - [c2]Matthias Ernst, Ellen Jochemsz, Alexander May, Benne de Weger:
Partial Key Exposure Attacks on RSA up to Full Size Exponents. EUROCRYPT 2005: 371-386 - [c1]Arjen K. Lenstra, Benjamin M. M. de Weger:
Twin RSA. Mycrypt 2005: 222-228 - [i2]Arjen K. Lenstra, Xiaoyun Wang, Benne de Weger:
Colliding X.509 Certificates. IACR Cryptol. ePrint Arch. 2005: 67 (2005) - [i1]Arjen K. Lenstra, Benjamin M. M. de Weger:
Twin RSA. IACR Cryptol. ePrint Arch. 2005: 195 (2005) - 2004
- [j6]Benne de Weger:
Problem 11114. Am. Math. Mon. 111(9): 823 (2004) - 2002
- [j5]Benne de Weger:
Cryptanalysis of RSA with Small Prime Difference. Appl. Algebra Eng. Commun. Comput. 13(1): 17-28 (2002)
1990 – 1999
- 1999
- [j4]Roel J. Stroeker, Benjamin M. M. de Weger:
Elliptic binomial diophantine equations. Math. Comput. 68(227): 1257-1281 (1999) - 1998
- [j3]Benjamin M. M. de Weger:
Solving Elliptic Diophantine Equations Avoiding Thue Equations and Elliptic Logarithms. Exp. Math. 7(3): 243-256 (1998) - [j2]Michael A. Bennett, Benjamin M. M. de Weger:
On the Diophantine equation |axn - byn | = 1. Math. Comput. 67(221): 413-438 (1998) - 1994
- [j1]Roel J. Stroeker, Benjamin M. M. de Weger:
On Elliptic Diophantine Equations That Defy Thue's Method: The Case of the Ochoa Curve. Exp. Math. 3(3): 209-220 (1994)
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:55 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
