The Koblitz or subfield curves offer a large variety of groups suitable for cryptography. We show how to derive a fast group operation by using the Frobenius automorphism and give evidence that there are many groups obtainable having almost prime order.
back