ECC

By default our ecc library uses the uncompressed form to export public keys. If you want to use point compression and decompression (for the import and export of keys and certificates) you will have to down-load the separate PointCompressor.jar and put it into your classpath (see customisation section of the Tutorial

Main Features

• Compliant with ANSI X9.62, IEEE 1363
• ECDSA with SHA-2 support according to ANSI X9.62:2005 and BSI BSI TR 03111 v1.00
  
• Finite field arithmetic in prime fields
• Finite field arithmetic in binary fields. In binary fields we only use polynomial base representation. This is mainly because of the patent situation, but there is no reason to use gaussian normal bases.
• Support for elliptic curve arithmetic with affine and projective coordinates
• Extensive and extensible domain parameter factory (see list of supported parameters )
• JCE/JCA integration of ECDSA
• JCE/JCA integration of ECDH with and without cofactor multiplication
• ASN.1 encoding of signatures, public and private keys

To get started you should read the Tutorial

Key Length according to FIPS PUB 186-2

FIBS PUB 186-2 PDF Document

*) by ||p|| is meant the length of the binary expansion of the integer p.

Patent Issues

There have been many patents granted and applied for in the field of ECC. This means that this implementation may contain an implementation of an algorithm that is IPR-protected in some country. At this time we are not aware of a specific case, except the point compression algorithm (included in the separate jar file). If anybody does identify a case of possible patent infringement, we would be grateful if you inform us about this to enable us dealing with the issue.

Currently we are using the following algorithms

• Our current EC implementation is based on the algorithms described in IEEE 1363 (affine and projective coordinates).
• The prime field arithmetic is based on the BigInteger class.
• Binary field arithmetic uses polynomial base representation and a very generic implementation of the field operations. Concrete the following algorithms are implemented:
  - Squaring: according to algorithm 7 in [1]
  - Addition: simple XOR operation(s)
  - Multiplication: simple shift and add variant with integrated mod. reduction
  - Mod. reduction according to algorithm 5 of [1]
  

[1] D. Hankerson, J. Lopez and A. Menezes, Software implementations of elliptic curve cryptography over elds of characteristic two , draft, 2000.

Sales and Conditions

For current prices of the ECC library, please see the price list and license conditions .

To order the product enter webshop .