An implementation for a fast public-key cryptosystem
β Scribed by G. B. Agnew; R. C. Mullin; I. M. Onyszchuk; S. A. Vanstone
- Publisher
- Springer
- Year
- 1991
- Tongue
- English
- Weight
- 795 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0933-2790
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
In this paper a public key cryptosystem based on automata theory, FAPKC4, is proposed which can be used both for encryption and implementation of digital signatures-this system is similar to FAPKC3 in every respect.
This article exploits the fact that linear codes can correct twice the number of erasures as that of errors, allowing reduction in code size and providing the same level of security.
We demonstrate that with the given specifications the Lyndon words based public key cryptosystem suggested by Siromoney and Mathew [Inform. Process. Lett. 35 (1990) 33-36] is susceptible to very simple ciphertext only attacks. Consequently, in the present form this system cannot be considered as suf