Skip to content
EntityQ5275394· pop 6· linked from 40 articles

迪菲-赫尔曼问题

Sign in to save

Also known as Diffie–Hellman problem (DHP), DHP, DH Problem

problem in cryptography

In the Vinony graph

Vinony's link graph records 40 inbound references to 迪菲-赫尔曼问题, and connects out to discrete logarithm, International Association for Cryptologic Research and International Standard Book Number.

It sits within the topics Computational hardness assumptions and Finite fields.

Vinony links it to 6 Wikipedia language editions.

Available in 6 languages

via Wikidata sitelinks · CC0

Connections

Categories