A New Combinational Logic Minimization Technique with Applications to Cryptology
暂无分享,去创建一个
[1] Jerzy Tyszkiewicz,et al. Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings , 2008, MFCS.
[2] Akashi Satoh,et al. A Compact Rijndael Hardware Architecture with S-Box Optimization , 2001, ASIACRYPT.
[3] Christof Paar,et al. Some remarks on efficient inversion in finite fields , 1995, Proceedings of 1995 IEEE International Symposium on Information Theory.
[4] Joan Boyar,et al. On the Shortest Linear Straight-Line Program for Computing Linear Forms , 2008, MFCS.
[5] Simon Heron,et al. Encryption: Advanced Encryption Standard (AES) , 2009 .
[6] Peter Schwabe,et al. Faster and Timing-Attack Resistant AES-GCM , 2009, CHES.
[7] Christophe Clavier,et al. Cryptographic Hardware and Embedded Systems - CHES 2009, 11th International Workshop, Lausanne, Switzerland, September 6-9, 2009, Proceedings , 2009, CHES.
[8] Colin Boyd,et al. Advances in Cryptology - ASIACRYPT 2001 , 2001 .
[9] Joan Boyar,et al. Tight bounds for the multiplicative complexity of symmetric functions , 2008, Theor. Comput. Sci..
[10] David R. Canright,et al. A very compact Rijndael S-box , 2005 .
[11] Berk Sunar,et al. Mastrovito Multiplier for All Trinomials , 1999, IEEE Trans. Computers.
[12] Christof Paar,et al. Optimized arithmetic for Reed-Solomon encoders , 1997, Proceedings of IEEE International Symposium on Information Theory.
[13] T. Itoh,et al. A Fast Algorithm for Computing Multiplicative Inverses in GF(2^m) Using Normal Bases , 1988, Inf. Comput..
[14] Joan Boyar,et al. New logic minimization techniques with applications to cryptology , 2009, IACR Cryptol. ePrint Arch..