© The Institution of Engineering and Technology
Lattice problems are considered as the key elements in many areas of computer science as well as in cryptography; the most important of which is the shortest vector problem and its approximate variants. Algorithms for this problem are known as lattice reduction algorithms. Currently, the most practical lattice reduction algorithm for such problems is the block Korkine–Zolotarev (BKZ) algorithm and its variants. The authors optimise both the pruning and the preprocessing parameters of the recursive (aborted, extreme pruned) preprocessing of the BKZ lattice reduction algorithm and improve the results from Asiacrypt'11 by Chen and Nguyen. The authors derive approximate closedform complexity formulas (based on the sandpile model assumption model by Hanrot et al.) for the enumeration time which allow a simple estimation of complexity without running the simulation algorithm (by Chen and Nguyen) and asymptotically suggests a modified extreme pruning bounding profiles with different parameters. Hence, the authors’ contributions are in optimising and improving the analysis of the complexity upper bound estimates presented by Chen and Nguyen, based on the same recursiveBKZ preprocessing model.
References


1)

1. Regev, O.: ‘On lattices, learning with errors, random linear codes, and cryptography’, JACM, 2009, 56, 6, pp. 34:1–34:40.

2)

2. Gentry, C.: ‘Fully homomorphic encryption using ideal lattices’. STOC'09, 2009, pp. 169–178.

3)

3. Lyubashevsky, V., Micciancio, D., Peikert, C., et al: ‘SWIFFT: a modest proposal for FFT hashing’. Fast Software Encryption (FSE) 2008, 2008 (, 5086, pp. 54–72.

4)

4. Lenstra, A.K., Lenstra, H.W., Lovász, L.: ‘Factoring polynomials with rational coefficients’, Math. Ann., 1982, 261, (4), pp. 515–534.

5)

5. Schnorr, C.P.: ‘A hierarchy of polynomial time lattice basis reduction algorithms’, Theor. Comput. Sci., 1987, 53, (2–3), pp. 201–224.

6)

6. Schnorr, C.P., Euchner, M.: ‘Lattice basis reduction: improved practical algorithms and solving subset sum problems’, Math. Program., 1994, 66, pp. 181–199.

7)

7. Ajtai, M., Kumar, R., Sivakumar, D.: ‘A sieve algorithm for the shortest lattice vector problem’. Proc. of 33rd ACM Symp. on Theory of Computing (STOC), 2001, pp. 601–610.

8)

8. Chen, Y., Nguyen, P.Q.: ‘BKZ 2.0: better lattice security estimate’. ASIACRYPT'11, 2011 (, 7073), pp. 1–20.

9)

9. Schnorr, C.P.: ‘Lattice reduction by random sampling and birthday methods’. STACS'03, 2003, vol. 2607, pp. 145–156.

10)

10. Hanrot, G., Pujol, X., Stehlé, D.: ‘Analyzing blockwise lattice algorithms using dynamical systems’. CRYPTO'11, 2011 (, 6841), pp. 447–464.

11)

11. Gama, N., Nguyen, P.Q., Regev, O.: ‘Lattice enumeration using extreme pruning’. EUROCRYPT, 2010, 2010, pp. 257–278.

12)

12. Hanrot, G., Stehlé, D.: ‘Improved analysis of Kannan's shortest lattice vector algorithm (extended abstract)’. Crypto'07, 2007, vol. 4622, pp. 170–186.

13)

13. Shoup, V.: ‘NTL: A library for doing number theory’. .

14)

14. Haque, M.M.: ‘Latticebased cryptanalysis for secure cryptosystems’. , Macquarie University, 2013.
http://iet.metastore.ingenta.com/content/journals/10.1049/ietifs.2016.0049
Related content
content/journals/10.1049/ietifs.2016.0049
pub_keyword,iet_inspecKeyword,pub_concept
6
6