Abstract Fully Homomorphic Encryption (FHE) is a cryptographic primitive that allows
performing arbitrary operations on encrypted data. Since the conception of the idea in …

Recently, NIST has announced Kyber, a lattice-based key encapsulation mechanism (KEM),
as a post-quantum standard. However, it is not the most efficient scheme among the NIST's …

The literature gives the impression that (1) existing heuristics accurately predict how
effective lattice attacks are,(2) non-ternary lattice systems are not vulnerable to hybrid multi …

Combinatorial attacks on small max norm LWE keys suffer enormous memory requirements,
which render them inefficient in realistic attack scenarios. Therefore, more memory-efficient …

This paper introduces SMAUG-T, a lattice-based post-quantum key exchange algorithm
submitted to Round 2 of the Korean Post-Quantum Cryptography Competition (KpqC) …

We describe a subfield attack for NTRU problem by using the symmetric function map S k,
which is a generalization of results presented by Albrecht, Bai and Ducas [1] and Cheon …

A cryptographic primitive based on the Learning With Errors (LWE) problem with its variants
is a promising candidate for the efficient quantum-resistant public key cryptosystem. The …

A cryptographic primitive based on the Learning With Errors (LWE) problem with variants is
a promising candidate for the efficient quantum-resistant public key cryptosystem. As the …

Abstract The Learning with Errors (LWE) problem with its variants over structured lattices has
been widely exploited in efficient post-quantum cryptosystems. Recently, May suggests the …

Plenty of lattice-based cryptosystems use ternary or quinary sparse short vectors to
accelerate the computing procedure. The hybrid attack, proposed by Howgrave-Graham …