On multivariate cryptosystems based on maps with logarithmically invertible decomposition corresponding to walk on graph

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

The paper illustrates the concept of the map with logarithmically invertible decomposition. We introduce families of multivariate cryptosystems such that there security level is connected with discrete logarithm problem in Cremona group. The private key of such cryptosystem is a modification of graph based stream ciphers which use stable multivariate maps. Modified version corresponds to a stable map with single disturbance. If the disturbance (or initial condition) allows fast computation then modified version is almost as robust as original one. Methods of modification improve the resistance of such stream ciphers implemented on numerical level to straightforward linearisation attacks.

Cite

CITATION STYLE

APA

Ustimenko, V. (2014). On multivariate cryptosystems based on maps with logarithmically invertible decomposition corresponding to walk on graph. In 2014 Federated Conference on Computer Science and Information Systems, FedCSIS 2014 (pp. 631–637). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.15439/2014F269

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free