71![DOI: [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](https://www.pdfsearch.io/img/6ff748c4e4f071182f5b666c6df7ab3f.jpg) | Add to Reading ListSource URL: www.anstuocmath.roLanguage: English - Date: 2014-04-14 09:34:04
|
---|
72![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 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](https://www.pdfsearch.io/img/0b3aaf2bbab847e31f54f68b4e4da3ae.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-19 12:06:15
|
---|
73![Cryptanalysis 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](https://www.pdfsearch.io/img/b9064cb6e732b501b3a66e76107d96c5.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-09 03:49:32
|
---|
74![Non-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∗](https://www.pdfsearch.io/img/6156a3037694b9f9c914fd3546d02dd2.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2015-01-11 23:40:13
|
---|
75![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 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](https://www.pdfsearch.io/img/a9af8f72d7f1758a945933c103cf32ad.jpg) | Add to Reading ListSource URL: eprint.iacr.orgLanguage: English - Date: 2014-12-31 12:23:03
|
---|
76![BKZ 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](https://www.pdfsearch.io/img/53047b77e4ef0504129a4d4ace1078de.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2014-01-05 23:20:01
|
---|
77![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/. 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/.](https://www.pdfsearch.io/img/8e5503b15b40b7dfd2b6231d4ef2a140.jpg) | Add to Reading ListSource URL: www.iacr.orgLanguage: English - Date: 2012-07-19 15:34:39
|
---|
78![Mathematical routines for the NIST prime elliptic curves April 05, 2010
Contents Mathematical routines for the NIST prime elliptic curves April 05, 2010
Contents](https://www.pdfsearch.io/img/e02cda35a6a3afbd71865d24d176e34b.jpg) | Add to Reading ListSource URL: www.nsa.govLanguage: English - Date: 2010-11-08 09:26:06
|
---|
79![Cryptographic Hash Workshop Cryptographic Hash Workshop](https://www.pdfsearch.io/img/813b32defd10599289b6c7bb9c5278dc.jpg) | Add to Reading ListSource URL: csrc.nist.govLanguage: English - Date: 2012-06-20 09:48:14
|
---|
80![
!
!](https://www.pdfsearch.io/img/acae472a29659c358ccc2c22968e2ee5.jpg) | Add to Reading ListSource URL: www.ctc.gov.kwLanguage: English - Date: 2014-07-17 03:44:40
|
---|