Cited in
(only showing first 100 items - show all)- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- scientific article; zbMATH DE number 1643920 (Why is no real title available?)
- Cryptanalysis of a code-based one-time signature
- scientific article; zbMATH DE number 1361739 (Why is no real title available?)
- Finding shortest lattice vectors faster using quantum search
- A lattice attack on homomorphic NTRU with non-invertible public keys
- On random nonsingular Hermite normal form
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Lattice Reduction Algorithms: Theory and Practice
- Distinguishing attack on the NTRUCipher encryption scheme
- Improved lattice enumeration algorithms by primal and dual reordering methods
- A scalable post-quantum hash-based group signature
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- EPiC: efficient privacy-preserving counting for MapReduce
- Fully homomorphic encryption from ring-LWE and security for key dependent messages
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Distribution of inverses in polynomial rings
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Quantum algorithm design: techniques and applications
- Provably secure NTRU instances over prime cyclotomic rings
- scientific article; zbMATH DE number 1612515 (Why is no real title available?)
- Analysis of error terms of signatures based on learning with errors
- An extension of Kannan's embedding for solving ring-based LWE problems
- A framework for cryptographic problems from linear algebra
- Lattice-based revocable certificateless signature
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- NTRU algorithm: N\textsuperscript{th} degree truncated polynomial ring units
- Cryptanalysis of NTRU where the private polynomial has one or more consecutive zero coefficients
- Generalized Compact Knapsacks Are Collision Resistant
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Floating-Point LLL: Theoretical and Practical Aspects
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
- An algebraic approach to the rank support learning problem
- Implementation of lattice trapdoors on modules and applications
- On removing rejection conditions in practical lattice-based signatures
- Quantum key search for ternary LWE
- scientific article; zbMATH DE number 6292594 (Why is no real title available?)
- Parallel shortest lattice vector enumeration on graphics cards
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction
- Primality testing and integer factorization in public-key cryptography
- Bootstrapping for approximate homomorphic encryption
- STACS 2004
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- FHEW: bootstrapping homomorphic encryption in less than a second
- Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
- Homomorphic Encryption Standard
- Full Lattice Basis Reduction on Graphics Cards
- An improved BKW algorithm for LWE with applications to cryptography and lattices
- A key recovery attack on MDPC with CCA security using decoding errors
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- scientific article; zbMATH DE number 1996487 (Why is no real title available?)
- Integer Reconstruction Public-Key Encryption
- Choosing parameters for NTRUEncrypt
- One-shot verifiable encryption from lattices
- Computing generator in cyclotomic integer rings. A subfield algorithm for the principal ideal problem in \(L_{|\varDelta_\mathbb {K}|}\left(\frac{1}{2}\right)\) and application to the cryptanalysis of a FHE scheme
- Post-quantum cryptography: state of the art
- Lattice polly cracker cryptosystems
- An algebraic attack on rank metric code-based cryptosystems
- scientific article; zbMATH DE number 2009971 (Why is no real title available?)
- How to meet ternary LWE keys
- A trace map attack against special ring-LWE samples
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
- SWIFFT: A Modest Proposal for FFT Hashing
- A new post-quantum multivariate polynomial public key encapsulation algorithm
- Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Algorithms for the Generalized NTRU Equations and their Storage Analysis
- scientific article; zbMATH DE number 2043328 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Cryptographic Hardware and Embedded Systems - CHES 2004
- Integer version of ring-LWE and its applications
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- A New Operator for Multi-addition Calculations
- Multi-key FHE from LWE, revisited
- Characterizing overstretched NTRU attacks
- Adapting Density Attacks to Low-Weight Knapsacks
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
- STP-LWE: A variant of learning with error for a flexible encryption
- Algorithms for the shortest and closest lattice vector problems
- A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
- Analyzing blockwise lattice algorithms using dynamical systems
- Homomorphic AES evaluation using the modified LTV scheme
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- GGHLite: more efficient multilinear maps from ideal lattices
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- scientific article; zbMATH DE number 1617925 (Why is no real title available?)
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- How to find ternary LWE keys using locality sensitive hashing
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- Towards quantum large-scale password guessing on real-world distributions
- Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases
- Revisiting lower dimension lattice attacks on NTRU
This page was built for software: NTRU
