Difference between revisions of "Curve25519"
Jump to navigation
Jump to search
↑ https://www.wireguard.com/papers/wireguard.pdf
| (4 intermediate revisions by the same user not shown) | |||
| Line 1: | Line 1: | ||
{{Draft}} | {{Draft}} | ||
| − | [[wikipedia:Curve25519]] | + | [[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> |
== Related terms == | == Related terms == | ||
* [[KexAlgorithms]]: <code>ssh -Q kex SERVER</code> | * [[KexAlgorithms]]: <code>ssh -Q kex SERVER</code> | ||
| − | * [[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]] | ||
== See also == | == See also == | ||
Latest revision as of 05:57, 30 August 2022
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
See also[edit]
Advertising:
