Take the 2-minute tour ×
Cryptography Stack Exchange is a question and answer site for software developers, mathematicians and others interested in cryptography. It's 100% free, no registration required.

Writing my last question, I saw the tag.

I tried to research it best I could, but I'm simply overwhelmed in this field. I don't think it means to simply hash data before signing, but any detail beyond that is beyond me.

Is ed25519 a hash signature with respect to the tag? If so, is it believed to be resistant to quantum computers?

share|improve this question
add comment

1 Answer

up vote 1 down vote accepted

Ed25519 or more general the EdDSA (Edwards-curve Digital Signature Algorithm) approach can be considered as a variant of ElGamal signatures (such as Schnorr or DSA). They all are signatures following the hash-then-sign approach. This simply means that you can sign arbitrary length messages by hashing them to a constant size string using a secure cryptographic hash function and then applying the signing algorithm to the hash value. Such as other ElGamal type signature schemes like ECDSA, when implemented using elliptic curve groups, the security relies on the elliptic curve discrete logarithm problem on the respective curve group.

The hash-then-sign approach, however, must not be confused with quantum resistant hash-based signatures such as Merkle signatures, Lamport signatures or the Winternitz one-time signature scheme. Such signatures do not rely on any (number theoretic) computational hardness assumption such as factoring or discrete logarithm assumption and thus are not susceptible to quantum attacks.

share|improve this answer
Thank you DrLecter! Do you happen to know if any hash-based-signatures have good performance and if any libraries have been written? Thank you so much in advance! –  Gracchus Feb 24 at 22:22
@Gracchus I do not know any concrete libraries. But you may look here for some thoughts. –  DrLecter Feb 24 at 22:30
Very interesting! Thank you for clearing this up for me! –  Gracchus Feb 24 at 23:09
add comment

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.