Giesbrecht's algorithm, the HFE cryptosystem and Ore's $p^s$-polynomials (Q4550787): Difference between revisions
From MaRDI portal
Set profile property. |
Changed an Item |
||
(One intermediate revision by the same user not shown) | |||
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 | |||
Property / arXiv ID | |||
Property / arXiv ID: 1611.04479 / rank | |||
Normal rank |
Latest revision as of 19:13, 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