LCS Publication Details
Publication Title: ON BPP
Publication Author: Zachos, Stathis
Additional Authors: Heller, Hans
LCS Document Number: MIT-LCS-TM-252
Publication Date: 12-1-1983
LCS Group: No Group Specified
Additional URL: No URL Given
Many arguments in the theory of cryptography make use of probabilistic algorithms. The goal is to construct, if possible, (secure) schemes, which cannot be broken by probabilistic algorithms. The assumption is that problems solvable by probabilistic algorithms are easy or tractable; supposedly well below NP-complete problems. But in reality little is known about power of such probabilistic e.g. BPP-algorithms.
To obtain this publication:

    To purchase a printed copy of this publication please contact MIT Document Services.