Difference between revisions of "Curve25519"
Jump to navigation
Jump to search
↑ https://www.wireguard.com/papers/wireguard.pdf
| (One intermediate revision by the same user not shown) | |||
| Line 3: | Line 3: | ||
[[wikipedia:Curve25519]] (2005) | [[wikipedia:Curve25519]] (2005) | ||
| − | Computing Curve25519 point multiplication is [[CPU intensive]].<ref>https://www.wireguard.com/papers/wireguard.pdf</ref> | + | Computing Curve25519 [[point multiplication]] is [[CPU intensive]].<ref>https://www.wireguard.com/papers/wireguard.pdf</ref> |
| Line 10: | Line 10: | ||
* [[Ed25519]] is the [[EdDSA]] signature scheme using [[SHA-512]] ([[SHA-2]]) and [[Curve25519]]. | * [[Ed25519]] is the [[EdDSA]] signature scheme using [[SHA-512]] ([[SHA-2]]) and [[Curve25519]]. | ||
* [[Daniel J. Bernstein]] | * [[Daniel J. Bernstein]] | ||
| + | * [[Wireguard]] | ||
== See also == | == See also == | ||
Latest revision as of 08:33, 3 July 2024
This article is a Draft. Help us to complete it.
wikipedia:Curve25519 (2005)
Computing Curve25519 point multiplication is CPU intensive.[1]
Related terms[edit]
- KexAlgorithms:
ssh -Q kex SERVER - Ed25519 is the EdDSA signature scheme using SHA-512 (SHA-2) and Curve25519.
- Daniel J. Bernstein
- Wireguard
See also[edit]
Advertising:
