Analysis of a class of easily computable permutations

Authors:
V. G. Skobelev;E. Ye. Zaitseva
Affiliations:
Institute of Applied Mathematics and Mechanics of NAS of Ukraine, Donetsk, Ukraine;Donetsk National University, Donetsk, Ukraine
Venue:
Cybernetics and Systems Analysis
Year:
2008

Citing 2
Cited 0

The Design and Analysis of Computer Algorithms

The Design and Analysis of Computer Algorithms
Nonlinear automata over a finite ring

Cybernetics and Systems Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Properties of easily computable permutations specified in terms of a finite ring are investigated. It is established that problems of parametric identification for this class of permutations are reduced to the resolution of systems of Diophantine equations of sufficiently high degree and to the solution of systems of problems of taking discrete logarithms.