Elliptic Curve Cryptography is an efficient and secured mechanism for implementing Public Key Cryptography and for Signing messages. The primary benefit of ECC is a small key size, reducing storage and transmission requirements—i.e., that an elliptic curve group could provide the same level of security afforded by an RSA-based system with a large modulus and correspondingly larger key.
We provide solutions for the following algorithms based on elliptic curve cryptography:
1. ECC Key Pair Generation
2. Elliptic Curve Digital Signature Algorithm (ECDSA)
Above algorithms are specified in standard ANSI X9.62-2005, they are compliant with FIPS 186-3 (Federal Information Processing Standard) and NIST (National Institute of standard and Technology) suit-B.
FIPS 186-3 has 10 recommended finite fields: 5 prime fields Fp for p192, p224, p256, p384, p521 and 5 binary fields F2m for 163, 233, 283, 409, 571 with three types of curves named random prime, random binary and koblitz curve.
Picus Tech has implemented highly efficient algorithms optimized in ARM native assembly for several ARM cores. The implementations are memory and MIPs efficient.
- Implementation compliant with FIPS 186-3 standard
- Optimized and efficient arithmetic has been implemented both for prime field and binary field
- Optimized and efficient elliptic curve arithmetic
- Fully reentrant implementation allowing multiple instances and ease of memory management
- Low memory foot print
- Choice of modules based on available memory, allowing tradeoff between memory and computations requirements.
- Low computational power
- Suitable for machines having low bandwidth, low computing power, less memory.
- Highly optimized implementations. Can be easily ported to any platform
- Object Code
- API documentation