Skip to main content
Springer Nature Link
Log in

A pseudorandom number generator based on worst-case lattice problems

  • Original Paper
  • Published:
Applicable Algebra in Engineering, Communication and Computing Aims and scope

Abstract

In this paper we construct a pseudorandom number generator using only worst-case hardness assumptions for standard lattice problems. With a common technique, we can then build a stream cipher by combining the generated pseudorandom sequence with the plaintext. Moreover, as an option to gain efficiency both in terms of speed and memory, we suggest the use of ideal lattices in the construction. Currently, there is no known attack that could exploit this choice. Our implementation for Graphics Processing Units leverages from the parallelism inherent in lattice schemes and reaches performances comparable to the fastest known constructions that enjoy security proofs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  1. Ajtai, M.: Generating hard instances of lattice problems. Electron. Colloq. Comput. Complex. (ECCC) 3(7), 99–108 (1996)

  2. Applebaum, B., Cash, D., Peikert, C., Sahai, A.: Fast cryptographic primitives and circular-secure encryption based on hard learning problems. In: Halevi, S. (ed.) CRYPTO, volume 5677 of Lecture Notes in Computer Science, pp. 595–618. Springer (2009)

  3. Bellare, M., Boldyreva, A., Kurosawa, K., Staddon, J.: Multirecipient encryption schemes: How to save on bandwidth and computation without sacrificing security. IEEE Trans. Inf. Theory 53(11), 3927–3943 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  4. Berbain, C., Gilbert, H., Patarin, J.: Quad: a multivariate stream cipher with provable security. J. Symb. Comput. 44(12), 1703–1723 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  5. Bernstein, D.J., Buchmann, J., Dahmen, E.: Post Quantum Cryptography. Springer Publishing Company, Incorporated, Berlin (2008)

    Google Scholar 

  6. Biham, E., Shamir, A.: Differential cryptanalysis of des-like cryptosystems. In: Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO ’90, pp. 2–21. Springer (1991)

  7. Biham, E., Shamir, A.: Differential cryptanalysis of the full 16-round des. In: Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO ’92, pp. 487–496. Springer (1993)

  8. Biswas, B., Sendrier, N.: Mceliece cryptosystem implementation: theory and practice. In: Buchmann, J., Ding, J. (eds.) PQCrypto, volume 5299 of Lecture Notes in Computer Science, pp. 47–62. Springer (2008)

  9. Brickell, E.F.: Solving low density knapsacks. In: Chaum, D. (ed.) Advances in Cryptology. Proceedings of CRYPTO ’83, Santa Barbara, California, USA, August 21–24, 1983, pp. 25–37. Plenum Press, New York (1983)

  10. Buchmann, J., Lindner, R.: Secure parameters for swifft. In: Roy, B.K., Sendrier, N. (eds.) INDOCRYPT, volume 5922 of Lecture Notes in Computer Science, pp. 1–17. Springer (2009)

  11. Cayrel, P., Meziani, M., Ndiaye, O., Santos, Q.: Efficient software implementations of code-based hash functions and stream-ciphers. In: Koç, Ç.K., Mesnager, S, Savas, E. (eds.) Arithmetic of Finite Fields, volume 9061 of Lecture Notes in Computer Science, pp. 187–203. Springer International Publishing (2015)

  12. Coster, M.J., Joux, A., LaMacchia, B.A., Odlyzko, A.M., Schnorr, C.-P., Stern, J.: Improved low-density subset sum algorithms. Comput. Complex. 2, 111–128 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  13. de Beer, R., van Ormondt, D., Di Cesare, F., Graveron-Demilly, D., Karras, DA, Starcuk, Z.: Accelerating batched 1D-FFT with a CUDA-capable computer. In: 2010 IEEE International Conference on Imaging Systems and Techniques (IST), pp. 446–451. IEEE (2010)

  14. Feistel, H.: Cryptography and computer privacy. Sci. Am. (1973)

  15. Gaborit, P., Lauradoux, C., Sendrier, N.: Synd: a fast code-based stream cipher with a security reduction. In: IEEE International Symposium on Information Theory, 2007. ISIT 2007, pp. 186 –190, 24–29 (2007)

  16. Gama, N., Nguyen, P.Q.: Predicting lattice reduction. In: Smart, N.P. (ed.) EUROCRYPT, volume 4965 of Lecture Notes in Computer Science, pp. 31–51. Springer (2008)

  17. Goldreich, O., Levin, L.A.: A hard-core predicate for all one-way functions. In: STOC 89 Proceedings of the twenty-first annual ACM, symposium on Theory of computing, pp. 25–32. ACM, New York, USA (1989)

  18. Golic, J.D.: Cryptanalysis of alleged a5 stream cipher. In: Proceedings of the 16th Annual International Conference on Theory and Application of Cryptographic Techniques, EUROCRYPT’97, pp. 239–255. Springer (1997)

  19. Hong, J., Sarkar, P.: Rediscovery of time memory tradeoffs. Cryptology ePrint Archive, Report 2005/090, (2005). http://eprint.iacr.org/

  20. Impagliazzo, R., Naor, M.: Efficient cryptographic schemes provably as secure as subset sum. J. Cryptol. 9(4), 199–216 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  21. Lyubashevsky, V., Micciancio, D.: Generalized compact knapsacks are collision resistant. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP (2), volume 4052 of Lecture Notes in Computer Science, pp. 144–155. Springer (2006)

  22. Lyubashevsky, V., Micciancio, D., Peikert, C., Rosen, A.: Swifft: a modest proposal for fft hashing. In: Nyberg, K. (ed.) FSE, volume 5086 of Lecture Notes in Computer Science, pp. 54–72. Springer (2008)

  23. Mei, C., Jiang, H., Jenness, J.: CUDA-based AES parallelization with fine-tuned GPU memory utilization. In: 2010 IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum (IPDPSW), pp. 1–7. IEEE (2010)

  24. Meziani, M., Hoffmann, G., Cayrel, P.-L.: Improving the performance of the SYND stream cipher. In: Mitrokotsa, A., Vaudenay, S. (eds.) AFRICACRYPT, volume 7374 of Lecture Notes in Computer Science, pp. 99–116. Springer (2012)

  25. Micciancio, D.: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions. Comput. Complex. 16(4):365–411 (2007)

  26. Micciancio, D., Regev, O.: Worst-case to average-case reductions based on gaussian measures. SIAM J. Comput. 37(1), 267–302 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  27. Muller, F.: Differential attacks and stream ciphers. In: The State of the Art of Stream Ciphers, Workshop Record, ECRYPT Network of Excellence in Cryptology, pp. 133–146 (2004)

  28. Naor, M., Reingold, O.: Synthesizers and their application to the parallel construction of pseudo-random functions. J. Comput. Syst. Sci. 58(2), 336–375 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  29. Peikert, C.: Public-key cryptosystems from the worst-case shortest vector problem: extended abstract. In: Mitzenmacher, M. (ed.) STOC 09 Proceedings of the forty-first annual ACM symposium on Theory of computing, pp. 333–342. ACM, New York, USA (2009)

  30. Peikert, C., Waters, B.: Lossy trapdoor functions and their applications. In: Ladner, R.E., Dwork, C. (eds.) STOC 08 Proceedings of the fortieth annual, ACM symposium on Theory of computing, pp. 187–196. ACM, New York, USA (2008)

  31. Regev, O.: On lattices, learning with errors, random linear codes, and cryptography. J. ACM 56(6), 84–93 (2009)

  32. Wagner, D.: A generalized birthday problem. In: Yung, M.(ed.) CRYPTO, volume 2442 of Lecture Notes in Computer Science, pp. 288–303. Springer (2002)

Download references

Author information

Authors and Affiliations

  1. Laboratoire Hubert Curien, UMR CNRS 5516, Bâtiment F 18 rue du Benoît Lauras, 42000, Saint-Étienne, France

    Pierre-Louis Cayrel

  2. CASED - Center for Advanced Security Research Darmstadt, Mornewegstrasse, 64293, Darmstadt, Germany

    Mohammed Meziani & Richard Lindner

  3. Université Cheikh Anta Diop de Dakar, FST, DMI, LACGAA, Dakar, Senegal

    Ousmane Ndiaye

  4. State University of Campinas (UNICAMP) Institute of Computing, P.O. Box 6176, Campinas, 13084-971, Brazil

    Rosemberg Silva

Authors
  1. Pierre-Louis Cayrel
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammed Meziani
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Ousmane Ndiaye
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Richard Lindner
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Rosemberg Silva
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ousmane Ndiaye.

Additional information

Pierre-Louis Cayrel: supported in part by NATO’s Public Diplomacy Division in the framework of “Science for Peace”, SPS Project 984520.

Mohammed Meziani and Ousmane Ndiaye: supported by the The Centre of Excellence in Mathematics, Computer Science and ICT (CEA-MITIC).

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Cayrel, PL., Meziani, M., Ndiaye, O. et al. A pseudorandom number generator based on worst-case lattice problems. AAECC 28, 283–294 (2017). https://doi.org/10.1007/s00200-017-0323-1

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00200-017-0323-1

Keywords