A parallel hardware architecture for fast Gaussian elimination over GF(2)

Proceedings - 14th Annual IEEE Symposium on Field-Programmable Custom Computing Machines, FCCM 2006

Volumn , Issue , 2006, Pages 237-248

  Bogdanov, A ^a   Mertens, M C ^a   Paar, C ^a   Pelzl, J ^a   Rupp, A ^a  

^a RUHR UNIVERSITY BOCHUM   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER ARCHITECTURE; GAUSSIAN DISTRIBUTION; LINEAR SYSTEMS; OPTIMIZATION; PROBLEM SOLVING; RESOURCE ALLOCATION;

CLOCK CYCLES; GAUSSIAN ELIMINATION; HARDWARE ARCHITECTURE; SPACE COMPLEXITY;

PARALLEL PROCESSING SYSTEMS;

EID: 34547403278     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/FCCM.2006.12     Document Type: Conference Paper

References (17)

1. F. Armknecht. A Linearization Attack on the Bluetooth Key Stream Generator. Cryptology ePrint Archive, Report 2002/191, December 2002.
2. D. Bailey and H. Ferguson. A Strassen-Newton Algorithm for High-Speed Parallelizable Matrix Inversion. In the 1988 ACM/IEEE conference on Supercomputing, pages 419-424, 1988.
3. D. Bailey, K. Lee, and H. Simon. Using Strassen's Algorithm to Accelerate the Solution of Linear Systems. Journal of Supercomputing, 4:357-371, 1990.
4. E. Barkan, E. Biham, and N. Keller. Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication. In Crypto 2003, volume 2729 of LNCS, pages 600-616. Springer Verlag, 2003.
5. D. Bernstein. Circuits for Integer Factorization: A Proposal. Available at http://cr.yp.to/papers.html#nfscircuit, 2001.
6. D. A. Buell, S. Akella, J. P. Davis, G. Quan, and D. Caliga. The DARPA Boolean Equation Benchmark on a Reconfigurable Computer. Technical report, Department of Computer Science and Engineering, University of South Carolina, 2004.
7. T. Cormen, C. Leiserson, R. Rivest, and C. Stein. Introduction to Algorithms. MIT Press, 2nd edition, 2001.
8. N. Courtois. Fast Algebraic Attacks on Stream Ciphers with Linear Feedback. In Crypto 2003, volume 2729 of LNCS, pages 177-194. Springer Verlag, 2003.
9. N. Courtois. Algebraic Attacks on Combiners with Memory and Several Outputs. In ICISC 2004, LNCS, 2004.
10. N. Courtois. Cryptanalysis of Sfinks. Cryptology ePrint Archiv, Report 2005/243, 2005.
11. N. Courtois and W. Meier. Algebraic Attacks on Stream Ciphers with Linear Feedback. In Eurocrypt 2003, volume 2656 of LNCS, pages 345-359, 2003.
12. N. Galoppo, N. Govindaraju, M. Henson, and D. Manocha. LU-GPU: Efficient Algorithms for Solving Dense Linear Systems on Graphics Hardware. In ACM/IEEE SC - 05 Conference, November 12-18, 2005.
13. W. Geiselmann, A. Shamir, R. Steinwandt, and E. Tromer. Scalable Hardware for Sparse Systems of Linear Equations with Applications to Integer Factorization. In CHES 2005, volume 3659 of LNCS, pages 131-146. Springer Verlag, 2005.
14. M. Hestenes and E. Stiefel. Methods of Conjugate Gradients for Solving Linear Systems. Journal Res. Nat. Bur. Standards, 49:409-436, 1952.
15. M. LaMacchia and A. Odlyzko. Solving Large Sparse Linear Systems over Finite Fields. In A. Menezes and S. Vanstone, editors, Crypto 1990, volume 537 of LNCS, pages 109-133, 1991.
16. D. Parkinson. A Compact Algorithm for Gaussian Elimination over GF(2) Implemented on Highly Parallel Computers. Parallel Computing, 1:65-73, 1984.
17. V. Strassen. Gaussian Elimination Is Not Optimal. Numerical Mathematics, 13:354-356, 1969.