Abstract
An attack algorithm is proposed on a finite automaton public key cryptosystem. It is proved that this attack can break FAPKC0 in polynomial time. The basic idea can be used in principle to attack other FAPKCs. Therefore, while designing an FAPKC, it must be taken into account whether it is secure or not under this kind of attack.
| Original language | English |
|---|---|
| Journal | Science in China, Series E: Technological Sciences |
| Volume | 39 |
| Issue number | 1 |
| Publication status | Published - 1996 |
| Externally published | Yes |
Bibliographical note
Publication details (e.g. title, author(s), publication statuses and dates) are captured on an “AS IS” and “AS AVAILABLE” basis at the time of record harvesting from the data source. Suggestions for further amendments or supplementary information can be sent to [email protected].Research Keywords
- Cryptanalysis
- Finite automaton
- Public key cryptosystem
Fingerprint
Dive into the research topics of 'Cryptanalysis on a finite automaton public key cryptosystem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver