Abstract
In recent years, lattice-based cryptosystems have attracted widespread attention due to the increased prevalence of cloud computing and the big data background. Among such cryptosystems, the GGH cryptosystem is an important, practice-oriented system. In addition, the concept behind this cryptosystem continues to be used in fully homomorphic encryptions and other cutting-edge designs for cryptographic applications. This paper considers the security of the GGH cryptosystem and provides a further analysis of its broadcast attacks presented by Plantard et al. in 2009. Concretely, we first correct a doubtable step in their attack, which Plantard et al. did not describe in a rigorous way; subsequently, the number of instances required in a successful attack is given and is used to explain the success of their attacks. Moreover, this paper presents a new attack algorithm via a CVP solver, which rectifies the original attack that has not been proven. Our conclusions are of theoretical and practical significance to the analysis and the design of new cryptosystems in the big data context.
This work was supported by National Natural Science Foundation of China (GrantNo. 61133013,61272091), China’s 973 Program(GrantNo. 2013CB834205) and Nature Science Foundation of Shandong Province (GrantNo. ZR2012FM005).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Babai, L.: On Lovászlattice reduction and the nearest lattice point problem. Combinatorica 6(1), 1–13 (1986)
Bi, J., Cheng, Q.: Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices. Cryptology ePrint Archive, Report 2011/153 (2011). http://eprint.iacr.org/
Ding, J., Pan, Y., Deng, Y.: An algebraic broadcast attack against NTRU. In: Susilo, W., Mu, Y., Seberry, J. (eds.) ACISP 2012. LNCS, vol. 7372, pp. 124–137. Springer, Heidelberg (2012)
Fernández, J.L., Fernández, P.: On the probability distribution of the gcd, lcm of \(r\)-tuples of integers (2013). arXiv preprint arXiv:1305.0536
Garg, S., Gentry, C., Halevi, S.: Candidate multilinear maps from ideal lattices. In: Johansson, T., Nguyen, P.Q. (eds.) EUROCRYPT 2013. LNCS, vol. 7881, pp. 1–17. Springer, Heidelberg (2013)
Gentry, C.: A fully homomorphic encryption scheme. Ph.D. thesis, Stanford University (2009)
Gentry, C., Peikert, C., Vaikuntanathan, V.: Trapdoors for hard lattices and new cryptographic constructions. In: Proceedings of the Fortieth Annual ACM Symposium on Theory of Computing, pp. 197–206. ACM (2008)
Goldreich, O., Goldwasser, S., Halevi, S.: Public-key cryptosystems from lattice reduction problems. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 112–131. Springer, Heidelberg (1997)
Hastad, J.: Solving simultaneous modular equations of low degree. SIAM J. Comput. 17(2), 336–341 (1988)
Girko, V.L.: Theory of Random Determinants. Springer, Dordrecht (1990)
Lee, M.S., Hahn, S.G.: Cryptanalysis of the GGH cryptosystem. Math. Comput. Sci. 3(2), 201–208 (2010)
Li, J., Pan, Y., Liu, M., Zhu, G.: An efficient broadcast attack against NTRU. In: 7th ACM Symposium on Information, Compuer and Communications Security, ASIACCS 2012, Seoul, Korea, May 2–4, pp. 22–23 (2012)
Liu, M., Nguyen, P.Q.: Solving BDD by enumeration: an update. In: Dawson, E. (ed.) CT-RSA 2013. LNCS, vol. 7779, pp. 293–309. Springer, Heidelberg (2013)
Liu, Y.-K., Lyubashevsky, V., Micciancio, D.: On bounded distance decoding for general lattices. In: Díaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX 2006 and RANDOM 2006. LNCS, vol. 4110, pp. 450–461. Springer, Heidelberg (2006)
Lyubashevsky, V.: SIS and worst-case to average-case reductions. Bar-Ilan University, Israel (2012). http://www.di.ens.fr/lyubash/talks/SISWtoAv.pdf
McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep. 42(44), 114–116 (1978)
Micciancio, D., CSE206A: Lattices algorithms and applications, (Spring 2014). http://cseweb.ucsd.edu/classes/sp14/cse206A-a/index.html
Micciancio, D., Goldwasser, S.: Complexity of Lattice Problems: A Cryptographic Perspective. The Kluwer International Series in Engineering and Computer Science, vol. 671. Kluwer Academic Publishers, Boston, Massachusetts (2002)
Nguyên, P.Q.: Cryptanalysis of the goldreich-goldwasser-halevi cryptosystem from Crypto’97. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol. 1666, pp. 288–304. Springer, Heidelberg (1999)
Nguyen, P.Q., Valle, B.: The LLL Algorithm: Survey and Applications, 1st edn. Springer Publishing Company, Incorporated, Heidelberg (2009)
Pan, Y., Deng, Y.: A broadcast attack against NTRU using ding’s algorithm. IACR Cryptology ePrint Archive 2010, 598 (2010)
Plantard, T., Susilo, W.: Broadcast attacks against lattice-based cryptosystems. In: Abdalla, M., Pointcheval, D., Fouque, P.-A., Vergnaud, D. (eds.) ACNS 2009. LNCS, vol. 5536, pp. 456–472. Springer, Heidelberg (2009)
Nguyen, P.Q., Stern, J.: Adapting density attacks to low-weight knapsacks. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788. Springer, Heidelberg (2005). doi:10.1007/11593447_3
Jun, X., Lei, H., Sun, S.: Cryptanalysis of two cryptosystems based on multiple intractability assumptions. IET Commun. 8(14), 2433–2437 (2014)
Jun, X., Lei, H., Sun, S., Xie, Y.: Cryptanalysis of countermeasures against multiple transmission attacks on NTRU. IET Commun. 8(12), 2142–2146 (2014)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Wang, M. (2016). An Improved Analysis of Broadcast Attacks on the GGH Cryptosystem. In: Kim, Hw., Choi, D. (eds) Information Security Applications. WISA 2015. Lecture Notes in Computer Science(), vol 9503. Springer, Cham. https://doi.org/10.1007/978-3-319-31875-2_13
Download citation
DOI: https://doi.org/10.1007/978-3-319-31875-2_13
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31874-5
Online ISBN: 978-3-319-31875-2
eBook Packages: Computer ScienceComputer Science (R0)