Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

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

Constructing a pseudo-free family of finite computational groups under the general integer... 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Groups Complexity Cryptology de Gruyter

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

Groups Complexity Cryptology , Volume 5 (1) – May 1, 2013

Loading next page...
 
/lp/de-gruyter/constructing-a-pseudo-free-family-of-finite-computational-groups-under-Hqo77vUUH0
Publisher
de Gruyter
Copyright
Copyright © 2013 by the
ISSN
1867-1144
eISSN
1869-6104
DOI
10.1515/gcc-2013-0003
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Groups Complexity Cryptologyde Gruyter

Published: May 1, 2013

There are no references for this article.