- A Classification of Differential Invariants for Multivariate Post-quantum Cryptosystems: Present an extension of a recent measure of security against a differential adversary. The technique assures security against any first-order differential invariant adversary. [PS13]
- A Comparison of Security and its Performance for Key Agreements in Post-Quantum Cryptography: Complexity analysis on isogeny-based, code-based and lattice-baced PQC schemes [BRP20]
- A Complete Cryptanalysis of the Post-Quantum Multivariate Signature Scheme Himq-3: Singularity Attack Successfully breaks signatures of the multivarite public key scheme Himq-3 [DZD20]
- A Practical Adaptive Key Recovery Attack on the LGM (GSW-like) Cryptosystem: The Secret Key of an LGM Cryptosystem can be recovered in practical time [FHR21]
- A Rank Attack Against Extension Field Cancellation.: Key-Recovery on EFC, a Multivariate-based Cryptosystem [SV20]
- A Structural Attack on Block-Anti-Circulant UOV at SAC 2019: A reduction of the public-key size of the bac-uov-signature scheme [FKI20]
- A fast quantum mechanical algorithm for database search: Description of a quantum algorithm to search an unsorted database in a square of the time a classical computer would need [G96]
- An Analysis of Fault Attacks on CSIDH: Analysis of Fault Attacks on CSIDH with simulation based verification [LH20]
- An algebraic approach to the Rank Support Learning problem: breaking the Durandal Signature scheme [BB21]
- Anonymous, Robust Post-Quantum Public Key Encryption: Study of the anonymity and robustness of NIST finalists Classic McEliece, Kyber, NTRU and Saber [GMP21]
- Attack Beyond-Birthday-Bound MACs in Quantum Setting.: A study on attacking BBB-based MACs [GWH20]
- Boosting the Hybrid Attack on NTRU: Torus LSH, Permuted HNF and Boxed Sphere: Study on Attacking NTRU Cryptographic systems with hybrid techniques including Meet-In-The-Middle strategies [N21]
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers.: An efficiency improvement on the gaussian sampler used in lattice-based cryptography [ZSS20]
- Codes, Cryptology and Information Security: Second International Conference, C2SI 2017, Rabat, Morocco, April 10–12, 2017, Proceedings - In Honor of Claude Carlet: A proposal to make the BJMM-ISD decoding algorithm more versatile. [ENS17]
- Cold Boot Attacks on Ring and Module LWE Keys Under the NTT: Recovery of secret data from RLWE-Coefficients still in RAM after cold boot [ADP18]
- Collapseability of Tree Hashes: Study on collisions of hash-functions in the quantum space [GM20]
- Combinatorial Rank Attacks Against the Rectangular Simple Matrix Encryption Scheme.: A Study of the security of the Multivariate based ABC Simple Matrix Encryption Scheme against Rank Attacks [AMP20]
- Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme: A new type of attack called Subfield Differential Attack (SDA) on Lifted Unbalanced Oil and Vinegar (LUOV) [DDS20]
- Decoding Linear Codes with High Error Rate and Its Impact for LPN Security: An improvement on decoding linear codes. [BM18]
- Decoding supercodes of Gabidulin codes and applications to cryptanalysis: Improvements on Codebased Cryptographic schemes. [BC21]
- Decryption Failure Is More Likely After Success.: Leakage of secret key also possible on non-failure-decryptable ciphertexts [BS20]
- Efficient Key Recovery for all HFE Signature Variants: An improved key-recovery attack against the HFE-Signature scheme [TPD21]
- Encryption Schemes Using Random Oracles: From Classical to Post-Quantum Security.: Study on the proof of post-quantum security of algorithms [KS20]
- Estimate All the \LWE, NTRU\ Schemes!: Study of the impact of runtime estimation on the security of lattice schemes [ACD18]
- Fast verified post-quantum software, part 1: RAM subroutines: Compilation of different mistakes and exploitations in cryptolibraries [B21]
- Fault Attacks on CCA-secure Lattice KEMs: Skipping Fault in Lattice based Cryptography [PP21]
- Fault-Enabled Chosen-Ciphertext Attacks on Kyber: Fault Injection on Kyber [HPP21]
- Formal Verifcation of Post-Quantum Cryptography: Study on the cryptography verification and proof mechanisms in the field of PQ-Cryptography. [S21]
- Generalization of Isomorphism of Polynomials with Two Secrets and Its Application to Public Key Encryption: proposal of a multivariate PKE scheme. [S20]
- Grover vs. McEliece: An Approach to attack McEliece with Grover’s algorithm [B10]
- Implementation of Lattice Trapdoors on Modules and Applications: Development of a standard-model lattice based scheme, usable on standard hardware. [BEP21]
- Isochronous Gaussian Sampling: From Inception to Implementation.: proposal for a gaussian sampler [HPR20]
- Lower bounds on lattice sieving and information set decoding: An optimisation approach for lattice based cryptography. [KL21]
- NTRU leads to Anonymous, Robust Public-Key Encryption: Solution to the open problem of the anonymity and robustness of NTRU [X21]
- On Quantum Chosen-Ciphertext Attacks and Learning with Errors: Chosen cipher-text attack using a new variant of the Bernstein–Vazirani algorithm on LWE algorithms [AJO20]
- On the Effect of Projection on Rank Attacks in Multivariate Cryptography: A Study on using projections to increase the security of the lattice based schemes HFEv and PFLASH against rank attacks. [ØSV21]
- On the concrete hardness of Learning with Errors: A Study on estimations of the hardness of lattice based algorithms. [APS15]
- Optimizing BJMM with Nearest Neighbors : Full Decoding in 2 2 n / 21 and McEliece Security: An improvement proposal for the BJMM-ISD decoding algorithm [BM17]
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer: A proposal for a quantum algorithm to perform prime factorisation on a quantum computer [S97]
- Post-Quantum Verification of Fujisaki-Okamoto: Computer-verified formalization of the post-quantum security proof of the Fujisaki-Okamoto transform [U20]
- Practical Cryptanalysis of k-ary C*.: The multivariate k-ary C* cryptography scheme is broken. [So20]
- Practical Optical Fault Injection on Secure Microcontrollers: Experimental survey on the practicability of optical fault injection on smartcards [vWM11]
- Quantum Cryptanalysis in the RAM Model: Claw-Finding Attacks on SIKE: New models of computation which allow a direct comparison between classical and quantum algorithms [JS19]
- Quantum cryptanalysis on some generalized Feistel schemes: Quantum distinguishers to introduce generic quantum key-recovery attacks [DLW19]
- Quantum indistinguishability for public key encryption: A distinguishing attack against code-based cryptography schemes. [GKS20]
- Return of version downgrade attack in the era of TLS 1.3: A mechanism to detect and prevent a TLS downgrade / MITM attack [LSH20]
- Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment.: proposal of a more efficient zero-knowledge-proof of knowledge [TWZ20]
- Testing of Code-Based Pseudorandom Number Generators for Post-Quantum Application: Code-based pseudorandom generator, improvement of Fischer-Stern generator [KKS20]
- The supersingular isogeny problem in genus 2 and beyond: A solver for the isogenie-problem on classical computers [CS19]
- Time-independent discrete Gaussian sampling for post-quantum cryptography: Countermessures against timing attacks on the gaussian sampler [KHR16]
- Verifying Post-Quantum Signatures in 8 kB of RAM: Verification of NIST PQC round-3 signature scheme candidates Dilithium, Falcon, Rainbow, GeMSS, and SPHINCS+ [GHK21]

Last modified June 6, 2022

© 2022 Darmstadt University of Applied Sciences

Impress