Skip to content

Sections

Maps Timeline Graph Cosmos Life Culture Innovation People Climate Trends Art

Browse Dictionary Books Food Places Asteroids Search

© 2026 Vinony · Knowledge from Wikipedia, Wikidata, and 27 public APIs.

فرض دیفی-هیلمن · Vinony

🌐فارسی

English Deutsch Français Português فارسی ไทย 中文

EntityQ5275394· pop 6· linked from 40 articles

فرض دیفی-هیلمن

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

problem in cryptography

Available in 6 languages

Français
Deutsch
Português
فارسی
ไทย

via Wikidata sitelinks · CC0

Connections

discrete logarithm

International Association for Cryptologic Research

Categories

Computational hardness assumptions Finite fields

Sources

wikipedia.externallinksexternallink

International Standard Book Number

Entity

digital object identifier

International Standard Serial Number

integer factorization

Whitfield Diffie

Diffie–Hellman key exchange

Martin Edward Hellman

ElGamal encryption

elliptic curve cryptography

one-way function

generating set of a group

Elliptic-curve Diffie–Hellman

Sign in to save

What links here40 pages

Pairing-based cryptography

learning with errors

discrete logarithm

exponential time hypothesis

lattice-based cryptography

Elliptic-curve Diffie–Hellman

ElGamal signature scheme

Integrated Encryption Scheme

computational hardness assumption

Diffie–Hellman key exchange

integer factorization

Similar entities

Discovered by embedding cosine similarity (sentence-transformers MiniLM, 384-dim).

discrete logarithm

Entitydist 0.52

Thomson problem

Entitydist 0.69

Three Prisoners problem

Entitydist 0.69

Entitydist 0.69

Kaadedhdhoo Airport

Entitydist 0.69

P versus NP problem

Entitydist 0.69

Mohamoud Abdi-Gaab

Entitydist 0.69

polynomial-time reduction

Entitydist 0.69

100 prisoners problem

Entitydist 0.70

Kadhdhoo Airport

Entitydist 0.70

knapsack problem

Entitydist 0.70

Entitydist 0.71