Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials (Q4550787)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Giesbrecht's algorithm, the HFE cryptosystem and Ore's p^s-polynomials |
scientific article; zbMATH DE number 1795737
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials |
scientific article; zbMATH DE number 1795737 |
Statements
10 February 2003
0 references
implementation of Giesbrecht's algorithm
0 references
factoring polynomials
0 references
skew-polynomial ring
0 references
hidden field equation cryptosystem
0 references
math.AC
0 references
0.7779632210731506
0 references
0.7594603896141052
0 references
0.7591425180435181
0 references