NTRU

swMATH11761MaRDI QIDQ23700

No author found.

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

Related Items (only showing first 100 items - show all)

On random nonsingular Hermite normal form ⋮ Solving systems of polynomial equations with symmetries using SAGBI-Gröbner bases ⋮ Parallel symmetric attack on NTRU using non-deterministic lattice reduction ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ How to meet ternary LWE keys ⋮ A trace map attack against special ring-LWE samples ⋮ A scalable post-quantum hash-based group signature ⋮ Homomorphic AES evaluation using the modified LTV scheme ⋮ An efficient lattice reduction using reuse technique blockwisely on NTRU ⋮ An extension of Kannan's embedding for solving ring-based LWE problems ⋮ 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 ⋮ Unnamed Item ⋮ Towards Efficient Arithmetic for Lattice-Based Cryptography on Reconfigurable Hardware ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bootstrapping for approximate homomorphic encryption ⋮ Full Lattice Basis Reduction on Graphics Cards ⋮ Post-quantum cryptography: lattice signatures ⋮ Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems ⋮ Unnamed Item ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ Bootstrapping for helib ⋮ A non-commutative cryptosystem based on quaternion algebras ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Unnamed Item ⋮ When NTT meets Karatsuba: preprocess-then-NTT technique revisited ⋮ Finding shortest lattice vectors faster using quantum search ⋮ PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials ⋮ New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors ⋮ Small leaks sink a great ship: an evaluation of key reuse resilience of PQC third round finalist NTRU-HRSS ⋮ A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ A signature scheme from the finite field isomorphism problem ⋮ Efficiently processing complex-valued data in homomorphic encryption ⋮ Flattening NTRU for evaluation key free homomorphic encryption ⋮ Characterizing overstretched NTRU attacks ⋮ Revisiting lower dimension lattice attacks on NTRU ⋮ Unnamed Item ⋮ Unnamed Item ⋮ D-NTRU: more efficient and average-case IND-CPA secure NTRU variant ⋮ Cryptanalysis of the GGH cryptosystem ⋮ A public key cryptosystem based on three new provable problems ⋮ Cryptanalysis of a code-based one-time signature ⋮ Random small Hamming weight products with applications to cryptography ⋮ Lattice polly cracker cryptosystems ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Twisted-PHS: using the product formula to solve approx-SVP in ideal lattices ⋮ Fault analysis of the NTRUSign digital signature scheme ⋮ SLAP: simpler, improved private stream aggregation from ring learning with errors ⋮ On the (M)iNTRU assumption in the integer case ⋮ Primality testing and integer factorization in public-key cryptography ⋮ Identity-based aggregate signcryption in the standard model from multilinear maps ⋮ Group key agreement for secure group communication in dynamic peer systems ⋮ STP-LWE: A variant of learning with error for a flexible encryption ⋮ EPiC: efficient privacy-preserving counting for MapReduce ⋮ An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice ⋮ Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings ⋮ On the geometry of cyclic lattices ⋮ Lower bounds of shortest vector lengths in random NTRU lattices ⋮ Quantum algorithm design: techniques and applications ⋮ ETRU: NTRU over the Eisenstein integers ⋮ Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors ⋮ Generalized compact knapsacks, cyclic lattices, and efficient one-way functions ⋮ How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields ⋮ \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ A wrap error attack against NTRUEncrypt ⋮ NTRU over rings beyond \(\mathbb{Z}\) ⋮ CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes ⋮ A framework for cryptographic problems from linear algebra ⋮ Finding Shortest Lattice Vectors in the Presence of Gaps ⋮ An experimental comparison of some LLL-type lattice basis reduction algorithms ⋮ Identity based blind signature scheme over NTRU lattices ⋮ Post-Quantum Cryptography: State of the Art ⋮ Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures ⋮ Evaluating the potential for hardware acceleration of four NTRU-based key encapsulation mechanisms using software/hardware codesign ⋮ Modular lattice signatures, revisited ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ Parallel Implementation of BDD Enumeration for LWE ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ On the distribution of low Hamming weight products ⋮ A Subfield Lattice Attack on Overstretched NTRU Assumptions ⋮ Efficient Algorithms for Supersingular Isogeny Diffie-Hellman ⋮ Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures ⋮ Attribute-Based Encryption for Circuits from Multilinear Maps ⋮ Lattice-based revocable certificateless signature ⋮ Covert authentication from lattices ⋮ A new post-quantum multivariate polynomial public key encapsulation algorithm ⋮ Distinguishing attack on the NTRUCipher encryption scheme ⋮ Improved lattice enumeration algorithms by primal and dual reordering methods ⋮ Worst-case to average-case reductions for module lattices ⋮ Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme ⋮ Distribution of inverses in polynomial rings ⋮ Quantum key search for ternary LWE ⋮ Implementation of lattice trapdoors on modules and applications ⋮ On removing rejection conditions in practical lattice-based signatures ⋮ An algebraic approach to the rank support learning problem

This page was built for software: NTRU