Cryptology ePrint Archive: Report 2006/133

Available versions in chronological order


Low Complexity Bit-Parallel Square Root Computation over GF($2^m$) for all Trinomials
Francisco Rodríguez-Henríquez and Guillermo Morales-Luna and Julio López-Hernández


[ Cryptology ePrint archive ]