Cryptology ePrint Archive: Report 2006/133

Available versions in chronological order

20060403:153751 (posted 03-Apr-2006 15:37:51 UTC): Low Complexity Bit-Parallel Square Root Computation over GF($2^m$) for all Trinomials; Francisco Rodr\'{i}guez-Henr\'{i}quez and Guillermo Morales-Luna and Julio L\'{o}pez-Hern\'{a}ndez

[ Cryptology ePrint archive ]