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

Mikhail Anokhin

Open Access

https://doi.org/10.1515/gcc-2019-2009

Copy DOI

Journal: Groups Complexity Cryptology	Publication Date: Oct 15, 2019
Citations: 2

Abstract

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

Full Text

Published version (

Free)

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Paper Title

Journal

Date

Author