Elliptic Curve Cryptography
E37202
Elliptic Curve Cryptography is a public-key cryptographic approach that uses the mathematics of elliptic curves over finite fields to provide strong security with relatively small key sizes.
Statements (49)
| Predicate | Object |
|---|---|
| instanceOf |
asymmetric cryptography
→
public-key cryptography scheme → |
| abbreviation |
ECC
→
|
| advantageOverRSA |
lower bandwidth requirements
→
lower computational cost on constrained devices → smaller key sizes for comparable security → |
| applicationDomain |
embedded systems security
→
internet security → |
| basedOn |
elliptic curves
→
|
| comparedTo |
RSA
→
|
| designGoal |
high security per bit of key length
→
|
| hasVariant |
Curve25519-based schemes
→
Ed25519 signatures → Koblitz curves → brainpool curves → |
| includesScheme |
ECMQV
→
Elliptic Curve Diffie–Hellman → Elliptic Curve Digital Signature Algorithm → |
| introducedBy |
Neal Koblitz
→
Victor S. Miller → |
| keyAdvantage |
strong security with relatively small key sizes
→
|
| notVulnerableTo |
classical sub-exponential algorithms known for integer factorization
→
|
| provides |
digital signatures
→
key agreement → public-key encryption → |
| requires |
careful curve selection
→
secure parameter generation → |
| securityBasedOn |
elliptic curve discrete logarithm problem
→
|
| standardizedBy |
ANSI
→
IEEE → NIST → SECG → |
| threatenedBy |
quantum computers running Shor's algorithm
→
|
| typicalField |
binary fields
→
extension fields → prime fields → |
| usedIn |
HTTPS
→
PGP → SSH → TLS → blockchain systems → cryptocurrencies → mobile device security → smart cards → |
| uses |
elliptic curves over finite fields
→
group law on elliptic curves → |
| vulnerableTo |
poorly chosen curves
→
side-channel attacks if not implemented correctly → |
| yearProposed |
1985
→
|
Referenced by (1)
| Subject (surface form when different) | Predicate |
|---|---|
|
RSA
→
|
comparedWith |