SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k (Q6136919)
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: SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k |
scientific article; zbMATH DE number 7790470
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k |
scientific article; zbMATH DE number 7790470 |
Statements
SECURITY OF PUBLIC KEY ENCRYPTION USING DICKSON POLYNOMIALS OVER FINITE FIELD WITH 2k (English)
0 references
18 January 2024
0 references
Dickson polynomial
0 references
integer factorization problem
0 references
discrete Dickson problem
0 references
discrete logarithm problem
0 references
encryption scheme
0 references
0.8061145544052124
0 references
0.7974823117256165
0 references
0.7941765785217285
0 references
0.78721022605896
0 references
