Abstract is missing.
- Antrag: Annular NTRU Trapdoor Generation - Making Mitaka as Secure as FalconThomas Espitau, Thi Thu Quyen Nguyen, Chao Sun, Mehdi Tibouchi, Alexandre Wallet. 3-36 [doi]
- G+G: A Fiat-Shamir Lattice Signature Based on Convolved GaussiansJulien Devevey, Alain Passelègue, Damien Stehlé. 37-64 [doi]
- On Gaussian Sampling, Smoothing Parameter and Application to SignaturesThomas Espitau, Alexandre Wallet, Yang Yu 0008. 65-97 [doi]
- FESTA: Fast Encryption from Supersingular Torsion AttacksAndrea Basso 0002, Luciano Maino, Giacomo Pope. 98-126 [doi]
- A Polynomial Time Attack on Instances of M-SIDH and FESTAWouter Castryck, Frederik Vercauteren. 127-156 [doi]
- NEV: Faster and Smaller NTRU Encryption Using Vector DecodingJiang Zhang 0001, Dengguo Feng, Di Yan. 157-189 [doi]
- Cryptographic Smooth NeighborsGiacomo Bruno, Maria Corte-Real Santos, Craig Costello, Jonathan Komada Eriksen, Michael Meyer 0001, Michael Naehrig, Bruno Sterner. 190-221 [doi]
- Non-interactive Commitment from Non-transitive Group ActionsGiuseppe D'Alconzo, Andrea Flamini, Andrea Gangemi. 222-252 [doi]
- Pseudorandomness of Decoding, Revisited: Adapting OHCP to Code-Based CryptographyMaxime Bombar, Alain Couvreur, Thomas Debris-Alazard. 253-283 [doi]
- Blockwise Rank Decoding Problem and LRPC Codes: Cryptosystems with Smaller SizesYongcheng Song, Jiang Zhang 0001, Xinyi Huang 0001, Wei Wu 0001. 284-316 [doi]
- SDitH in the QROMCarlos Aguilar Melchor, Andreas Hülsing, David Joseph, Christian Majenz, Eyal Ronen, Dongze Yue. 317-350 [doi]
- A New Formulation of the Linear Equivalence Problem and Shorter LESS SignaturesEdoardo Persichetti, Paolo Santini. 351-378 [doi]