Studying the performance of artificial neural networks on problems related to cryptography
DOI10.1016/J.NONRWA.2005.12.002zbMATH Open1109.68047OpenAlexW2169700964MaRDI QIDQ867941FDOQ867941
Authors: E. C. Laskari, G. C. Meletiou, Dimitris K. Tasoulis, Michael N. Vrahatis
Publication date: 19 February 2007
Published in: Nonlinear Analysis. Real World Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.nonrwa.2005.12.002
Recommendations
- Cryptography based on neural networks analytical results
- Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
- Analysis of Neural Cryptography
- Using neural network in cryptography
- Application of neural cryptography in solving problems of information security
- Finding the differential characteristics of block ciphers with neural networks
- On the cryptanalysis of two cryptographic algorithms that utilize chaotic neural networks
- scientific article; zbMATH DE number 1782576
- Cryptanalytic extraction of neural network models
Learning and adaptive systems in artificial intelligence (68T05) Data encryption (aspects in computer science) (68P25) Neural networks for/in biological studies, artificial life and related topics (92B20)
Cites Work
- Self-organizing maps.
- A method for obtaining digital signatures and public-key cryptosystems
- Title not available (Why is that?)
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- Multilayer feedforward networks are universal approximators
- Title not available (Why is that?)
- Title not available (Why is that?)
- A class of gradient unconstrained minimization algorithms with adaptive stepsize
- Hiding information and signatures in trapdoor knapsacks
- Discrete logarithms: The past and the future
- Title not available (Why is that?)
- A polynomial representation for logarithms in GF(q)
- A short proof for explicit formulas for discrete logarithms in finite fields
- The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
- A note on discrete logarithms in finite fields
- On polynomial approximation of the discrete logarithm and the Diffie-Hellman mapping.
- Adaptive stepsize algorithms for on-line training of neural networks.
- Polynomial representations of the Diffie-Hellman mapping
- A note on the interpolation of the Diffie-Hellman mapping
- Title not available (Why is that?)
- On Certain Exponential Sums and the Distribution of Diffie-Hellman Triples
- Title not available (Why is that?)
- Artificial nonmonotonic neural networks
- Polynomial interpolation of the discrete logarithm
Cited In (5)
This page was built for publication: Studying the performance of artificial neural networks on problems related to cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867941)