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... AbstractWe provide a correct version of Remark 3.5 of thepaper mentioned in the title. Also, we fix a typo inRemark 4.4 of that paper. 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

Anokhin, Mikhail
Groups Complexity Cryptology , Volume 11 (2): 2 – Nov 1, 2019
Download PDF
2 pages

Loading next page...
 
/lp/de-gruyter/constructing-a-pseudo-free-family-of-finite-computational-groups-under-ew7Qg2JCnJ

References (1)

Publisher
de Gruyter
Copyright
© 2019 Walter de Gruyter GmbH, Berlin/Boston
ISSN
1869-6104
eISSN
1869-6104
DOI
10.1515/gcc-2019-2009
Publisher site
See Article on Publisher Site

Abstract

AbstractWe provide a correct version of Remark 3.5 of thepaper mentioned in the title. Also, we fix a typo inRemark 4.4 of that paper.

Journal

Groups Complexity Cryptology – de Gruyter

Published: Nov 1, 2019

There are no references for this article.