1. American National Standards Institute, New York, USA. ANSI X9.62: Public Key Cryptography for the Financial Services Industry: The Elliptic Curve Digital Signature Algorithm (ECDSA) (1999)
2. Bailey, D.V., Paar, C.: Optimal extension fields for fast arithmetic in public-key algorithms. In: Krawczyk, H. (ed.) Advances in Cryptology – CRYPTO ’98, volume 1462 of Lecture Notes in Computer Science, pp. 472–485. Springer, Berlin Heidelberg New York (August 1998)
3. Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. J. Cryptology 14(3), 153–176 (2001)
4. Barrett, P.: Implementing the rivest shamir and adleman public key encryption algorithm on a standard digital signal processor. In: Odlyzko, A.M. (ed.) Advances in Cryptology – CRYPTO ’86, volume 263 of LNCS, pp. 311–323. Springer, Berlin Heidelberg New York (August 1986)
5. Benaloh, J., Dai, W.: Fast modular reduction. Rump session of CRYPTO ’95