Physical Address
304 North Cardinal St.
Dorchester Center, MA 02124
BS ISO IEC 15946 — Cryptographic Techniques Based on Elliptic Curves Standard Series (General and Elliptic Curve Generation)
Information Technology — Security Techniques — Cryptographic Techniques Based on Elliptic Curves: General and Elliptic Curve Generation
🔐 BS ISO/IEC 15946 is the elliptic curve cryptography (ECC) standard series developed by ISO and IEC and adopted by the British Standards Institution (BSI) as a UK national standard. This batch includes ISO/IEC 15946-1:2016 (General) and ISO/IEC 15946-5:2009 (Elliptic curve generation), providing a standard basis for the mathematics, finite field conventions, and secure curve generation of elliptic curve public-key cryptography.
💡 Elliptic curve cryptography (ECC) provides equivalent security with shorter keys: at the same security strength, ECC key lengths are far smaller than RSA — ideal for resource-constrained devices (IoT, smart cards, mobile terminals) and high-performance key exchange.
1. Series Overview and Positioning 📌
The ISO/IEC 15946 series revolves around elliptic curve cryptography: Part 1 general (mathematical basis and conventions); Part 2 key establishment; Part 3 key exchange; Part 4 digital signatures; Part 5 elliptic curve generation. The Part 1 and Part 5 in this batch correspond to “foundational conventions” and “curve generation” respectively.
| Standard | Title | Year | Core Content |
|---|---|---|---|
| BS ISO/IEC 15946-1:2016 | General | 2016 | Mathematical basis, finite field conventions, field element representation and symbols |
| BS ISO/IEC 15946-5:2009 | Elliptic curve generation | 2009 | Secure curve generation, parameter verification, and curve field selection |
⚠️ Part 1 replaces and withdraws the 2008 edition. ECC parameters are closely related to NIST, SEC, and other curve standards; verify curve identifiers and parameter sources when citing, avoiding insecure weak curves.
2. General (Part 1) 📐
Part 1 defines the mathematical basis and conventions of elliptic curve cryptography:
- Finite fields: specifies representation and arithmetic conventions for prime fields F(p) and characteristic-2 fields F(2^m).
- Field element representation: specifies encoding and symbol conventions for field elements, ensuring cross-implementation consistency.
- Curve equations: defines the Weierstrass equation and coordinate representation of elliptic curves.
- Parameters and keys: defines the representation of domain parameters, key pairs, and public keys.
💡 Consistent finite field conventions are a precondition for interoperability: if implementations differ on field element representation or curve parameter conventions, they cannot correctly compute shared secrets or verify signatures.
3. Elliptic Curve Generation (Part 5) 🪄
Part 5 specifies the generation of secure elliptic curves:
- Curve generation: defines the algorithms and steps for generating elliptic curves meeting security requirements.
- Parameter verification: specifies methods for verifying generated curve parameters (order, base-point order, cofactor).
- Security criteria: clarifies the security criteria a curve shall satisfy (e.g. order conditions resisting specific attacks).
- Randomness and unpredictability: ensures generation is random and unpredictable, preventing weak-curve injection.
| Step | Content | Significance |
|---|---|---|
| Curve generation | Secure curve construction algorithm | Obtain a usable curve |
| Parameter verification | Order, base-point order, cofactor checks | Exclude weak curves |
| Security criteria | Attack-resisting order conditions | Guarantee security strength |
| Randomness | Unpredictable generation | Prevent injection and side channels |
4. Key Technical Requirements ⚙️
- Elliptic curve cryptography shall be based on the agreed finite fields and curve equations for cross-implementation interoperability.
- Curve parameters shall meet the specified security criteria, with order and cofactor confirmed through verification.
- Curve generation shall use a secure random source to guarantee unpredictability.
- Key pairs and public keys shall be represented and encoded per convention to avoid parsing ambiguity.
⚠️ Weak curves or erroneous parameters cause security disasters: avoid known-insecure curves (anomalous, singular) and strictly check order conditions during generation and verification.
5. Engineering Practice 🛠️
- TLS/HTTPS: ECC for key exchange (e.g. ECDHE) and digital signatures.
- IoT and smart cards: public-key cryptography on constrained devices with short keys.
- Digital signatures: ECC signatures (e.g. ECDSA, EdDSA) for authentication and data integrity.
- Key management: securely generate and verify curve parameters, building a trusted public-key infrastructure.
6. Frequently Asked Questions ❓
❓ Q: What is elliptic curve cryptography (ECC)?
A: ECC is public-key cryptography based on the elliptic-curve discrete-logarithm problem, offering high security with short keys — suited to constrained devices and high-performance key exchange.
A: ECC is public-key cryptography based on the elliptic-curve discrete-logarithm problem, offering high security with short keys — suited to constrained devices and high-performance key exchange.
❓ Q: How do Part 1 and Part 5 divide responsibility?
A: Part 1 defines the mathematical basis and finite field conventions; Part 5 defines secure curve generation and parameter verification. The former provides the interoperability basis, the latter ensures curve security.
A: Part 1 defines the mathematical basis and finite field conventions; Part 5 defines secure curve generation and parameter verification. The former provides the interoperability basis, the latter ensures curve security.
❓ Q: Why is curve parameter verification important?
A: Verifying order, base-point order, and cofactor excludes weak curves, preventing attacks such as anomalous curves; erroneous or maliciously constructed parameters can break the cryptography.
A: Verifying order, base-point order, and cofactor excludes weak curves, preventing attacks such as anomalous curves; erroneous or maliciously constructed parameters can break the cryptography.
🔍 Q: What advantage does ECC have over RSA?
A: At equal security strength, ECC keys are shorter with lower computation and storage overhead — ideal for constrained devices — but implementation is more complex, requiring careful curve and parameter handling.
A: At equal security strength, ECC keys are shorter with lower computation and storage overhead — ideal for constrained devices — but implementation is more complex, requiring careful curve and parameter handling.