Lenstra

Results: 153



#Item
71DOI: [removed]auom[removed]An. S ¸ t. Univ. Ovidius Constant ¸a  Vol. 22(2),2014, 79–90

DOI: [removed]auom[removed]An. S ¸ t. Univ. Ovidius Constant ¸a Vol. 22(2),2014, 79–90

Add to Reading List

Source URL: www.anstuocmath.ro

Language: English - Date: 2014-04-14 09:34:04
72On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem has

On the concrete hardness of Learning with Errors Martin R. Albrecht1 , Rachel Player1 , and Sam Scott1 Information Security Group, Royal Holloway, University of London Abstract. The Learning with Errors (LWE) problem has

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-19 12:06:15
73Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR Tancrède Lepoint1 and Mehdi Tibouchi2 2  1

Cryptanalysis of a (Somewhat) Additively Homomorphic Encryption Scheme Used in PIR Tancrède Lepoint1 and Mehdi Tibouchi2 2 1

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-09 03:49:32
74Non-Abelian Analogs of Lattice Rounding Evgeni Begelfor Department of Computer Science The Hebrew University of Jerusalem [removed] Stephen D. Miller∗

Non-Abelian Analogs of Lattice Rounding Evgeni Begelfor Department of Computer Science The Hebrew University of Jerusalem [removed] Stephen D. Miller∗

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2015-01-11 23:40:13
75LATTICES WITH SYMMETRY H. W. LENSTRA, JR. AND A. SILVERBERG Abstract. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough s

LATTICES WITH SYMMETRY H. W. LENSTRA, JR. AND A. SILVERBERG Abstract. For large ranks, there is no good algorithm that decides whether a given lattice has an orthonormal basis. But when the lattice is given with enough s

Add to Reading List

Source URL: eprint.iacr.org

Language: English - Date: 2014-12-31 12:23:03
76BKZ 2.0: Better Lattice Security Estimates Yuanmi Chen and Phong Q. Nguyen 1 2

BKZ 2.0: Better Lattice Security Estimates Yuanmi Chen and Phong Q. Nguyen 1 2

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2014-01-05 23:20:01
77Lattice Enumeration using Extreme Pruning Nicolas Gama1 , Phong Q. Nguyen2 , and Oded Regev3 1 GREYC and ENSICAEN, France. INRIA and ENS, France. http://www.di.ens.fr/~pnguyen/.

Lattice Enumeration using Extreme Pruning Nicolas Gama1 , Phong Q. Nguyen2 , and Oded Regev3 1 GREYC and ENSICAEN, France. INRIA and ENS, France. http://www.di.ens.fr/~pnguyen/.

Add to Reading List

Source URL: www.iacr.org

Language: English - Date: 2012-07-19 15:34:39
78Mathematical routines for the NIST prime elliptic curves April 05, 2010  Contents

Mathematical routines for the NIST prime elliptic curves April 05, 2010 Contents

Add to Reading List

Source URL: www.nsa.gov

Language: English - Date: 2010-11-08 09:26:06
79Cryptographic Hash Workshop

Cryptographic Hash Workshop

Add to Reading List

Source URL: csrc.nist.gov

Language: English - Date: 2012-06-20 09:48:14
80	  
     !

     ! "

Add to Reading List

Source URL: www.ctc.gov.kw

Language: English - Date: 2014-07-17 03:44:40