Arrow Research search
Back to STOC

STOC 1983

How Discreet is the Discrete Log?

Conference Paper Accepted Paper Algorithms and Complexity · Theoretical Computer Science

Abstract

Blum and Micali [4] showed how to hide one bit using the discrete logarithm function. In this paper we show how to hide c •loglog p bits for any constant c , where p is the modulus.

Authors

Keywords

No keywords are indexed for this paper.

Context

Venue
ACM Symposium on Theory of Computing
Archive span
1969-2025
Indexed papers
4364
Paper id
577664058719165472
v2026.09.13