default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFloyd Zweydinger
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[b1]Floyd Zweydinger:
Practical cryptanalysis of code-based crypto schemes. Bochum University, Germany, 2024- [j1]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(2): 304-328 (2024) - [c6]Andre Esser
, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation. AsiaCCS 2024 - 2023
- [c5]Andre Esser, Floyd Zweydinger:
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. EUROCRYPT (5) 2023: 360-390 - [i7]Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini:
ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation. IACR Cryptol. ePrint Arch. 2023: 589 (2023) - [i6]Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger:
MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head. IACR Cryptol. ePrint Arch. 2023: 1666 (2023) - 2022
- [c4]Alexander May, Floyd Zweydinger:
Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. CSF 2022: 428-438 - [c3]Andre Esser, Alexander May, Floyd Zweydinger:
McEliece Needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. EUROCRYPT (3) 2022: 433-457 - [c2]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. INDOCRYPT 2022: 294-316 - [i5]Andre Esser, Floyd Zweydinger:
New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice. IACR Cryptol. ePrint Arch. 2022: 1329 (2022) - [i4]Emanuele Bellini, Jorge Chávez-Saab, Jesús-Javier Chi-Domínguez, Andre Esser, Sorina Ionica, Luis Rivera-Zamarripa, Francisco Rodríguez-Henríquez, Monika Trimoska, Floyd Zweydinger:
Parallel Isogeny Path Finding with Limited Memory. IACR Cryptol. ePrint Arch. 2022: 1464 (2022) - 2021
- [c1]Andre Esser, Robert Kübler, Floyd Zweydinger:
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. FSTTCS 2021: 20:1-20:21 - [i3]Andre Esser, Robert Kübler, Floyd Zweydinger:
A Faster Algorithm for Finding Closest Pairs in Hamming Metric. CoRR abs/2102.02597 (2021) - [i2]Alexander May, Floyd Zweydinger:
Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing. IACR Cryptol. ePrint Arch. 2021: 645 (2021) - [i1]Andre Esser, Alexander May, Floyd Zweydinger:
McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD. IACR Cryptol. ePrint Arch. 2021: 1634 (2021)
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-10-21 21:32 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:
