Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
Mikhail Igorevich Anokhin · journal of Groups complexity cryptology · 2013
We construct a provably pseudo-free family of finite computational groups under the general integer factoring intractability assumption. This family has exponential size. But each element of a group in our pseudo-free family is represented by infinitely many bit strings.