scientific article; zbMATH DE number 1088230
From MaRDI portal
Publication:4364546
Recommendations
- scientific article; zbMATH DE number 1643920
- Lattice reductions over Euclidean rings with applications to cryptanalysis
- scientific article; zbMATH DE number 2156419
- A lattice-based public-key cryptosystem
- scientific article; zbMATH DE number 1304121
- Efficient public key encryption based on ideal lattices (extended abstract)
- Lattice reduction: a toolbox for the cryptoanalyst
- Cryptographic protocols from lattices (abstract)
- scientific article; zbMATH DE number 1866880
- Multi-bit Cryptosystems Based on Lattice Problems
Cited in
(95)- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures
- Hardness of approximating the minimum solutions of linear Diophantine equations
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams
- On the limits of nonapproximability of lattice problems
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures
- Public key compression for constrained linear signature schemes
- A public-key encryption scheme based on non-linear indeterminate equations
- A lattice-based public-key cryptosystem
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- Bonsai trees, or how to delegate a lattice basis
- Fault analysis of the NTRUSign digital signature scheme
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
- On removing rejection conditions in practical lattice-based signatures
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}
- A signature scheme from the finite field isomorphism problem
- Modular lattice signatures, revisited
- Lattice-based revocable certificateless signature
- A note on BDD problems with _2-gap
- Post-quantum cryptography: lattice signatures
- Public-key cryptography and invariant theory
- Finding shortest lattice vectors in the presence of gaps
- Quantum walk public-key cryptographic system
- Lattice-based identity-based resplittable threshold public key encryption scheme
- A fast phase-based enumeration algorithm for SVP challenge through \(y\)-sparse representations of short lattice vectors
- Analysis of error terms of signatures based on learning with errors
- Secure multi-source network coding scheme with lattice signature
- Algorithms for the shortest and closest lattice vector problems
- Improvement of lattice-based cryptography using CRT
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
- Explicit Hard Instances of the Shortest Vector Problem
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- Rigorous and Efficient Short Lattice Vectors Enumeration
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D.
- A Lattice Based Public Key Cryptosystem Using Polynomial Representations
- scientific article; zbMATH DE number 2063208 (Why is no real title available?)
- Multikey fully homomorphic encryption and applications
- scientific article; zbMATH DE number 2085214 (Why is no real title available?)
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- scientific article; zbMATH DE number 1852142 (Why is no real title available?)
- scientific article; zbMATH DE number 1424176 (Why is no real title available?)
- The Complexity of Public-Key Cryptography
- Cryptanalysis of ITRU
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm
- On the smallest-basis problem underlying the GGH lattice-based cryptosystem
- scientific article; zbMATH DE number 7312512 (Why is no real title available?)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors
- scientific article; zbMATH DE number 7407285 (Why is no real title available?)
- Public-key cryptosystems from the worst-case shortest vector problem
- Deciding orthogonality in construction-A lattices
- Generating shorter bases for hard random lattices
- A Digital Signature Scheme Based on CVP ∞
- Predicting Lattice Reduction
- Cryptography Based on Quadratic Forms: Complexity Considerations
- Learning strikes again: the case of the DRS signature scheme
- Improvements in the analysis of Kannan's CVP algorithm
- Sieve algorithms for some orthogonal integer lattices
- On the hardness of the finite field isomorphism problem
- The Efficiency of Embedding-Based Attacks on the GGH Lattice-Based Cryptosystem
- Lattice-based cryptography: a survey
- Compact lattice gadget and its applications to hash-and-sign signatures
- Cryptanalysis of the GGH cryptosystem
- Lattice polly cracker cryptosystems
- Do Not Bound to a Single Position: Near-Optimal Multi-positional Mismatch Attacks Against Kyber and Saber
- Public-key cryptosystems and signature schemes from \(p\)-adic lattices
- Theoretical and empirical analysis of FALCON and SOLMAE using their Python implementation
- \textsc{Antrag}: annular NTRU trapdoor generation. Making \textsc{Mitaka} as secure as FALCON
- Constrained inhomogeneous spherical equations: average-case hardness
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- A probability inequality with application to lattice theory
- On the high dimensional RSA algorithm -- a public key cryptosystem based on lattice and algebraic number theory
- Profiling side-channel attacks on Dilithium. A small bit-fiddling leak breaks it all
- Cryptanalysis of the \textsc{Peregrine} lattice-based signature scheme
- Towards compact identity-based encryption on ideal lattices
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- FuLeakage: breaking FuLeeca by learning attacks
- Crowhammer: full key recovery attack on \textsc{Falcon} with a single Rowhammer bit flip
- Complexity of robust orbit problems for torus actions and the abc-conjecture
- Post-quantum online/offline signatures
- Norm orthogonal bases and invariants of p-adic lattices
- An attack on p-adic lattice public-key encryption cryptosystems and signature schemes
- One bit to rule them all -- imperfect randomness harms lattice signatures
- Exploiting the symmetry of \(\mathbb{Z}^n\): randomization and the automorphism problem
- Current paradigms for construction of lattice-based digital signature schemes
- An experimental comparison of some LLL-type lattice basis reduction algorithms
- Generating \textsc{Falcon} trapdoors via Gibbs sampler
- One (noisy) bit to rule them all: key recovery from randomness leakage in ML-DSA
- Diagonally dominant matrices for cryptography
- SoK: how (not) to design and implement post-quantum cryptography
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
- Gaussian sampling of lattices for cryptographic applications
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 Q4364546)
