Explicit constructions of extremal graphs and new multivariate cryptosystems (Q2834168)
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: Explicit constructions of extremal graphs and new multivariate cryptosystems |
scientific article; zbMATH DE number 6656665
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Explicit constructions of extremal graphs and new multivariate cryptosystems |
scientific article; zbMATH DE number 6656665 |
Statements
Explicit constructions of extremal graphs and new multivariate cryptosystems (English)
0 references
25 November 2016
0 references
post quantum cryptography
0 references
multivariate cryptography
0 references
extremal graph theory
0 references
design of cryptographical systems
0 references
pseudorandom walks
0 references
general cryptographic protocols
0 references
This paper presents descriptions of several new cryptographical algorithms (symbolic version of the El Gamal cryptosystem, its generalisation with the use of permutational representation of the Cremona group, mixed multivariate cryptosystems supported by the classical Diffie-Hellman algorithm). It presents concepts of families of multivariate maps, maps with logarithmically invertible decomposition. Cryptographic applications over a communicative ring are introduced axiomatically.
0 references
