Geodesic
FPGA implementation of Finite Automata Public Key Cryptosystem
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 33-34.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper presents FPGA implementation of Finite Automata Public Key Cryptosystem (FAPKC). The dependence of the throughput/hardware resources on cryptosystem parameters is investigated. FPGA implementations of FAPKC and RSA are compared. 
@article{PDM_2011_13_a17,
     author = {D. S. Kovalev and V. N. Trenkaev},
     title = {FPGA implementation of {Finite} {Automata} {Public} {Key} {Cryptosystem}},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {33--34},
     publisher = {mathdoc},
     number = {13},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a17/}
}
TY  - JOUR
AU  - D. S. Kovalev
AU  - V. N. Trenkaev
TI  - FPGA implementation of Finite Automata Public Key Cryptosystem
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 33
EP  - 34
IS  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_13_a17/
LA  - ru
ID  - PDM_2011_13_a17
ER  - 
%0 Journal Article
%A D. S. Kovalev
%A V. N. Trenkaev
%T FPGA implementation of Finite Automata Public Key Cryptosystem
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 33-34
%N 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_13_a17/
%G ru
%F PDM_2011_13_a17
D. S. Kovalev; V. N. Trenkaev. FPGA implementation of Finite Automata Public Key Cryptosystem. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 33-34. http://geodesic.mathdoc.fr/item/PDM_2011_13_a17/

[1] Bao F., Igarashi Y., “Break Finite Automata Public Key Cryptosystem”, LNCS, 944, 1995, 147–158

[2] Dai Z. D., Ye D. F., Lam K. Y., “Weak Invertibility of Finite Automata and Cryptanalysis on FAPKC”, LNCS, 1514, 1998, 227–241 | Zbl

[3] Tao R. J., Finite Automata and Application to Cryptography, Tsinghua University Press; Springer, 2008 | Zbl

[4] Wollinger T., Guajardo J., Paar C., “Cryptography on FPGAs: State of the art implementations and attacks”, ACM Trans. Embedded Computing Systems, 3:3 (2004), 534–574 | DOI