scientific article; zbMATH DE number 1186948
From MaRDI portal
Publication:3840170
Recommendations
Cited in
(only showing first 100 items - show all)- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Random small Hamming weight products with applications to cryptography
- Distribution of inverses in polynomial rings
- Shortest vector from lattice sieving: a few dimensions for free
- A non-commutative cryptosystem based on quaternion algebras
- Post-quantum key exchange for the Internet and the open quantum safe project
- A full RNS variant of FV like somewhat homomorphic encryption schemes
- Identity-based aggregate signcryption in the standard model from multilinear maps
- STP-LWE: A variant of learning with error for a flexible encryption
- Analysis of error-correcting codes for lattice-based key exchange
- Provably secure NTRUEncrypt over any cyclotomic field
- Quantum algorithm design: techniques and applications
- Second order statistical behavior of LLL and BKZ
- A public-key encryption scheme based on non-linear indeterminate equations
- NTRU prime: reducing attack surface at low cost
- Lattice Klepto -- turning post-quantum crypto against itself
- Bonsai trees, or how to delegate a lattice basis
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A framework for cryptographic problems from linear algebra
- Achievable upper bound for the sup-norm of the product of elements of the ring of truncated polynomials and its application to the analysis of NTRU-like cryptosystems
- An algebraic attack on rank metric code-based cryptosystems
- MPSign: a signature from small-secret middle-product learning with errors
- On the ideal shortest vector problem over random rational primes
- Shorter lattice-based zero-knowledge proofs via one-time commitments
- LWE from non-commutative group rings
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- 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
- Quantum key search for ternary LWE
- Implementation of lattice trapdoors on modules and applications
- An algebraic approach to the rank support learning problem
- 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
- 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
- Gadget-based iNTRU lattice trapdoors
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- The polynomial learning with errors problem and the smearing condition
- Algebraically structured LWE. Revisited
- 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
- D-NTRU: more efficient and average-case IND-CPA secure NTRU variant
- EPiC: efficient privacy-preserving counting for MapReduce
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- \(\mathrm{F}_4\)-invariant algorithm for computing SAGBI-Gröbner bases
- Identity based blind signature scheme over NTRU lattices
- Modular lattice signatures, revisited
- Worst-case to average-case reductions for module lattices
- Cryptanalysis of a noncommutative key exchange protocol
- NTRU
- Algebraic generalization of Diffie-Hellman key exchange
- A detailed analysis of the hybrid lattice-reduction and meet-in-the-middle attack
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- A wrap error attack against NTRUEncrypt
- Bootstrapping for helib
- On random nonsingular Hermite normal form
- When NTT meets Karatsuba: preprocess-then-NTT technique revisited
- Small leaks sink a great ship: an evaluation of key reuse resilience of PQC third round finalist NTRU-HRSS
- A novel identity-based multi-signature scheme over NTRU lattices
- Revisiting lower dimension lattice attacks on NTRU
- 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
- SLAP: simpler, improved private stream aggregation from ring learning with errors
- On the (M)iNTRU assumption in the integer case
- Optimizations for NTRU
- scientific article; zbMATH DE number 1722678 (Why is no real title available?)
- Finding shortest lattice vectors in the presence of gaps
- A multivariate encryption scheme with Rainbow
- Post-quantum cryptography: state of the art
- Parallel implementation of \textsf{BDD} enumeration for \textsf{LWE}
- The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
- Oblivious transfer from weakly random self-reducible public-key cryptosystem
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- High-performance ideal lattice-based cryptography on 8-bit ATxmega microcontrollers
- Efficient integer encoding for homomorphic encryption via ring isomorphisms
- On key recovery attacks against existing somewhat homomorphic encryption schemes
- Adaptive key recovery attacks on NTRU-based somewhat homomorphic encryption schemes
- A key recovery attack on MDPC with CCA security using decoding errors
- Choosing parameters for NTRUEncrypt
- Algorithms for the shortest and closest lattice vector problems
- Better key sizes (and attacks) for LWE-based encryption
- Homomorphic AES evaluation using the modified LTV scheme
- An efficient lattice reduction using reuse technique blockwisely on NTRU
- Multi-key FHE from LWE, revisited
- BI-NTRU encryption schemes: two new secure variants of NTRU
- A lattice attack on homomorphic NTRU with non-invertible public keys
- Integer Reconstruction Public-Key Encryption
- Towards faster cryptosystem. II
- Low-cost cryptography for privacy in RFID systems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3840170)
