Learning Strikes Again: The Case of the DRS Signature Scheme

[1]  Vadim Lyubashevsky,et al.  Lattice Signatures Without Trapdoors , 2012, IACR Cryptol. ePrint Arch..

[2]  Daniele Micciancio,et al.  Faster exponential time algorithms for the shortest vector problem , 2010, SODA '10.

[3]  Chris Peikert,et al.  An Efficient and Parallel Gaussian Sampler for Lattices , 2010, CRYPTO.

[4]  Phong Q. Nguyen,et al.  BKZ 2.0: Better Lattice Security Estimates , 2011, ASIACRYPT.

[5]  Yang Yu,et al.  Learning Strikes Again: The Case of the DRS Signature Scheme , 2020, Journal of Cryptology.

[6]  Léo Ducas,et al.  Shortest Vector from Lattice Sieving: a Few Dimensions for Free , 2018, IACR Cryptol. ePrint Arch..

[7]  Yoshinori Aono,et al.  Random Sampling Revisited: Lattice Enumeration with Discrete Pruning , 2017, IACR Cryptol. ePrint Arch..

[8]  Vadim Lyubashevsky,et al.  Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures , 2009, ASIACRYPT.

[9]  Martin R. Albrecht.  On Dual Lattice Attacks Against Small-Secret LWE and Parameter Choices in HElib and SEAL , 2017, EUROCRYPT.

[10]  Kenji Kashiwabara,et al.  Fast Lattice Basis Reduction Suitable for Massive Parallelization and Its Application to the Shortest Vector Problem , 2018, Public Key Cryptography.

[11]  Yupu Hu,et al.  NTRUSign With a New Perturbation , 2008, IEEE Transactions on Information Theory.

[12]  Léo Ducas,et al.  Learning a Zonotope and More: Cryptanalysis of NTRUSign Countermeasures , 2012, ASIACRYPT.

[13]  Thomas Plantard,et al.  A Digital Signature Scheme Based on CVPinfinity , 2008, Public Key Cryptography.

[14]  Fernando Virdia,et al.  Revisiting the Expected Cost of Solving uSVP and Applications to LWE , 2017, ASIACRYPT.

[15]  Martin R. Albrecht,et al.  On the concrete hardness of Learning with Errors , 2015, J. Math. Cryptol..

[16]  Renzhang Liu,et al.  Cryptanalysis of the Randomized Version of a Lattice-Based Signature Scheme from PKC'08 , 2018, ACISP.

[17]  Martin R. Albrecht,et al.  The General Sieve Kernel and New Records in Lattice Reduction , 2019, IACR Cryptol. ePrint Arch..

[18]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[19]  Claus-Peter Schnorr,et al.  Lattice basis reduction: Improved practical algorithms and solving subset sum problems , 1991, FCT.

[20]  Phong Q. Nguyen,et al.  Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures , 2006, EUROCRYPT.

[21]  Nicolas Gama,et al.  Predicting Lattice Reduction , 2008, EUROCRYPT.

[22]  Thomas Plantard,et al.  Improving the Security of the DRS Scheme with Uniformly Chosen Random Noise , 2019, ACISP.

[23]  Yang Yu,et al.  Second Order Statistical Behavior of LLL and BKZ , 2017, SAC.

[24]  Ron Steinfeld,et al.  Improved Security Proofs in Lattice-Based Cryptography: Using the Rényi Divergence Rather than the Statistical Distance , 2015, Journal of Cryptology.

[25]  Léo Ducas,et al.  Lattice Signatures and Bimodal Gaussians , 2013, IACR Cryptol. ePrint Arch..

[26]  Damien Stehlé,et al.  Analyzing Blockwise Lattice Algorithms Using Dynamical Systems , 2011, CRYPTO.