The discrete logarithm modulo a composite hides \(O(n)\) bits
type: Item
instance of: scholarly article
title: The discrete logarithm modulo a composite hides \(O(n)\) bits
zbMATH Open document ID: 0790.94013
DOI: 10.1016/0022-0000(93)90038-X
author: A. W. Schrift
author: A. Sharmir
author: Johan Hastad
published in: Journal of Computer and System Sciences
publication date: 1994-06-30T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 65C10
zbMATH DE Number: 529947
zbMATH Keywords: one-way function
zbMATH Keywords: Blum integer
zbMATH Keywords: efficient pseudorandom bit generators
zbMATH Keywords: multibit commitment schemes
zbMATH Keywords: probability distributions
Wikidata QID: Q56959146
MaRDI profile type: Publication
cites work: A Simple Unpredictable Pseudo-Random Number Generator
cites work: An Efficient Probabilistic Public-Key Encryption Scheme Which Hides All Partial Information
cites work: How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
cites work: Probabilistic encryption
cites work: The Differences between Consecutive Primes
cites work: Efficient cryptographic schemes provably as secure as subset sum
cites work: Q5751927
cites work: Efficient Factoring Based on Partial Information
cites work: A method for obtaining digital signatures and public-key cryptosystems
cites work: Q4279590
description: scientific article; zbMATH DE number 529947