default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSimon-Philipp Merz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Jeremy Booher
, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to Hash Into Supersingular Isogeny Graphs. Comput. J. 67(8): 2702-2719 (2024)- [c10]Benjamin Bencina, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Miha Stopar, Charlotte Weitkämper:
Improved Algorithms for Finding Fixed-Degree Isogenies Between Supersingular Elliptic Curves. CRYPTO (5) 2024: 183-217 - [i13]Simon-Philipp Merz, Kenneth G. Paterson, Àlex Rodríguez García:
Breaking BASS. IACR Cryptol. ePrint Arch. 2024: 1808 (2024) - 2023
- [c9]Wouter Castryck, Marc Houben, Simon-Philipp Merz, Marzio Mula, Sam van Buuren, Frederik Vercauteren:
Weak Instances of Class Group Action Based Cryptography via Self-pairings. CRYPTO (3) 2023: 762-792 - [c8]Luca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, Benjamin Wesolowski:
SCALLOP: Scaling the CSI-FiSh. Public Key Cryptography (1) 2023: 345-375 - [i12]Luca De Feo, Tako Boris Fouotsa, Péter Kutas, Antonin Leroux, Simon-Philipp Merz, Lorenz Panny, Benjamin Wesolowski:
SCALLOP: scaling the CSI-FiSh. IACR Cryptol. ePrint Arch. 2023: 58 (2023) - [i11]Wouter Castryck, Marc Houben, Simon-Philipp Merz, Marzio Mula, Sam van Buuren, Frederik Vercauteren:
Weak instances of class group action based cryptography via self-pairings. IACR Cryptol. ePrint Arch. 2023: 549 (2023) - [i10]Benjamin Bencina, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Miha Stopar, Charlotte Weitkämper:
Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves. IACR Cryptol. ePrint Arch. 2023: 1618 (2023) - 2022
- [c7]Tako Boris Fouotsa, Péter Kutas, Simon-Philipp Merz, Yan Bo Ti:
On the Isogeny Problem with Torsion Point Information. Public Key Cryptography (1) 2022: 142-161 - [i9]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. CoRR abs/2205.00135 (2022) - [i8]Jeremy Booher, Ross Bowden, Javad Doliskani, Tako Boris Fouotsa, Steven D. Galbraith, Sabrina Kunzweiler, Simon-Philipp Merz, Christophe Petit, Benjamin Smith, Katherine E. Stange, Yan Bo Ti, Christelle Vincent, José Felipe Voloch, Charlotte Weitkämper, Lukas Zobernig:
Failing to hash into supersingular isogeny graphs. IACR Cryptol. ePrint Arch. 2022: 518 (2022) - 2021
- [c6]Andrea Basso, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Antonio Sanso:
Cryptanalysis of an Oblivious PRF from Supersingular Isogenies. ASIACRYPT (1) 2021: 160-184 - [c5]Péter Kutas, Simon-Philipp Merz, Christophe Petit, Charlotte Weitkämper:
One-Way Functions and Malleability Oracles: Hidden Shift Attacks on Isogeny-Based Protocols. EUROCRYPT (1) 2021: 242-271 - [i7]Tako Boris Fouotsa, Péter Kutas, Simon-Philipp Merz:
On the Isogeny Problem with Torsion Point Information. IACR Cryptol. ePrint Arch. 2021: 153 (2021) - [i6]Péter Kutas, Simon-Philipp Merz, Christophe Petit, Charlotte Weitkämper:
One-way functions and malleability oracles: Hidden shift attacks on isogeny-based protocols. IACR Cryptol. ePrint Arch. 2021: 282 (2021) - [i5]Andrea Basso, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Antonio Sanso:
Cryptanalysis of an oblivious PRF from supersingular isogenies. IACR Cryptol. ePrint Arch. 2021: 706 (2021) - 2020
- [c4]Andrea Basso, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Charlotte Weitkämper:
On Adaptive Attacks Against Jao-Urbanik's Isogeny-Based Protocol. AFRICACRYPT 2020: 195-213 - [c3]Simon-Philipp Merz, Romy M. Minko, Christophe Petit:
Another Look at Some Isogeny Hardness Assumptions. CT-RSA 2020: 496-511 - [c2]Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit:
On Index Calculus Algorithms for Subfield Curves. SAC 2020: 115-138 - [i4]Andrea Basso, Péter Kutas, Simon-Philipp Merz, Christophe Petit, Charlotte Weitkämper:
On Adaptive Attacks against Jao-Urbanik's Isogeny-Based Protocol. IACR Cryptol. ePrint Arch. 2020: 244 (2020) - [i3]Steven D. Galbraith, Robert Granger, Simon-Philipp Merz, Christophe Petit:
On Index Calculus Algorithms for Subfield Curves. IACR Cryptol. ePrint Arch. 2020: 1315 (2020)
2010 – 2019
- 2019
- [c1]Simon-Philipp Merz, Christophe Petit:
Factoring Products of Braids via Garside Normal Form. Public Key Cryptography (2) 2019: 646-678 - [i2]Simon-Philipp Merz, Romy M. Minko, Christophe Petit:
Another look at some isogeny hardness assumptions. IACR Cryptol. ePrint Arch. 2019: 950 (2019) - 2018
- [i1]Simon-Philipp Merz, Christophe Petit:
On the (non) obfuscating power of Garside Normal Forms. IACR Cryptol. ePrint Arch. 2018: 1142 (2018)
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-12-12 21:55 CET 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:
