暂无分享,去创建一个
[1] Thomas Pornin,et al. Automatic Software Optimization of Block Ciphers using Bitslicing Techniques , 1999 .
[2] Gregory V. Bard,et al. Accelerating Cryptanalysis with the Method of Four Russians , 2006, IACR Cryptol. ePrint Arch..
[3] B. David Saunders,et al. Efficient matrix rank computation with application to the study of strongly regular graphs , 2007, ISSAC '07.
[4] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[5] Jean-Guillaume Dumas,et al. Dense Linear Algebra over Finite Fields: the FFLAS and FFPACK packages , 2006, ArXiv.
[6] Jean-Guillaume Dumas,et al. Compressed Modular Matrix Multiplication , 2008, ArXiv.
[7] Gregory V. Bard,et al. Efficient Multiplication of Dense Matrices over GF(2) , 2008, ArXiv.
[8] Kevin Buzzard,et al. A mod five approach to modularity of icosahedral galois representations , 2002 .
[9] John J. Cannon,et al. The Magma Algebra System I: The User Language , 1997, J. Symb. Comput..
[10] Matthew Kwan. Reducing the Gate Count of Bitslice DES , 2000, IACR Cryptol. ePrint Arch..
[11] Qing Xiang,et al. Pseudo-Paley graphs and skew Hadamard difference sets from presemifields , 2007, Des. Codes Cryptogr..
[12] Eli Biham,et al. A Fast New DES Implementation in Software , 1997, FSE.
[13] M. Karnaugh. The map method for synthesis of combinational logic circuits , 1953, Transactions of the American Institute of Electrical Engineers, Part I: Communication and Electronics.
[14] R. Rudell,et al. Multiple-Valued Logic Minimization for PLA Synthesis , 1986 .