Cryptology ePrint Archive: Report 2012/026
Available versions in chronological order
20120120:200144 (posted 20-Jan-2012 20:01:44 UTC)
Decoding Random Binary Linear Codes in $2^{n/20}$: How $1+1=0$ Improves Information Set Decoding
Anja Becker and Antoine Joux and Alexander May and Alexander Meurer
Publication Info: This is a full version of our same-named EUROCRYPT 2012 accepted paper
[
Cryptology ePrint archive
]