Advances in security research in the Asiacrypt region

Autor: Lynn Batten, Tzong-Chen Wu, Yu Yu, Henry B. Wolfe, Siu-Ming Yiu, Steven D. Galbraith, Bo-Yin Yang, Lucas Hui, Dingyi Pei, Mitsuru Matsui, Raphaël Cw Phan, Jian Guo, Ed Dawson, Duncan S. Wong, Huaxiong Wang, Dong Hoon Lee, Shiho Moriai, Kwangjo Kim, Xuejia Lai, Masayuki Abe, Duong Hieu Phan, Jianying Zhou, Tsutomu Matsumoto, Josef Pieprzyk, Jung Hee Cheon, Phong Q. Nguyen

Publikováno v: Communications of the ACM
Communications of the ACM, 2020, 63 (4), pp.76-81. ⟨10.1145/3378428⟩

International audience; Members of the International Association for Cryptologic Research explore regional work and collaboration activities.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::5983206cb9e2733055f03095aeb18d47
https://hal.science/hal-03540244

Computing a Lattice Basis Revisited

Autor: Phong Q. Nguyen, Jianwei Li

Publikováno v: ISSAC '19: International Symposium on Symbolic and Algebraic Computation
ISSAC '19: International Symposium on Symbolic and Algebraic Computation, Jul 2019, Beijing, China. pp.275-282, ⟨10.1145/3326229.3326265⟩
ISSAC

Given (a,b) \in \mZ^2, Euclid's algorithm outputs the generator \gcd(a,b) of the ideal a\mZ + b\mZ. Computing a lattice basis is a high-dimensional generalization: given \mathbfa _1,\dots,\veca _n \in \mZ^m, find a \mZ-basis of the lattice L=\ \sum_i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8b0bb16e9e5585dc5e113396010f2dbb
https://inria.hal.science/hal-03067825/file/Basis_algorithm2018-4.pdf

Information Security : 20th International Conference, ISC 2017, Ho Chi Minh City, Vietnam, November 22-24, 2017, Proceedings

Autor: Phong Q. Nguyen, Jianying Zhou

This book constitutes the refereed proceedings of the 20th International Conference on Information Security, ISC 2017, held in Ho Chi Minh City, Vietnam, in November 2017. The 25 revised full papers presented were carefully reviewed and selected fro

Lower Bounds on Lattice Enumeration with Extreme Pruning

Autor: Yoshinori Aono, Junji Shikata, Phong Q. Nguyen, Takenobu Seito

Publikováno v: Lecture Notes in Computer Science ISBN: 9783319968803
CRYPTO (2)
Lecture Notes in Computer Science
CRYPTO 2018, 38th Annual International Cryptology Conference
CRYPTO 2018, 38th Annual International Cryptology Conference, IACR, Aug 2018, Santa-Barbara, United States. ⟨10.1007/978-3-319-96881-0_21⟩

International audience; At Eurocrypt '10, Gama, Nguyen and Regev introduced lattice enumeration with extreme pruning: this algorithm is implemented in state-of-the-art lattice reduction software and used in challenge records. They showed that extreme

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7796468459a73915ee7a287603e0f5da
https://doi.org/10.1007/978-3-319-96881-0_21

Structural Lattice Reduction: Generalized Worst-Case to Average-Case Reductions and Homomorphic Cryptosystems

Autor: Nicolas Gama, Xiang Xie, Malika Izabachène, Phong Q. Nguyen

Publikováno v: Advances in Cryptology – EUROCRYPT 2016
Advances in Cryptology – EUROCRYPT 2016, pp.528-558, 2016, ⟨10.1007/978-3-662-49896-5_19⟩
Lecture Notes in Computer Science
35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Part II-EUROCRYPT 2016
35th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Part II-EUROCRYPT 2016, IACR, May 2016, Vienna, Austria. pp.528-558, ⟨10.1007/978-3-662-49896-5_19⟩
Advances in Cryptology – EUROCRYPT 2016 ISBN: 9783662498958
EUROCRYPT (2)

In lattice cryptography, worst-case to average-case reductions rely on two problems: Ajtai's SIS and Regev's LWE, which both refer to a very small class of random lattices related to the group $$G=\mathbb {Z}_q^n$$G=Zqn. We generalize worst-case to a

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3e2c20098ce986c3e0c79ef7bf55111f
https://hal.archives-ouvertes.fr/hal-02177632