Skip to main content

1 Result(s)

within Article Remove this filter Tolga Acar Remove this filter English Remove this filter

and

  1. No Access

    Article

    Montgomery Multiplication in GF(2k)

    We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. Th...

    Cetin K. Koc, Tolga Acar in Designs, Codes and Cryptography (1998)