Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials (Q4550787): Difference between revisions
From MaRDI portal
Set profile property. |
Changed label, description and/or aliases in en, and other parts |
||
| label / en | label / en | ||
Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials | |||
| Property / arXiv classification | |||
math.AC | |||
| Property / arXiv classification: math.AC / rank | |||
Normal rank | |||
Revision as of 16:58, 19 April 2024
scientific article; zbMATH DE number 1795737
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
