Cryptology ePrint Archive: Report 2006/163
Available versions in chronological order
20060516:192133 (posted 16-May-2006 19:21:33 UTC)
Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods
Gregory V. Bard
Publication Info: Not yet published. Submitted to a conference.
[
Cryptology ePrint archive
]