Reduced memory meet-in-the-middle attack against the NTRU private key

DOI10.1112/S1461157016000206zbMath1391.94827MaRDI QIDQ2970998

Christine van Vredendaal

Publication date: 4 April 2017

Published in: LMS Journal of Computation and Mathematics (Search for Journal in Brave)

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16)

Related Items (5)

How to meet ternary LWE keys ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ Parallel isogeny path finding with limited memory ⋮ NTRU prime: reducing attack surface at low cost ⋮ Improved classical cryptanalysis of SIKE in practice

Cites Work

• Parallel collision search with cryptanalytic applications
• Random small Hamming weight products with applications to cryptography
• On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Efficient Fully Homomorphic Encryption from (Standard) $\mathsf{LWE}$
• An algorithm for source coding
• Enumerative source encoding

This page was built for publication: Reduced memory meet-in-the-middle attack against the NTRU private key