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

Mikhail Anokhin

doi:10.1515/gcc-2013-0003

Published by De Gruyter May 2, 2013

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

Mikhail Anokhin

From the journal Groups - Complexity - Cryptology

https://doi.org/10.1515/gcc-2013-0003

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

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

Abstract.

Journal and Issue

Articles in the same Issue