A Subfield Lattice Attack on Overstretched NTRU Assumptions (Q2835586)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	A Subfield Lattice Attack on Overstretched NTRU Assumptions	scientific article

Statements

scholarly article

0 references

A Subfield Lattice Attack on Overstretched NTRU Assumptions (English)

0 references

zbMATH Open document ID

0 references

10.1007/978-3-662-53018-4_6

0 references

Martin R. Albrecht

0 references

0 references

0 references

Advances in Cryptology – CRYPTO 2016

0 references

publication date

30 November 2016

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

zbMATH Keywords

subfield lattice attack

0 references

overstretched NTRU

0 references

FHE

0 references

graded encoding schemes

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-662-53018-4_6

0 references

0 references

Implementing Candidate Graded Encoding Schemes from Ideal Lattices

0 references

Subexponential class group and unit group computation in large degree number fields

0 references

Subexponential time relations in the class group of large degree number fields

0 references

Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme

0 references

Efficient quantum algorithms for computing class groups and solving the principal ideal problem in arbitrary degree number fields

0 references

Efficient Fully Homomorphic Encryption from (Standard) LWE

0 references

Recovering Short Generators of Principal Ideals in Cyclotomic Rings

0 references

Advances in cryptology -- CRYPTO 2013. 33rd annual cryptology conference, Santa Barbara, CA, USA, August 18--22, 2013. Proceedings, Part I

0 references

Provably Weak Instances of Ring-LWE Revisited

0 references

An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero

0 references

Practical Multilinear Maps over the Integers

0 references

BKZ 2.0: Better Lattice Security Estimates

0 references

Which Ring Based Somewhat Homomorphic Encryption Scheme is Best?

0 references

Lattice Signatures and Bimodal Gaussians

0 references

Homomorphic AES evaluation using the modified LTV scheme

0 references

A quantum algorithm for computing the unit group of an arbitrary degree number field

0 references

Weak Instances of PLWE

0 references

Provably Weak Instances of Ring-LWE

0 references

ON THE MERTENS–CESÀRO THEOREM FOR NUMBER FIELDS

0 references

0 references

Candidate Multilinear Maps from Ideal Lattices

0 references

Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits

0 references

0 references

Advances in cryptology -- CRYPTO 2015. 35th annual cryptology conference, Santa Barbara, CA, USA, August 16--20, 2015. Proceedings. Part II

0 references

0 references

A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU

0 references

0 references

0 references

0 references

Analyzing Blockwise Lattice Algorithms Using Dynamical Systems

0 references

Choosing Parameters for NTRUEncrypt

0 references

An Improved BKW Algorithm for LWE with Applications to Cryptography and Lattices

0 references

Improved algorithms for finding low-weight polynomial multiples in \(\mathbb F_2[x]\) and some cryptographic applications

0 references

Factoring polynomials with rational coefficients

0 references

A Comparison of the Homomorphic Encryption Schemes FV and YASHE

0 references

On Ideal Lattices and Learning with Errors over Rings

0 references

Revisiting the Gentry-Szydlo Algorithm

0 references

GGHLite: More Efficient Multilinear Maps from Ideal Lattices

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

How (Not) to Instantiate Ring-LWE

0 references

Advances in cryptology - EUROCRYPT 2001. 20th international conference on theory and application of cryptographic techniques, Innsbruck, Austria, May 6--10, 2001. Proceedings

0 references

0 references

0 references

A hierarchy of polynomial time lattice basis reduction algorithms

0 references

The probability that random algebraic integers are relatively \(r\)-prime

0 references

Making NTRU as Secure as Worst-Case Problems over Ideal Lattices

0 references

Efficient Public Key Encryption Based on Ideal Lattices

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2835586

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2835586&oldid=36290709"