Studying the performance of artificial neural networks on problems related to cryptography

Nonlinear Analysis: Real World Applications

Volumn 7, Issue 5, 2006, Pages 937-942

  Laskari, E C ^a   Meletiou, G C ^b   Tasoulis, D K ^a   Vrahatis, M N ^a  

^a UNIVERSITY OF PATRAS   (Greece)

^b ATEI of Epirus   (Greece)

Author keywords

Approximation; Artificial neural networks; Diffie Hellman problem; Discrete logarithm; Factorization

Indexed keywords

NEURAL NETWORKS; PERFORMANCE; POLYNOMIAL APPROXIMATION; PROBLEM SOLVING;

APPROXIMATION PROBLEMS; MATHEMATICAL PROBLEMS;

CRYPTOGRAPHY;

EID: 33745166264     PISSN: 14681218     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.nonrwa.2005.12.002     Document Type: Article

References (35)

1. L. Adleman, A subexponential algorithm for discrete logarithm problem with applications to cryptography, 20th FOCS, 1979, pp. 55-60.
2. Boutsinas B., and Vrahatis M.N. Artificial nonmonotonic neural networks. Artif. Intell. 132 (2001) 1-38
3. Canetti R., Friedlander J., and Shparlinski I. On certain exponential sums and the distribution of Diffie-Hellman triples. J. London Math. Soc. (2) 59 3 (1999) 799-812
4. Coppersmith D., and Shparlinski I. On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping. J. Cryptology 13 (2000) 339-360
5. Diffie W., and Hellman M. New directions in cryptography. IEEE Trans. Inf. Theory 22 (1976) 644-654
6. El Gamal T. A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Trans. Inf. Theory 31 (1985) 469-472
7. El Mahassni E., and Shparlinski I. Polynomial representations of the Diffie-Hellman mapping. Bull. Aust. Math. Soc. 63 3 (2001) 467-473
8. Haykin S. Neural Networks (1999), Macmillan College Publishing Company
9. Hornik K. Multilayer feedforward networks are universal approximators. Neural Networks 2 (1989) 359-366
10. Kohonen T. Self-Organized Maps (1997), Springer, Berlin
11. Magoulas G.D., Plagianakos V.P., and Vrahatis M.N. Adaptive stepsize algorithms for on-line training of neural networks. Nonlinear Anal. 47 5 (2001) 3425-3430
12. Magoulas G.D., Vrahatis M.N., and Androulakis G.S. Effective backpropagation training with variable stepsize. Neural Networks 10 1 (1997) 69-82
13. Magoulas G.D., Vrahatis M.N., and Androulakis G.S. Increasing the convergence rate of the error backpropagation algorithm by learning rate adaptation methods. Neural Comput. 11 7 (1999) 1769-1796
14. Maurer U., and Wolf S. The relationship between breaking the Diffie-Hellman protocol and computing discrete logarithms. SIAM J. Comput. 28 (1999) 1689-1721
15. Meletiou G. Explicit form for the discrete logarithm over the field GF (p, k). Arch. Math. Brno 29 1-2 (1993) 25-28
16. Meletiou G., and Mullen G.L. A note on discrete logarithms in finite fields. Appl. Algebra Eng. Commun. Comput. 3 1 (1992) 75-79
17. G. Meletiou, D.K. Tasoulis, M.N. Vrahatis, A first study of the neural network approach to the RSA cryptosystem, IASTED 2002 Conference on Artificial Intelligence, 2002, pp. 483-488.
18. G.C. Meletiou, D.K. Tasoulis, M.N. Vrahatis, Cryptography through interpolation approximation and computational intelligence methods, Bull. Greek Math. Soc. 48 (2003) 61-75.
19. Menezes A.J., Van Oorschot C.P., and Vanstone S.A. Handbook of Applied Cryptography (1996), CRC Press, Boca Raton, FL
20. Merkle R.C., and Hellman M.E. Hiding information and signatures in trapdoor knapsacks. IEEE Trans. Inf. Theory 24 (1978) 525-530
21. Møller M.F. A scaled conjugate gradient algorithm for fast supervised learning. Neural Networks 6 (1993) 525-533
22. Mullen G.L., and White D. A polynomial representation for logarithms in GF (q). Acta Arithmetica 47 (1986) 255-261
23. Niederreiter H. A short proof for explicit formulas for discrete logarithms in finite fields. Appl. Algebra Eng. Commun. Comput. 1 (1990) 55-57
24. Odlyzko A.M. Discrete logarithms in finite fields and their cryptographic significance. EUROCRYPT 84 (1984)
25. Odlyzko A.M. Discrete logarithms: the past and the future. Des. Codes Cryptogr. 19 (2000) 129-145
26. A. Pincus, Approximation theory of the MLP model in neural networks, Acta Numerica (1999) 143-195.
27. Pohlig S.C., and Hellman M. An improved algorithm for computing logarithms over GF (p) and its cryptographic significance. IEEE Trans. Inf. Theory 24 (1978) 106-110
28. M. Riedmiller, H. Braun, A direct adaptive method for faster backpropagation learning: the RPROP algorithm, in: Proceedings of the IEEE International Conference on Neural Networks, San Francisco, CA, 1993, pp. 586-591.
29. Rivest R., Shamir A., and Adlemann L. A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21 (1978) 120-126
30. Rumelhart D.E., Hinton G.E., and Williams R.J. Learning internal representations by error propagation. In: Rumelhart D.E., and McClelland J.L. (Eds). Parallel Distributed Processing vol. 1 (1986), MIT Press, Cambridge, MA 318-362
31. Specht D.F. Probabilistic neural networks. Neural Networks 3 1 (1990) 109-118
32. Vrahatis M.N., Androulakis G.S., Lambrinos J.N., and Magoulas G.D. A class of gradient unconstrained minimization algorithms with adaptive stepsize. J. Comput. Appl. Math. 114 2 (2000) 367-386
33. Winterhof A. A note on the interpolation of the Diffie-Hellman mapping. Bull. Aust. Math. Soc. 64 3 (2001) 475-477
34. Winterhof A. Polynomial interpolation of the discrete logarithm. Des. Codes Cryptogr. 25 1 (2002) 63-72
35. White H. Connectionist nonparametric regression: multilayer feedforward networks can learn arbitrary mappings. Neural Networks 2 (1989) 359-366