Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
type: Item
instance of: scholarly article
title: Constructing a pseudo-free family of finite computational groups under the general integer factoring intractability assumption
zbMATH Open document ID: 1286.68174
author: Mikhail Anokhin
publication date: 2014-01-23T00:00:00Z
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 11Y05
Mathematics Subject Classification ID: 20E10
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6249756
zbMATH Keywords: computational group
zbMATH Keywords: pseudo-free family of finite computational groups
zbMATH Keywords: general integer-factoring intractability assumption
zbMATH Keywords: variety of groups
MaRDI profile type: Publication
full work available at URL: gcc-2013-0003
OpenAlex ID: W2024685286
DOI: 10.1515/GCC-2013-0003
published in: Groups, Complexity, Cryptology
description: scientific article; zbMATH DE number 6249756