Cryptanalysis of the Dickson-Scheme (Q3720458)
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 3950371
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Cryptanalysis of the Dickson-Scheme |
scientific article; zbMATH DE number 3950371 |
Statements
Cryptanalysis of the Dickson-Scheme (English)
0 references
1986
0 references
public-key cryptosystem
0 references
Dickson polynomials
0 references
cryptanalytic attacks
0 references
fixed point attacks
0 references
superencryption procedures
0 references
0.8551652431488037
0 references
0.8499881029129028
0 references
0.8128892183303833
0 references
A new public-key cryptosystem similar to the well-known RSA-scheme is introduced. In this system, named Dickson-scheme, the encryption polynomials \(x^ k\) of the RSA-system are replaced by the so-called Dickson polynomials. In contrast to the RSA-scheme the Dickson-scheme works in residue class rings of the integers \(\mathbb Z\) modulo an arbitrary integer. After a description of the system several possible cryptanalytic attacks on the system are discussed. Especially, fixed point attacks and superencryption procedures are investigated and as a consequence requirements to the key parameters of the Dickson-scheme are formulated, which guarantee the system to be secure from the described attacks. [For the entire collection see Zbl 0583.00050.]
0 references