Geodesic
FPGA implementation of FAPKC-4
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 44-46 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The paper presents FPGA implementation of the latest version of Finite Automata Public Key Cryptosystem (FAPKC-4). The change of the throughput/hardware resources in comparison with the basic cryptosystem (FAPKC) is investigated. These parameters for encryption/decryption and digital signature is compared. A comparison of software and hardware implementations of FAPKC-4 is given too. 
@article{PDMA_2012_5_a23,
     author = {D. S. Kovalev},
     title = {FPGA implementation of {FAPKC-4}},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {44--46},
     year = {2012},
     number = {5},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2012_5_a23/}
}
TY  - JOUR
AU  - D. S. Kovalev
TI  - FPGA implementation of FAPKC-4
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2012
SP  - 44
EP  - 46
IS  - 5
UR  - http://geodesic.mathdoc.fr/item/PDMA_2012_5_a23/
LA  - ru
ID  - PDMA_2012_5_a23
ER  - 
%0 Journal Article
%A D. S. Kovalev
%T FPGA implementation of FAPKC-4
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2012
%P 44-46
%N 5
%U http://geodesic.mathdoc.fr/item/PDMA_2012_5_a23/
%G ru
%F PDMA_2012_5_a23
D. S. Kovalev. FPGA implementation of FAPKC-4. Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 44-46. http://geodesic.mathdoc.fr/item/PDMA_2012_5_a23/

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

[2] Kovalev D. S., Trenkaev V. N., “Realizatsiya na PLIS shifra FAPKC”, Prikladnaya diskretnaya matematika. Prilozhenie, 2011, no. 4, 33–34

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

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