Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption

Abstract

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.