Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > PSEUDO-FREE FAMILY OF FINITE COMPUTATIONAL GROUPS:
Reports tagged with pseudo-free family of finite computational groups:
TR12-114 | 15th July 2012
Mikhail Anokhin

Constructing a Pseudo-Free Family of Finite Computational Groups under the General Integer Factoring Intractability Assumption

Revisions: 5

We construct a provably pseudo-free family of finite computational groups under the general integer factoring intractability assumption. Moreover, this family has exponential size. But each element of a group in our pseudo-free family is represented by many bit strings.

more >>>



ISSN 1433-8092 | Imprint