Information | |
---|---|
has gloss | eng: The computational Diffie–Hellman (CDH assumption) is the assumption that a certain computational problem within a cyclic group is hard. |
lexicalization | eng: Computational Diffie-Hellman assumption |
lexicalization | eng: Computational Diffie–Hellman assumption |
instance of | c/Computational hardness assumptions |
Lexvo © 2008-2025 Gerard de Melo. Contact Legal Information / Imprint