Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
type: Item
instance of: scholarly article
title: Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.
zbMATH Open document ID: 1052.68058
DOI: 10.1016/S0020-0190(00)00173-3
published in: Information Processing Letters
publication date: 2002-07-14T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 1767328
zbMATH Keywords: Computational complexity
zbMATH Keywords: Cryptography
zbMATH Keywords: Discrete logarithm problem (DLP)
zbMATH Keywords: Generic algorithms
zbMATH Keywords: Generic complexity
zbMATH Keywords: Hardcore subsets
author: Claus Peter Schnorr
MaRDI profile type: Publication
cites work: Q4249317
cites work: New directions in cryptography
cites work: A public key cryptosystem and a signature scheme based on discrete logarithms
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Q4856179
cites work: Complexity of a determinate algorithm for the discrete logarithm
cites work: Q4318686
cites work: Efficient signature generation by smart cards
cites work: Q2707405
full work available at URL: s0020-0190(00)00173-3
OpenAlex ID: W2053259405
Wikidata QID: Q127179053
description: scientific article; zbMATH DE number 1767328