Skip to main content
Conference ProceedingsOPEN ACCESS

All bits in ax + b mod p are hard: Extended abstract

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1996) 1109 114-128
DOI: 10.1007/3-540-68697-5_10
15Citations
Citations of this article
34Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we show that for any one-way function f, being able to determine any single bit in ax + b mod p for a random Ω(|x|)-bit prime p and random a, b with probability only slightly better than 50% is equivalent to inverting f(x).

Cite

CITATION STYLE

APA

Näslund, M. (1996). All bits in ax + b mod p are hard: Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1109, pp. 114–128). Springer Verlag. https://doi.org/10.1007/3-540-68697-5_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free