The following pages link to NTRU (Q23700):
Displaying 50 items.
- On random nonsingular Hermite normal form (Q266588) (← links)
- Homomorphic AES evaluation using the modified LTV scheme (Q310240) (← links)
- An efficient lattice reduction using reuse technique blockwisely on NTRU (Q317407) (← links)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- A public key cryptosystem based on three new provable problems (Q418738) (← links)
- Group key agreement for secure group communication in dynamic peer systems (Q455985) (← links)
- On the geometry of cyclic lattices (Q464733) (← links)
- Lower bounds of shortest vector lengths in random NTRU lattices (Q477183) (← links)
- ETRU: NTRU over the Eisenstein integers (Q488263) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Cryptanalysis of the GGH cryptosystem (Q626951) (← links)
- Lattice polly cracker cryptosystems (Q633081) (← links)
- An experimental comparison of some LLL-type lattice basis reduction algorithms (Q722627) (← links)
- A scalable post-quantum hash-based group signature (Q831185) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials (Q887439) (← links)
- NTRU over rings beyond \(\mathbb{Z}\) (Q977194) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- Primality testing and integer factorization in public-key cryptography (Q1418120) (← links)
- Distribution of inverses in polynomial rings (Q1605093) (← links)
- Bootstrapping for approximate homomorphic encryption (Q1648805) (← links)
- A non-commutative cryptosystem based on quaternion algebras (Q1671643) (← links)
- Identity-based aggregate signcryption in the standard model from multilinear maps (Q1712499) (← links)
- STP-LWE: A variant of learning with error for a flexible encryption (Q1718158) (← links)
- Quantum algorithm design: techniques and applications (Q1730317) (← links)
- Parallel symmetric attack on NTRU using non-deterministic lattice reduction (Q1877370) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Fault analysis of the NTRUSign digital signature scheme (Q1947651) (← links)
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- CHIMERA: combining ring-LWE-based fully homomorphic encryption schemes (Q2023314) (← links)
- A framework for cryptographic problems from linear algebra (Q2023808) (← links)
- An algebraic attack on rank metric code-based cryptosystems (Q2055648) (← links)
- On the distribution of low Hamming weight products (Q2069331) (← links)
- Covert authentication from lattices (Q2096622) (← links)
- A new post-quantum multivariate polynomial public key encapsulation algorithm (Q2102772) (← links)
- Distinguishing attack on the NTRUCipher encryption scheme (Q2103761) (← links)
- Improved lattice enumeration algorithms by primal and dual reordering methods (Q2104429) (← links)
- Quantum key search for ternary LWE (Q2118530) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- An algebraic approach to the rank support learning problem (Q2118561) (← links)
- Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574) (← links)
- How to meet ternary LWE keys (Q2128581) (← links)
- A trace map attack against special ring-LWE samples (Q2128748) (← links)
- An extension of Kannan's embedding for solving ring-based LWE problems (Q2149793) (← links)
- How to find ternary LWE keys using locality sensitive hashing (Q2149799) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Towards quantum large-scale password guessing on real-world distributions (Q2149836) (← links)
