Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.

DOI10.1016/S0020-0190(00)00173-3zbMath1052.68058OpenAlexW2053259405WikidataQ127179053 ScholiaQ127179053MaRDI QIDQ1603445

Claus Peter Schnorr

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(00)00173-3

zbMATH Keywords

CryptographyComputational complexityDiscrete logarithm problem (DLP)Generic algorithmsGeneric complexityHardcore subsets

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Efficient signature generation by smart cards
• Complexity of a determinate algorithm for the discrete logarithm
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Probability Inequalities for Sums of Bounded Random Variables
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Small generic hardcore subsets for the discrete logarithm: short secret DL-keys.