On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition
From MaRDI portal
Publication:2960378
DOI10.2478/umcsinfo-2014-0001zbMath1391.94803OpenAlexW2052718662MaRDI QIDQ2960378
No author found.
Publication date: 9 February 2017
Full work available at URL: http://journals.umcs.pl/ai/article/view/3387
Related Items (1)
Uses Software
Cites Work
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Compactness results in extremal graph theory
- On the comparison of cryptographical properties of two different families of graphs with large cycle indicator
- Multivariate public key cryptosystems
- On Dynamical Systems of Large Girth or Cycle Indicator and Their Applications to Multivariate Cryptography
- On Extremal Graph Theory, Explicit Algebraic Constructions of Extremal Graphs and Corresponding Turing Encryption Machines
- A new series of dense graphs of high girth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On Multivariate Cryptosystems Based on Computable Maps with Invertible Decomposition