Probabilistic and statistical methods in cryptology an introduction by selected topics

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3028, Issue , 2004, Pages

  Neuenschwander, Daniel ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33645597409     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (68)

1. 1 (2003). PRIMES is in P. Manuscript Department of Computer Science and Engineering, Indian Institute of Technology Kanpur. Available on the Internet under www.cse.iitk.ac.in/news/ prlmality.html.
2. Aldous, D., Shields, P. (1988). A Diffusion Limit for a Class of Randomly Growing Binary Trees. Prob. Theory Rel. Fields 79, 509-542.
3. Banks, D., Dray, J., Leigh, S., Levenson, M., Nechvatal, J., Rukhin, A. L., Smid, M., Soto, J., Vangel, M., Vo, S. (2000). A Statistical Test Suite for the Validation of Cryptographic Random Number Generators. Special NIST Publication, NIST, Gaithersburg MD.
4. Barbour, A. D., HoIst, L., Janson, S. (1992). Poisson Approximation. Clarendon Press, Oxford.
5. Baron, M., Rukhin, A. L. (1999). Distribution of the Number of Visits of a Random Walk. Comm. Statist. - Stochastic Models 15(3), 593-597.
6. Barton, D. E., David, F. N. (1962). Combinatorial Chance. Hafner, New York.
7. Bernstein, D. (2002). An Exposition of the Agrawal-Kayal-Saxena Primality-Proving Theorem. Manuscript. Available on the Internet under cr.yp.to/papers.html#aks.
8. Beth, T., Dai, Z.-D. (1990). On the Complexity of Pseudo-Random Sequences or: If You Can Describe a Sequence It Can't Be Random. In: Quisquater, J.-J., Vandwalle, J. (ed.). Adv. Crypt. EUROCRYPT '89. Lecture Notes in Computer Science 434. Springer, Berlin, 533-543.
9. Beutelspacher, A. (1993). Kryptologie. 3. Auflage. Vieweg, Braunschweig.
10. Biham, E., Shamir, A. (1991). Differential Cryptanalysis of DES-like Cryptosystems. J. Cryptology 4(l),3-72.
11. Billingsley, P. (1956). Asymptotic Distributions of Two Goodness of Fit Criteria. Ann. Math. Statist. 27, 1123-1129.
12. Blackburn, S. R. (1999). The Linear Complexity of the Self-Shrinking Generator. IEEE Trans. Inf. Theory 45(6), 2073-2076.
13. Blum, M., Micali, S. (1984). How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits. SIAM J. Computing 13(4), 850-864.
14. Boneh, D. (1999). Twenty Years of Attacks on the RSA Cryptosystem. Notices Am. Math. Soc. 46(2), 203-213.
15. Boneh, D., Venkatesan, R. (1998). Breaking RSA May Not Be Equivalent to Factoring. In: Nyberg, K. (ed.). Adv. Crypt. EUROCRYPT'98. Lecture Notes in Computer Science 1403. Springer, Berlin, 59-71.
16. de Bonis, A., de Santis, A (2001). New Results on the Randomness of Visual Cryptography Schemes. In: Lam, K.-Y. et al. (ed.). Cryptography and Computational Number Theory. Prog. Comput. Sci. Appl. Log. 20, Birkhäuser, Basel, 187-201.
17. Bornemann, F. (2002). Primes in P: Ein Durchbruch fur "Jedermann". DMV Mittelungen 4-2002, 14-21.
18. Brands, S, Gill, R. (1995). Cryptography, Statistics, and Psudorandomness I. Prob. Math. Stat. 15, 101-114.
19. Brands, S, Gill, R. (1996). Cryptography, Statistics, and Psudorandomness II. Prob. Math. Stat. 16(1), 1-17.
20. Brynielsson, L. (1989). A Short Proof of the Xiao-Massey Lemma. IEEE Trans. Inf. Theory 35(6), 1344.
21. Buchmann, J. A. (2001). Introduction to Cryptography. Springer, Berlin.
22. Campana, M., Cohen, R., Girault, M. (1988). A Generalized Birthday Attack. In: Günther, G. G. (ed.). Adv. Crypt. EUROCRYPT'88. Lecture Notes in Computer Science 330. Springer, Berlin, 129-156.
23. Canetti, R., Friedlander, J., Shparlinski, I. (1999). On certain Exponential Sums and the Distribution of Diffie-Hellman Triples. J. London Math. Soc. (2) 59, 799-812.
24. Carnal, H. (1993). Informationstheorie. Course Notes, University of Bern (CH).
25. Chepyzhov, V., Smeets, B. (1991). On a Fast Correlation Attack on certain Stream Ciphers. In: Davies, D. W. (ed.). EUROCRYPT91. Lecture Notes in Computer Science 547. Springer, Berlin, 176-185.
26. Clearwater, S. H., Williams, C. P. (1998). Explorations in Quantum Computing. Springer, Berlin.
27. Coppersmith, D., Krawczyk, H., Mansour, Y. (1994). The Shrinking Generator. In: Stinson, D. R. (ed.). Adv. Crypt. CRYPTO'93. Lecture Notes in Computer Science 773. Springer, Berlin, 22-39.
28. Coron, J. S., Naccache, D. (1999). An Accurate Evalutation of Maurer's Universal Test. In: Selected Areas in Cryptography. Lecture Notes in Computer Science 1556. Springer, Berlin, 57-71.
29. Daemen, J., Rijmen, V. (2002). The Design of Rijndael. AES - the Advanced Encryption Standard. Springer, Berlin.
30. Darmgård, I. B., Landrock, P., Pomerance, C. (1993). Average Case Error Estimates for the Strong Probable Prime Test. Math, of Computation 61(203), 177-194.
31. Delfs, H., Knebl, H. (2002). Introduction to Cryptography. Springer, Berlin.
32. Diffie,W., Hellman, M. (1976). New Directions in Cryptography. IEEE Trans. Inf. Theory IT 22, 644-654.
33. Feller, W. (1968). An Introduction to Probability Theory and its Applications. 3rd edn. Wiley, New York.
34. Goldreich, O. (1993). A Uniform-Complexity Treatment of Encryption and Zero-Knowledge. J. Cryptology 6(1), 21-53.
35. Gonzales Vasco, M. I., Shparlinski, I. E. (2001)- On the Security of DiffieHellman Bits. In: Lam, K.-Y. et al. (ed.). Cryptography and Computational Number Theory. Prog. Comput. Sci. Appl. Log. 20, Birkhäuser, Basel, 257-268.
36. Good, I. J. (1953). The Serial Test for Sampling Numbers and Other Tests for Randomness. Proc. Cam. Phil. Soc. 49, 276-284.
37. Good, I. J. (1957). On the Serial Test for Random Sequence. Ann. Math. Statist. 23, 262-264.
38. Müller, S. (2003). A Probable Prime Test with very high Confidence for n = 3 mod. 4, J. Cryptotogy 16(2), 117-139.
39. Näslund, M., Russell, A. (2001). Achieving Optimal Fairness from Biased Coinflips. In: Lam, K.-Y. et al. (ed.). Cryptography and Computational Number Theory. Birkhäuser, Basel, 303-330.
40. Neuenschwander, D. (2002). A Limit Theorem in Cryptology: The Asymptotic Distribution of Additive Characteristics of Random Permutations of (ZZ/qZZ). In: Berkes, I. et al. (ed.). Limit Theofems in Probability and Statistics II. Proceedings of the 1999 Balatonlelle Conference. Budapest, 437-442.
41. Neuenschwander, D., Zeuner, H. M. (2003). Generating Random Numbers of Prescribed Distribution Using Physical Sources. Stat. and Comp. 13(1), 5-11.
42. von Neumann, J. (1963). Various Techniques Used in Connection with Random Digits. In: von Neumann's Collected Works Vol. 5. Pegamont Press, Elmsford NY, 768-770.
43. Nisley, E. (1990). Basic Radioactive Randoms. Circuit Cellar Ink, 58-68.
44. O'Connor, L. (1995). On the Distribution of Characteristics in Bijective Mappings. J. Crpytology 8, 67-86.
45. 22nd Zero of the Riemann Zeta Function. In: Lapidus, M. L. et al. (ed.). Dynamical, spectral, and arithmetic zeta functions. Contemp. Math. 290, 139-144.
46. Okeya, K., Sakurai, K. (2000). Power Analysis Breaks Elliptic Curve Cryptosystems even Secure against the Timing Attack. In: Boy, B., Okamot, E. (ed.). Progr. Crypt. INDOCRYPT 2000. Lecture Notes in Computer Science 1977. Springer, Berlin,178-190.
47. Perron, O. (1954). Die Lehre von den Kettenbrüchen. Teubner, Stuttgart.
48. Pliam, J. O. (2000). On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks. In: Boy, B., Okamot, E. (ed.). Progr. Crypt. INDOCRYPT 2000. Lecture Notes in Computer Science 1977. Springer, Berlin, 67-79.
49. Reeds, J. A., Sloane, N. J. A. (1985). Shift-register Synthesis (modulo m). SIAM J. Comput. 14(3), 505-513.
50. Révész. P. (1990). Random Walk in Random and Non-Random Environments. World Scientific, Singapore.
51. Richter, M. (1993). PURAN 2: Ein Zufallsgenerator zur Erzeugung von quasiidelaen Zufallszahlen aus elektronischem Rauschen. Informatik aktuell 41, 49-62.
52. Rueppel, R. A. (1986). Analysis and Design of Stream Ciphers. Springer, Berlin.
53. Rukhin, A. L. (2000a). Approximate Entropy for Testing Randomness. J. Appl. Prob. 37, 88-100.
54. Rukhin, A. L. (2000b). Testing Randomness: A Suite of Statistical Procdures. Theory Probab. Appl. 45(1), 111-132.
55. Schindler, W. (2000). A Timing Attack Against RSA with the Chinese Remainder Theorem. In: Koc, C. K., Paar, C. (ed.). Cryptographic Hardware and Embedded Systems. Lecture Notes in Computer Science 1965. Springer, Berlin, 109-124.
56. Schindler, W. (2002a). Optimized Timing Attacks Against Public Key Cryptosystems. Statistics and Decisions 20, 191-210.
57. Schindler, W. (2002b). A Combined Timing and Power Attack. In: Paillier, P., Naccache, D. (ed.). Public Key Cryptography 2002. Lecture Notes in Computer Science 2274. Springer, Berlin, 263-279.
58. Schindler, W., Walter, C. (2003). More Detail for a Combined Timing and Power Attack against Implementations of RSA. In: Paterson, K. G. (ed.). Cryptography and Coding - IMA 2003. Lecture Notes in Computer Science 2898. Springer, Berlin, 245-263.
59. Schneier, B. (1996). Applied Cryptography. Wiley, New York.
60. Schrift, A. W., Shamir, A. (1993). Universal Tests for Nonuniform Distributions. J. Cryptology 6, 119-133.
61. Seifert, J.-P. (2001). Using Fewer Qubits in Shor's Factorization Algorithm Via Simultaneous Diophantine Approximation. In: Naccache, D. (ed.). Topics in Cryptology. CT-RSA 2001. Lecture Notes in Computer Science 2020. Springer, Berlin, 319-327.
62. Siegenthaler, T. (1984). Correlation Immunity of Nonlinear Combining Functions for Cryptographic Applications. IEEE Trans. Inf. Theory IT-30(5), 776780.
63. Swiss Army (1981). Kryptologen-Handbuch. Bern.
64. van Tilborg, H. C. A. (1988). An Introduction to Cryptology. Kluwer, Boston.
65. Walker, H. (1996). HotBits: Genuine Random Numbers Generated by Radioactive Decay. Fourmilab, http://www.fourmilab.ch/hotbits.
66. Walther, U. (1999). Verschlüsselungssysteme auf Basis endlicher Geometrien. Ph. D. Thesis University of Giessen. Mittelungen aus dem Math. Seminar Giessen, Heft 236, Selbstverlag des Math. Instituts.
67. Williams, H. C. (1980). A Modification of the USA Public-Key Encryption Procedure. IEEE Trans. Inf. Theory 26, 726-729.
68. Zurcher, M. (2003). Security of the Advanced Encryption Standard. Diploma Thesis University of Bern (CH).