Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
type: Item
instance of: scholarly article
title: Reduction of the integer factorization complexity upper bound to the complexity of the Diffie-Hellman problem
zbMATH Open document ID: 1469.11480
published in: Discrete Mathematics and Applications
publication date: 2021-02-26T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 7316008
zbMATH Keywords: integer factorization complexity
zbMATH Keywords: complexity upper bounds
zbMATH Keywords: Diffie-Hellman problem
author: Mikhail A. Cherepnev
MaRDI profile type: Publication
full work available at URL: dma-2021-0001
OpenAlex ID: W3131968114
cites work: On the connection between the discrete logarithms and the Diffie-Hellman problem
cites work: Q3248054
DOI: 10.1515/DMA-2021-0001
Recommended article: On the complexity of the discrete logarithm and Diffie-Hellman problems
Recommended article: Discrete logarithms, Diffie-Hellman, and reductions
Recommended article: Number theoretic methods in cryptography. Complexity lower bounds
Recommended article: Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption
Recommended article: On the oracle complexity of factoring integers
Recommended article: On the Impossibility of Tight Cryptographic Reductions
Recommended article: Improved lower bound for Diffie-Hellman problem using multiplicative group of a finite field as auxiliary group
Recommended article: On the deterministic complexity of factoring polynomials over finite fields
Recommended article: Q4508382
Recommended article: On the number of factorizations of \(t\bmod N\) and the probability distribution of Diffie-Hellman secret keys for many users
description: scientific article; zbMATH DE number 7316008