Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems (Q5282753)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6747407
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems |
scientific article; zbMATH DE number 6747407 |
Statements
Cryptanalysis of public key cryptosystems based on non-Abelian factorization problems (English)
0 references
14 July 2017
0 references
stream cipher
0 references
pseudorandom sequence
0 references
generalized cyclotomy
0 references
linear complexity
0 references
0.96948326
0 references
0.9673062
0 references
0.9647329
0 references
0.9604509
0 references
0.95786315
0 references
0.9543317
0 references
0.95203674
0 references
0.95179397
0 references
