Cryptosystems rely on the assumption that a number of mathematical problems are computationally intractable, in the sense that they cannot be solved in polynomial time. Numerous approaches have been applied to address these problems. In this paper, we consider artificial neural networks and study th
Assessing the effectiveness of artificial neural networks on problems related to elliptic curve cryptography
โ Scribed by E.C. Laskari; G.C. Meletiou; Y.C. Stamatiou; D.K. Tasoulis; M.N. Vrahatis
- Publisher
- Elsevier Science
- Year
- 2007
- Tongue
- English
- Weight
- 177 KB
- Volume
- 46
- Category
- Article
- ISSN
- 0895-7177
No coin nor oath required. For personal study only.
โฆ Synopsis
Cryptographic systems based on elliptic curves have been introduced as an alternative to conventional public key cryptosystems. The security of both kinds of cryptosystems relies on the hypothesis that the underlying mathematical problems are computationally intractable, in the sense that they cannot be solved in polynomial time. In this paper, we study the performance of artificial neural networks on the computation of a Boolean function derived from the use of elliptic curves in cryptographic applications.
๐ SIMILAR VOLUMES
Potato tubers of four varieties (Brodick, King Edward, Pentland Dell and Record) were stored under commercial conditions and exposed to light for up to 10 days after 0, 10, 20 and 30 weeks. These were analysed for photosynthetic pigment and glycoalkaloid content. There was no signiยฎcant alteration i