0

The automated inverse theory in cryptography, points to autonomous finite automata, which is relative to the canonical form for one-key cryptosystems based on finite automata, the public key encryption based on finite automata for one-key cipher can be executed by finite automata.
A finite automaton is considered as a natural model for ciphers. The method of converting Ra Rb has been introduced to deal with the structural problem of such automata; then, the public key encryption based on finite automata and a focal type for one key cipher that can be executed by finite automates with limited error propagation and without spreading data is provided.

What is the application of Finite Automata in cryptography?

Mike Edward Moras
  • 18,161
  • 12
  • 87
  • 240
R1w
  • 1,960
  • 4
  • 23
  • 45

2 Answers2

3

In the area of symmetric cryptography , finite automaton have been applied to model the additive differential probability of exclusive-or and the differential analysis of S-function ref 1 ref 2

another example of automata application on linear model of modular addition ref

hardyrama
  • 2,288
  • 1
  • 17
  • 41
0

You can find the Znàm's problem which following Wikipedia have application in Non deterministic automaton and so in cryptography and this.

Related reference are Brocard-Ramanujan's problem since :

$$5040/7^2+1/7=103,5041=71^2$$

Here I gave a sketch of proof in a special case which can be extend using Selberg sieve see Sum of two squares problem

Other point of view :

At the crossroads with these differents fields there is also the matrix for a near reference see

Homomorphic Encryption for Finite Automata

As other key-words : Hermitian matrix

Miss and Mister cassoulet char
  • 145
  • 5