Showing a limited preview of this publication:
Abstract.
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.
Keywords: Computational group; pseudo-free family of finite
computational groups; general integer factoring
intractability assumption; variety of groups
Received: 2012-10-14
Published Online: 2013-05-02
Published in Print: 2013-05-01
© 2013 by Walter de Gruyter Berlin Boston