The following pages link to (Q4364546):
Displaying 50 items.
- The 2010 Benjamin Franklin Medal in Computer and Cognitive Science presented to Shafrira Goldwasser, Ph.D. (Q398324) (← links)
- Analysis of decreasing squared-sum of Gram-Schmidt lengths for short lattice vectors (Q515394) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← 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)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials (Q887439) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Hardness of approximating the minimum solutions of linear Diophantine equations (Q1022600) (← links)
- A relation of primal--dual lattices and the complexity of shortest lattice vector problem (Q1274988) (← links)
- Reducing the elliptic curve cryptosystem of Meyer-Müller to the cryptosystem of Rabin-Williams (Q1379660) (← links)
- On the limits of nonapproximability of lattice problems (Q1577010) (← links)
- Lattice attacks against elliptic-curve signatures with blinded scalar multiplication (Q1698621) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- A public-key encryption scheme based on non-linear indeterminate equations (Q1746969) (← links)
- A lattice-based public-key cryptosystem (Q1854277) (← links)
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor (Q1861566) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Fault analysis of the NTRUSign digital signature scheme (Q1947651) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- On removing rejection conditions in practical lattice-based signatures (Q2118558) (← links)
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme (Q2168799) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- A signature scheme from the finite field isomorphism problem (Q2191202) (← links)
- Modular lattice signatures, revisited (Q2302153) (← links)
- Lattice-based revocable certificateless signature (Q2333434) (← links)
- A note on BDD problems with \(\lambda_2\)-gap (Q2350585) (← links)
- Post-quantum cryptography: lattice signatures (Q2390954) (← links)
- Public-key cryptography and invariant theory (Q2577586) (← links)
- Finding Shortest Lattice Vectors in the Presence of Gaps (Q2790044) (← links)
- Quantum walk public-key cryptographic system (Q2795341) (← links)
- Lattice-based identity-based resplittable threshold public key encryption scheme (Q2804886) (← links)
- A Fast Phase-based Enumeration Algorithm for SVP Challenge Through $$y$$-Sparse Representations of Short Lattice Vectors (Q2942829) (← links)
- Analysis of Error Terms of Signatures Based on Learning with Errors (Q2988339) (← links)
- Secure multi-source network coding scheme with lattice signature (Q2993817) (← links)
- Algorithms for the Shortest and Closest Lattice Vector Problems (Q3005588) (← links)
- Improvement of Lattice-Based Cryptography Using CRT (Q3064338) (← links)
- Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems (Q3408195) (← links)
- Explicit Hard Instances of the Shortest Vector Problem (Q3535352) (← links)
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures (Q3593101) (← links)
- Rigorous and Efficient Short Lattice Vectors Enumeration (Q3600387) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- The Complexity of Public-Key Cryptography (Q5021130) (← links)
- Cryptanalysis of ITRU (Q5025959) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- Efficient Nyberg-Rueppel type of NTRU digital signature algorithm (Q5101024) (← links)
