On parity problems and the functional-link artificial neural network
β Scribed by N. C. Steele; J. H. Tabor
- Publisher
- Springer-Verlag
- Year
- 1994
- Tongue
- English
- Weight
- 232 KB
- Volume
- 2
- Category
- Article
- ISSN
- 0941-0643
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
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
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 canno