On the Hardness of the NTRU problem -- A Geometric Approach to Linear Cryptanalysis -- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation -- Partial Key Exposure Attack on Short Secret Exponent CRT-RSA -- A formula for disaster: a unified approach to elliptic curve special-point-based attacks -- Cryptanalysis of an oblivious PRF from supersingular isogenies -- A Practical Key-Recovery Attack on 805-Round Trivium -- Algebraic Attacks on Rasta and Dasta Using Low-Degree Equations -- Automatic Classical and Quantum Rebound Attacks on AES-like Hashing by Exploiting Related-key Differentials -- Clustering Effect in Simon and Simeck -- New Attacks on LowMC instances with a Single Plaintext/Ciphertext pair -- Convexity of division property transitions: theory, algorithms and compact models -- Strong and Tight Security Guarantees against Integral Distinguishers -- Massive Superpoly Recovery with Nested Monomial Predictions -- Quantum Linearization Attacks -- Generic Framework for Key-Guessing Improvements -- On the non-tightness of measurement-based reductions for key encapsulation mechanism in the quantum random oracle model -- Redeeming Reset Indifferentiability and Applications to Post-Quantum Security -- Franchised Quantum Money -- Quantum Computationally Predicate-Binding Commitments with Application in Quantum Zero-Knowledge Arguments for NP -- Quantum Encryption with Certified Deletion, Revisited: Public Key, Attribute-Based, and Classical Communication -- Tight adaptive reprogramming in the QROM -- QCB: Efficient Quantum-secure Authenticated Encryption.