Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
type: Item
instance of: scholarly article
title: Fast generators for the Diffie-Hellman key agreement protocol and malicious standards
zbMATH Open document ID: 1184.94261
author: Boaz Tsaban
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 5664474
zbMATH Keywords: Diffie-Hellman problem
zbMATH Keywords: discrete logarithm problem
zbMATH Keywords: fast generators
zbMATH Keywords: trapdoor
zbMATH Keywords: cryptography
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.11.025
OpenAlex ID: W2158179513
cites work: Q3840150
cites work: Generating EIGamal Signatures Without Knowing the Secret Key
cites work: New directions in cryptography
cites work: Separating decision Diffie-Hellman from computational Diffie-Hellman in cryptographic groups
cites work: The Relationship Between Breaking the Diffie--Hellman Protocol and Computing Discrete Logarithms
cites work: An improved algorithm for computing logarithms over&lt;tex&gt;GF(p)&lt;/tex&gt;and its cryptographic significance (Corresp.)
cites work: Security Proofs for Signature Schemes
cites work: A hidden number problem in small subgroups
cites work: Q4536273
DOI: 10.1016/J.IPL.2005.11.025
description: scientific article; zbMATH DE number 5664474