Home | History | Annotate | Download | only in libtomcrypt

Lines Matching refs:instructions

5307 When defined GCM will use the SSE2 instructions to perform the $GF(2^x)$ multiply using 16 128--bit XOR operations.  It shaves a few cycles per byte