"Constructing a pseudo-freefamily of finite computational groups under the ..."

Mikhail Anokhin (2019)

> Home

Details and statistics

DOI: 10.1515/GCC-2019-2009

access: closed

type: Journal Article

metadata version: 2020-07-09

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/gcc/Anokhin19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/gcc/Anokhin19
Mikhail Anokhin:
Constructing a pseudo-freefamily of finite computational groups under the generalinteger factoring intractability assumption. Groups Complex. Cryptol. 11(2): 133-134 (2019)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.