A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Dynamical systems as the main instrument for the constructions of new quadratic families and their usage in cryptography

2012
*
Annales UMCS Informatica
*

Let K be a finite commutative ring and f = f (n) a bijective polynomial map f (n) of the Cartesian power K n onto itself of a small degree c and of a large order. Let f y be a multiple composition of f with itself in the group of all polynomial automorphisms, of free module K n . The discrete logarithm problem with the "pseudorandom" base f (n) (solve f y = b for y) is a hard task if n is "sufficiently large". We will use families of algebraic graphs defined over K and corresponding dynamical

doi:10.2478/v10065-012-0030-2
fatcat:uxqalhfbvfao7kgvuwht4dpjye