NTRU

swMATH11761MaRDI QIDQ23700FDOQ23700

Author name not available (Why is that?)

Source code repository: https://github.com/NTRUOpenSourceProject/ntru-crypto

Cited In (only showing first 100 items - show all)

• A lattice attack on homomorphic NTRU with non-invertible public keys
• Cryptanalysis of a code-based one-time signature
• Distinguishing attack on the NTRUCipher encryption scheme
• Improved lattice enumeration algorithms by primal and dual reordering methods
• When NTT meets Karatsuba: preprocess-then-NTT technique revisited
• Provably secure NTRU instances over prime cyclotomic rings
• Distribution of inverses in polynomial rings
• Quantum algorithm design: techniques and applications
• Analysis of error terms of signatures based on learning with errors
• An extension of Kannan's embedding for solving ring-based LWE problems
• How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• Floating-Point LLL: Theoretical and Practical Aspects
• A Practical Public Key Cryptosystem from Paillier and Rabin Schemes
• \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
• 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
• Parallel symmetric attack on NTRU using non-deterministic lattice reduction
• Bootstrapping for approximate homomorphic encryption
• Primality testing and integer factorization in public-key cryptography
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• Choosing parameters for NTRUEncrypt
• 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
• 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
• Advances in Cryptology - EUROCRYPT 2004
• Cryptographic Hardware and Embedded Systems - CHES 2004
• Title not available (Why is that?)
• Multi-key FHE from LWE, revisited
• Characterizing overstretched NTRU attacks
• CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes
• STP-LWE: A variant of learning with error for a flexible encryption
• 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
• GGHLite: more efficient multilinear maps from ideal lattices
• High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
• Title not available (Why is that?)
• 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
• Revisiting lower dimension lattice attacks on NTRU
• Efficiently processing complex-valued data in homomorphic encryption
• Finding shortest lattice vectors in the presence of gaps
• Short generators without quantum computers: the case of multiquadratics
• Short Stickelberger class relations and application to Ideal-SVP
• An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
• Compact privacy protocols from post-quantum and timed classical assumptions
• A non-commutative cryptosystem based on quaternion algebras
• A Lattice Based Public Key Cryptosystem Using Polynomial Representations
• Optimizations for NTRU
• Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
• On error distributions in ring-based LWE
• Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
• The Complexity of Public-Key Cryptography
• Revisiting Lattice Attacks on Overstretched NTRU Parameters
• Title not available (Why is that?)
• Towards efficient arithmetic for lattice-based cryptography on reconfigurable hardware
• Fault analysis of the NTRUSign digital signature scheme
• On the design of hardware building blocks for modern lattice-based encryption schemes
• Identity-based aggregate signcryption in the standard model from multilinear maps
• Information Security and Privacy
• Symplectic Lattice Reduction and NTRU
• Gröbner bases of ideals invariant under a commutative group: the non-modular case
• Covert authentication from lattices
• New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors
• Finding shortest lattice vectors faster using quantum search
• Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
• Lattice Reduction Algorithms: Theory and Practice
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• On random nonsingular Hermite normal form
• A scalable post-quantum hash-based group signature
• Rigorous and Efficient Short Lattice Vectors Enumeration
• Title not available (Why is that?)
• A framework for cryptographic problems from linear algebra
• Generalized Compact Knapsacks Are Collision Resistant
• Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
• STACS 2004
• Homomorphic Encryption Standard
• Learning a zonotope and more: cryptanalysis of ntrusign countermeasures
• FHEW: bootstrapping homomorphic encryption in less than a second
• An improved BKW algorithm for LWE with applications to cryptography and lattices
• A key recovery attack on MDPC with CCA security using decoding errors
• One-shot verifiable encryption from lattices
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Title not available (Why is that?)
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• An algebraic attack on rank metric code-based cryptosystems
• SWIFFT: A Modest Proposal for FFT Hashing
• Lattice polly cracker cryptosystems
• A new post-quantum multivariate polynomial public key encapsulation algorithm
• Integer version of ring-LWE and its applications
• An experimental comparison of some LLL-type lattice basis reduction algorithms
• Adapting Density Attacks to Low-Weight Knapsacks
• A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
• Algorithms for the shortest and closest lattice vector problems
• Analyzing blockwise lattice algorithms using dynamical systems
• Homomorphic AES evaluation using the modified LTV scheme

This page was built for software: NTRU