FPGA implementation of FAPKC-4
Prikladnaya Diskretnaya Matematika. Supplement, no. 5 (2012), pp. 44-46
Citer cet article
Voir la notice de l'article provenant de la source Math-Net.Ru
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.
[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