Abstract is missing.
- Randomized Decoding of Gabidulin Codes Beyond the Unique Decoding RadiusJulian Renner, Thomas Jerkovits, Hannes Bartz, Sven Puchinger, Pierre Loidreau, Antonia Wachter-Zeh. 3-19 [doi]
- About Low DFR for QC-MDPC DecodingNicolas Sendrier, Valentin Vasseur. 20-34 [doi]
- QC-MDPC Decoders with Several Shades of GrayNir Drucker, Shay Gueron, Dusan Kostic. 35-50 [doi]
- Isochronous Gaussian Sampling: From Inception to ImplementationJames Howe, Thomas Prest, Thomas Ricosset, Mélissa Rossi. 53-71 [doi]
- Benchmarking Post-quantum Cryptography in TLSChristian Paquin, Douglas Stebila, Goutam Tamvada. 72-91 [doi]
- Efficient Key Generation for RainbowAlbrecht Petzoldt. 92-107 [doi]
- CSIDH on the SurfaceWouter Castryck, Thomas Decru. 111-129 [doi]
- LegRoast: Efficient Post-quantum Signatures from the Legendre PRFWard Beullens, Cyprien Delpech de Saint Guilhem. 130-150 [doi]
- The Supersingular Isogeny Problem in Genus 2 and BeyondCraig Costello, Benjamin Smith 0003. 151-168 [doi]
- Sashimi: Cutting up CSI-FiSh Secret Keys to Produce an Actively Secure Distributed Signing ProtocolDaniele Cozzo, Nigel P. Smart. 169-186 [doi]
- Defeating NewHope with a Single TraceDorian Amiet, Andreas Curiger, Lukas Leuenberger, Paul Zbinden. 189-205 [doi]
- Decryption Failure Is More Likely After SuccessNina Bindel, John M. Schanck. 206-225 [doi]
- Compact Privacy Protocols from Post-quantum and Timed Classical AssumptionsJonathan Bootle, Anja Lehmann, Vadim Lyubashevsky, Gregor Seiler. 226-246 [doi]
- Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to PrivacyCecilia Boschini, Jan Camenisch, Max Ovsiankin, Nicholas Spooner. 247-267 [doi]
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based CommitmentYang Tao, Xi Wang, Rui Zhang 0002. 268-283 [doi]
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over IntegersRaymond K. Zhao, Ron Steinfeld, Amin Sakzad. 284-303 [doi]
- Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption SchemeDaniel Apon, Dustin Moody, Ray A. Perlner, Daniel Smith-Tone, Javier A. Verbel. 307-322 [doi]
- A Structural Attack on Block-Anti-Circulant UOV at SAC 2019Hiroki Furue, Koha Kinjo, Yasuhiko Ikematsu, Yacheng Wang, Tsuyoshi Takagi. 323-339 [doi]
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key EncryptionBagus Santoso. 340-359 [doi]
- *Daniel Smith-Tone. 360-380 [doi]
- A Rank Attack Against Extension Field CancellationDaniel Smith-Tone, Javier A. Verbel. 381-401 [doi]
- Multivariate Encryption Schemes Based on Polynomial Equations over Real NumbersTakanori Yasuda, Yacheng Wang, Tsuyoshi Takagi. 402-421 [doi]
- Improved Quantum Circuits for Elliptic Curve Discrete LogarithmsThomas Häner, Samuel Jaques, Michael Naehrig, Martin Roetteler, Mathias Soeken. 425-444 [doi]
- The Power of Few Qubits and Collisions - Subset Sum Below Grover's BoundAlexander Helm, Alexander May 0001. 445-460 [doi]
- On Quantum Distinguishers for Type-3 Generalized Feistel Network Based on SeparabilitySamir Hodzic, Lars Knudsen Ramkilde, Andreas Brasen Kidmose. 461-480 [doi]
- Many a Mickle Makes a Muckle: A Framework for Provably Quantum-Secure Hybrid Key ExchangeBenjamin Dowling, Torben Brandt Hansen, Kenneth G. Paterson. 483-502 [doi]
- A Note on the Instantiability of the Quantum Random OracleEdward Eaton, Fang Song 0001. 503-523 [doi]
- Collapseability of Tree HashesAldo Gunsing, Bart Mennink. 524-538 [doi]
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum SecurityJuliane Krämer, Patrick Struck. 539-558 [doi]