Floyd Zweydinger

According to our database, Floyd Zweydinger authored at least 8 papers between 2021 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

MiRitH: Efficient Post-Quantum Signatures from MinRank in the Head.

Gora Adj, Stefano Barbero, Emanuele Bellini, Andre Esser, Luis Rivera-Zamarripa, Carlo Sanna, Javier A. Verbel, Floyd Zweydinger

IACR Trans. Cryptogr. Hardw. Embed. Syst., 2024

SoK: CryptographicEstimators - a Software Library for Cryptographic Hardness Estimation.

Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini

Proceedings of the 19th ACM Asia Conference on Computer and Communications Security, 2024

2023

ttCryptographicEstimators: a Software Library for Cryptographic Hardness Estimation.

Andre Esser, Javier A. Verbel, Floyd Zweydinger, Emanuele Bellini

IACR Cryptol. ePrint Arch., 2023

2022

New Time-Memory Trade-Offs for Subset Sum - Improving ISD in Theory and Practice.

Andre Esser, Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2022

Parallel Isogeny Path Finding with Limited Memory.

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

IACR Cryptol. ePrint Arch., 2022

2021

Legendre PRF (Multiple) Key Attacks and the Power of Preprocessing.

Alexander May, Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2021

McEliece needs a Break - Solving McEliece-1284 and Quasi-Cyclic-2918 with Modern ISD.

Andre Esser, Alexander May, Floyd Zweydinger

IACR Cryptol. ePrint Arch., 2021

A Faster Algorithm for Finding Closest Pairs in Hamming Metric.

Andre Esser, Robert Kübler, Floyd Zweydinger

Proceedings of the 41st IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2021