Abstract
This chapter covers stream ciphers with security proofs with a special focus on the Blum-Blum-Shub generator the most important cipher of that type. We will learn what security proofs are, what they can do for us and what they can’t do for us.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Aciiçmetz, O., Koç, Ç.K., Seifert, J.P.: Predicting secret keys via branch prediction. In: Abe, M. (ed.) CT-RSA. LNCS, vol. 4377, pp. 225–242 (2007)
Agrawal, M., Kayal, N., Saxena, N.: PRIMES is in P. Ann. Math. 2, 781–793 (2002)
Alexi, W., Chor, B., Goldreich, O., Schnorr, C.P.: RSA and Rabin functions: certain parts are as hard as the whole. SIAM J. Comput. 17, 194–200 (1988)
Atkin, A.O.L., Bernstein, D.J.: Prime sieves using binary quadratic forms. Math. Comput. 73, 1023–1030 (2004)
Berbain, C., Gilbert, H., Patarin, J.: Quad: a practical stream cipher with provable security. In: Vaudenay, S. (ed.) EUROCRYPT. Lecture Notes in Computer Science, vol. 4004, pp. 109–128. Springer, Berlin (2006)
Blum, L., Blum, M., Shub, M.: A simple unpredictable pseudorandom number generator. SIAM J. Comput. 15(2), 364–383 (1986)
Blum, M., Micali, S.: How to generate cryptographically strong sequences of pseudo-random bits. SIAM J. Comput. 13, 850–864 (1984)
Cook, S.A.: On the minimum computation time of functions. PhD thesis, Harvard University (1966)
Fisher, J.B., Stern, J.: An efficient pseudo-random generator provably as secure as syndrome decoding. In: Advances in Cryptology—EUROCRYPT ’96. LNCS, vol. 1070, pp. 245–255 (1996)
Friedlander, J.B., Pomerance, C., Shparlinski, I.E.: Period of the power generator and small values of the Carmicael’s function. Math. Comput. 70, 1591–1605 (2001)
von zur Gathen, J., Gerhard, J.: Modern Computer Algebra. Cambridge University Press, Cambridge (1999)
von zur Gathen, J., Shparlinski, I.: Predicting subset sum pseudorandom generators. In: Selected Areas in Cryptography. LNCS, vol. 3357, pp. 241–251. Springer, Berlin (2005)
The GNU Multiple Precision Arithmetic Library. http://gmplib.org/
Hinek, M.J.: Cryptanalysis of RSA and its variants. In: Cryptography and Network Security. CRC Press, Boca Raton (2010)
Joux, A.: Algorithmic Cryptanalysis. CRC Press, Boca Raton (2009)
Karatsuba, A., Ofman, Yu.: Multiplication of multidigit numbers on automata. Sov. Phys. Dokl. 7, 595–596 (1963). Original in: Dokl. Akad. Nauk SSSR 145, 293–394 (1963)
Knuth, D.E.: The Art of Computer Programming, vol. 2. Seminumerical Algorithms, 3rd edn. Addison-Wesley, Reading (1998)
Koblitz, N., Menezes, A.: Another look at “provable security”. Journal of Cryptology 20 (2004). See also Cryptology ePrint Archive, Report 2004/152 http://eprint.iacr.org/
Koç, Ç.K. (ed.): Cryptographic Engineering Springer, Berlin (2009)
Kocher, P.: Timing attacks on implementations of Diffi-Hellman, RSA, DSS and other systems. In: Kobliz, M. (ed.) CRYPTO ’96. LNCS, vol. 1109, pp. 104–113 (1996)
Maurer, U., Massey, J.L.: Perfect local randomness in pseudo-random sequences. J. Cryptol. 4, 135–149 (1993)
May, A.: Using LLL-Reduction for solving RSA and Factorization Problems: A Survey. Available online http://citeseerx.ist.edu/viewdoc/summary?doi=10.1.1.86.9908
Merkel, R.C., Hellman, M.E.: Hiding information and signatures in trapdoor knapsack. IEEE Trans. Inf. Theory IT-24(5), 525–530 (1978)
Miller, G.L.: Riemann’s hypothesis and tests for primality. J. Comput. Syst. Sci. 13, 300–317 (1976)
Montgomery, P.L.: Modular multiplication without trial division. Math. Commun. 44, 519–521 (1985)
Montgomery, P.L.: A survey of modern integer factoring algorithms. Quart. - Cent. Wiskd. Inform. 7, 337–366 (1994)
Odlyzko, A.M.: The rise and fall of the knapsack cryptosystem. In: Pomerance, C. (ed.) Cryptology and Computational Number Theory. Proceeding of Symposia in Applied Mathematics, vol. 42, pp. 75–88. American Mathematical Society, Providence (1990)
The openSSL library. http://www.openssl.org
Parker, M.G., Kemp, A.H., Shepherd, S.J.: Fast Blum-Blum-Shub sequence generation using Montgomery multiplication. IEEE Proc. Comput. Digit. Techn. 147, 252–254 (2000)
Patarin, J.: Hidden field equations (HFE) and isomorphisms of polynomials (IP): two new families of asymmetric algorithms. In: Eurocrypt ’96, pp. 33–48. Springer, Berlin (1996). An extended version can be found at http://www.minrank.org/courtois/hfe.ps
Peikari, C., Chuvakin, A.: Security Warrior. O’Reilly (2004)
Pritchard, P.: A sublinear additive sieve for finding prime numbers. Commun. ACM 24(1), 18–23 (1981)
Rabin, M.O.: Probabilistic algorithms for testing primality. J. Number Theory 12, 128–138 (1980)
Rivest, R.L., Silverman, R.D.: Are ‘strong’ primes needed for RSA? Technical report, The RSA Laboratories Seminar Series (1997)
Rueppel, R.A., Massey, J.L.: Knapsack as nonlinear function. In: IEEE Intern. Symp. of Inform. Theory. IEEE Press, New York (1985)
Schönhage, A., Strassen, V.: Schnelle Multiplikation großer Zahlen. Computing 7, 281–292 (1971)
Shamir, A.: On the generation of cryptographically strong pseudo-random sequences. In: 8th International Colloquium on Automata Languages and Programming. LNCS, vol. 62 (1981)
Shamir, A., Kipnis, A.: Cryptanalysis of the HFE public key cryptosystem. In: CRYPTO ’99 (1990). Available online http://www.minrank.org/courtois/hfesubreg.ps
Shamir, A., Zippel, R.E.: On the security of the Merkel-Hellman cryptographic scheme. IEEE Trans. Inf. Theory IT-26(3), 339–340 (1980)
Shparlinski, I.: Cryptographic Applications of Analytic Number Theory: Complexity, Lower Bounds and Pseudorandomness. Progress in Computer Science and Applied Logic. Birkhäuser, Basel (2003)
Sidorenko, A., Schoenmakers, B.: Concrete security of the Blum-Blum-Shub pseudorandom generator. In: Smart, N.P. (ed.) Cryptography and Coding 2005. LNCS, vol. 3796, pp. 355–375. Springer, Berlin (2005)
Silverman, R.D.: Fast generation of random, strong RSA primes. Technical report, RSA CrypoBytes, volume 3, No 2, 1997. Available online http://www.rsa.com/rsalabs/node.asp?id-2149
Solovay, R., Strassen, V.: A fast Monte Carlo test for primality. SIAM J. Comput. 6, 84–85 (1977)
Stern, J.: A method for finding codewords of small weight. In: Cohen, G.D., Wolfmann, J. (eds.) Coding Theory and Applications. Lecture Notes in Computer Science, vol. 388, pp. 106–113. Springer, Berlin (1989)
Toom, A.L.: The complexity of a scheme of functional elements realising the multiplication of integers. J. Sov. Math. 3, 714–716 (1963). Original in: Dokl. Akad. Nauk SSSR 150, 496–498 (1963)
Vazirani, U., Vazirani, V.: Efficient and secure pseudorandom number generation. In: Proceedings of the 25th Annual Symposium on the Foundations of Computer Science, pp. 458–463. IEEE Press, New York (1984)
Yang, B.Y., Chen, O.C.H., Bernstein, D.J., Chen, J.M.: Analysis of QUAD. In: Biryukov, A. (ed.) Fast Software Encryption: 14th International Workshop, FSE 2007. Lecture Notes in Computer Science, vol. 4593, pp. 290–308. Springer, Berlin (2007)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag London
About this chapter
Cite this chapter
Klein, A. (2013). The Blum-Blum-Shub Generator and Related Ciphers. In: Stream Ciphers. Springer, London. https://doi.org/10.1007/978-1-4471-5079-4_11
Download citation
DOI: https://doi.org/10.1007/978-1-4471-5079-4_11
Publisher Name: Springer, London
Print ISBN: 978-1-4471-5078-7
Online ISBN: 978-1-4471-5079-4
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)