Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDMarc Stevens
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[c14]Esteban Landerreche, Marc Stevens, Christian Schaffner:
Non-interactive Cryptographic Timestamping Based on Verifiable Delay Functions. Financial Cryptography 2020: 541-558
2010 – 2019
- 2019
- [c13]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova
, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. EUROCRYPT (2) 2019: 717-746 - [i16]Martin R. Albrecht, Léo Ducas, Gottfried Herold, Elena Kirshanova, Eamonn W. Postlethwaite, Marc Stevens:
The General Sieve Kernel and New Records in Lattice Reduction. IACR Cryptol. ePrint Arch. 2019: 89 (2019) - [i15]Esteban Landerreche, Marc Stevens, Christian Schaffner:
Non-interactive Cryptographic Timestamping based on Verifiable Delay Functions. IACR Cryptol. ePrint Arch. 2019: 197 (2019) - 2017
- [j2]Anne Canteaut, Eran Lambooij, Samuel Neves, Shahram Rasoolzadeh, Yu Sasaki, Marc Stevens:
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Trans. Symmetric Cryptol. 2017(2): 203-227 (2017) - [c12]Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, Yarik Markov:
The First Collision for Full SHA-1. CRYPTO (1) 2017: 570-596 - [c11]Rusydi H. Makarim, Marc Stevens:
M4GB: An Efficient Gröbner-Basis Algorithm. ISSAC 2017: 293-300 - [c10]Marc Stevens, Daniel Shumow:
Speeding up detection of SHA-1 collision attacks using unavoidable attack conditions. USENIX Security Symposium 2017: 881-897 - [i14]Marc Stevens, Daniel Shumow:
Speeding up detection of SHA-1 collision attacks using unavoidable attack conditions. IACR Cryptol. ePrint Arch. 2017: 173 (2017) - [i13]Marc Stevens, Elie Bursztein, Pierre Karpman, Ange Albertini, Yarik Markov:
The first collision for full SHA-1. IACR Cryptol. ePrint Arch. 2017: 190 (2017) - [i12]Anne Canteaut, Eran Lambooij, Samuel Neves, Shahram Rasoolzadeh, Yu Sasaki, Marc Stevens:
Refined Probability of Differential Characteristics Including Dependency Between Multiple Rounds. IACR Cryptol. ePrint Arch. 2017: 478 (2017) - 2016
- [c9]Marc Stevens, Pierre Karpman, Thomas Peyrin:
Freestart Collision for Full SHA-1. EUROCRYPT (1) 2016: 459-483 - [c8]Muhammad Barham, Orr Dunkelman, Stefan Lucks, Marc Stevens:
New Second Preimage Attacks on Dithered Hash Functions with Low Memory Complexity. SAC 2016: 247-263 - [i11]Marc Stevens:
Deprecating an Internet Security Standard with Cryptanalysis. ERCIM News 2016(106) (2016) - [i10]Max Fillinger, Marc Stevens:
Reverse-Engineering of the Cryptanalytic Attack Used in the Flame Super-Malware. IACR Cryptol. ePrint Arch. 2016: 298 (2016) - 2015
- [c7]Max Fillinger, Marc Stevens:
Reverse-Engineering of the Cryptanalytic Attack Used in the Flame Super-Malware. ASIACRYPT (2) 2015: 586-611 - [c6]Pierre Karpman, Thomas Peyrin, Marc Stevens:
Practical Free-Start Collision Attacks on 76-step SHA-1. CRYPTO (1) 2015: 623-642 - [i9]Pierre Karpman, Thomas Peyrin, Marc Stevens:
Practical Free-Start Collision Attacks on 76-step SHA-1. IACR Cryptol. ePrint Arch. 2015: 530 (2015) - [i8]Marc Stevens, Pierre Karpman, Thomas Peyrin:
Freestart collision on full SHA-1. IACR Cryptol. ePrint Arch. 2015: 967 (2015) - 2013
- [c5]Marc Stevens:
Counter-Cryptanalysis. CRYPTO (1) 2013: 129-146 - [c4]Marc Stevens:
New Collision Attacks on SHA-1 Based on Optimal Joint Local-Collision Analysis. EUROCRYPT 2013: 245-261 - [i7]Marc Stevens:
Counter-cryptanalysis. IACR Cryptol. ePrint Arch. 2013: 358 (2013) - 2012
- [j1]Marc Stevens, Arjen K. Lenstra, Benne de Weger:
Chosen-prefix collisions for MD5 and applications. Int. J. Appl. Cryptogr. 2(4): 322-359 (2012) - [i6]Marc Stevens:
Advances in Hash Function Cryptanalysis. ERCIM News 2012(90) (2012) - [i5]Marc Stevens:
Single-block collision attack on MD5. IACR Cryptol. ePrint Arch. 2012: 40 (2012)
2000 – 2009
- 2009
- [c3]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:
Breaking the Weakest Link: Becoming a Trusted Authority on the Internet. ERCIM News 2009(77) (2009) - [i3]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
- [c2]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
- [i2]Marc Stevens:
Fast Collision Attack on MD5. IACR Cryptol. ePrint Arch. 2006: 104 (2006) - [i1]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) - 2004
- [c1]Tanja Lange, Marc Stevens:
Efficient Doubling on Genus Two Curves over Binary Fields. Selected Areas in Cryptography 2004: 170-181
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).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.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.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2020-08-08 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
