|
[ACDG03] M.Akkar, N. Courtois, R. Duteuil , and L. Goubin, A fast and secure Implementation of SFLASH, PKC2003, LNCS 2567, pp.267-278. [Benchmark] “Crypto++ library 5.2.1” is a free c++ class library of cryptographic schemes. See homepage, http://www.eskimo.com/~weidai/cryptlib.html [Ding04] J. Ding, A New Variant of the Matsumoto-Imai Cryptosystem through Perturbation, PKC 2004, LNCS 2947, pp.305–318. [DGW+05] J. Ding, J. Gower, D. Schmidt, C.Wolf, and Z. Yin. Complexity Estimates for the F4 attack on the Perturbed Matsumoto-Imai Cryptosystem, 2004 manuscript. [Datesheet1] Security & Chip Card ICs SLE 66CX642P, 16-bit Security Controller with Advanced Crypto Engine, see web site: http://www.infineon.com [Datasheet2] High Speed/Low Power Microcontrollers Dollas DS80C320C, see web site, http://www.chipcatalog.com/Maxim/DS80C320.htm [FGS05] P.-A. Fouque, L. Granboulan, and J. Stern, Differential Cryptanalysis for Multivariate Schemes, Eurocrypt 2005. [Gua97] J. GUAJARDO, Efficient Algorithms for Elliptic Curve Cryptosystems, Master''s Thesis, Worcester Polytechnic Institute, May 1997 [Has99] M.A. Hasan, Look-up Table Based Large Finite Field Multiplication in Memory constrained Cryptosystems, IMA-Crypto & Coding’99, LNCS 1746, pp.213-221 [IT88] T.Itoh and S.Tsuji, A Fast Algorithm for Computing Multiplicative Inverses using Normal Bases, Info. and computing, 78 (1998), pp.171-177 [KO63] A. Karatsuba and Yu. Ofman , Multiplication of Many-Digital Numbers by Automatic Computers, Doklady Akad. Nauk SSSR 145(1962), pp.293-294. Translation in Physics-Doklady 7(1963), pp.595-596 [LC83] R. Lidl and H. Niederreiter. Finite Field, volume 20 of Encyclopedia of Mathematics and its Applications. Addition-Wesley, Reading, Massachusetts, 1983. [MI88] T. Matsumoto and H. Imai, Public Quadratic Polynomial-Tuples for Efficient Signature-Verification and Message-Encryption, Eurocrypt 1988, LNCS 330, pp.419-453 [NESSIE] NESSIE project , see web site http://www.cryptonessie.org [Pat95] J.Patarin, Cryptanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt’88, Crypto’95, LNCS 963, pp.248-261. [PGC98] J. Patarin, L. Goubin, and N. Courtois, C.+ and HM: Variations Around Two Schemes of T. Matsumoto and H. Imai, Asiacrypt’98, LNCS 1514, pp.35–49. [SCS01] Sheueling Chang Shantz , From Euclid’s GCD to Montgomery Multiplication to the Great Divide, SML. Technical Report SMLI TR-2001-95, Sun Microsystems Laboratories, 2001 [Sil99] H. Silverman, Fast Multiplication in Finite Fields GF(2N), CHES’99 , LNCS 1717, pp.122-134 [Sma01] N.P. Smart, The Exact Security of ECIES in the Generic Group Model, Cryptography and Coding’01, LNCS 2260, pp.73-84 [Wolf04] C. Wolf , Efficient Public Key Generation for Multivariate Cryptosystems, Proc. ERACOM Conference and Workshop on Cryptographic Algorithms and their Uses, July 5-6, 2004. http://www.minrank.org/hfe/#implement [WP05] C. Wolf and B. Preneel, Taxonomy of Public-Key Schemes based on the Problem of Multivariate Quadratic Equations, manuscript, ePrint 2005/077. [WP05a] C.Wolf and B.Preneel, Superfluous Keys in Multivariate Quadratic Asymmetric Systems, PKC 2005, LNCS 3386, pp.275-287. Extended version: eprint 2004/361. [YCC04] B.Y. Yang, J.-M. Chen, and Y.-H. Chen, TTS: High-speed Signatures from Low-End Smartcards, CHES 2004, LNCS 3156, pp.371-385 [YCC05] B.Y. Yang, J.-M. Chen, and Y.-H. Chen, Perturbed Matsumoto-Imai Plus (PMI+) on the 8051
|