No label defined (Q3713987)

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 3941423
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 3941423

      Statements

      1985
      0 references
      rational functions
      0 references
      permutations of residue class rings
      0 references
      survey
      0 references
      Vernam's one-time-pad
      0 references
      public-key cryptography
      0 references
      RSA-public-key cryptosystem
      0 references
      power-polynomial functions
      0 references
      Dickson-polynomial functions
      0 references
      Rédei- functions
      0 references
      signatures
      0 references
      choice of key parameters
      0 references
      cryptanalysis
      0 references
      [For the entire collection see Zbl 0559.00002.] The paper gives a survey on the applications of polynomial functions in modern cryptology. At the end of a short historical introduction, Vernam's one-time-pad with random numbers is introduced. A discussion of the advantages and disadvantages of classical encryption methods leads to public-key cryptography, which was evolved by \textit{W. Diffie} and \textit{M. E. Hellman} [IEEE Trans. Inf. Theory IT-22, 644-654 (1976; Zbl 0435.94018)]. The mathematical background of public-key cryptosystems is discussed and a survey on existing systems is given. It turns out that the RSA-public-key cryptosystem (proposed by \textit{R. L. Rivest}, \textit{A. Shamir} and \textit{L. Adleman} [Commun. ACM 21, 120-126 (1978)]) which uses power-polynomial functions as cipher functions, and RSA-type cryptosystems using Dickson-polynomial functions and Rédei-functions as cipher functions are today's most important public-key cryptosystems. The problem of signatures and the choice of key parameters in RSA-type cryptosystems are discussed. A cryptanalysis of these systems and a remark on other applications of polynomials and polynomial functions in modern cryptology conclude the paper.
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references