Application of finite automata in cryptography

Sharipbay, Altynbek; Сауханова, Ж С; Shakhmetova, Gulmira; Saukhanov, Nurgazy

doi:10.1145/3330431.3330452

Cited by 5 publications

(3 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the paper [2], proposed by Kearns Michael and Valiant Leslie in the year 1994, the paper showed how a constant depth threshold circuit, DFA, has significant cryptographic and number theory implications. Application of finite automata in cryptography [3], by A.A.Sharipbay, Zh.S.Saukhanova, G.B.Shayakhmetova and N.S.Saukhanov explain key ideas in symmetric and asymmetric cryptosystems.…”

Section: Literature Reviewmentioning

confidence: 99%

See 1 more Smart Citation

Cryptography using Automata Theory

Vayadande¹,

Agarwal²,

Kabra³

et al. 2022

ITM Web Conf.

View full text Add to dashboard Cite

Encryption and decryption are the two most crucial components of cryptography. Data protection is the main objective of both systems. We utilised encryption to transform plain text into ciphertext. Decryption, which works the other way around from encryption, is the process of converting encrypted text back into plain text. By using a finite state machine and the LU decomposition method, the created encryption solution ensures data secrecy for safe communication. In our suggested approach, we additionally employ lower and upper triangular matrices, which are obtained by decomposing a square matrix. During encryption, the key will be a lower triangular matrix modulated by a prime number, and during decryption, an upper triangular matrix modulated by a prime number. The tactic is beneficial. This tactic is helpful in sectors such as finance and military services where confidential material must be delivered.

show abstract

Section: Literature Reviewmentioning

confidence: 99%

“…In the opposite direction of encryption, decryption is the process of transforming encrypted text into plain text. [1,2]. Someone who works with encryption and decoding is referred to as a "cryptographer."…”

Section: Introductionmentioning

confidence: 99%

Cryptography using Automata Theory

Vayadande¹,

Agarwal²,

Kabra³

et al. 2022

ITM Web Conf.

View full text Add to dashboard Cite

show abstract

“…In (Sharipbaev et al, 2006;Sharipbay et al, 2017;, applications of finite automata (FA) in cryptography and general idea of information encryption by means of FA with output and FA without output were described. In (Shakhmetova, 2018;Shakhmetova et al, 2019), issues of using automata models without exit in cryptography were discussed, advantages and disadvantages of such models as the Domosi cryptosystem and its improved version were presented.…”

Section: Introductionmentioning

confidence: 99%

Development of Reliable and Effective Methods of Cryptographic Protection of Information Based on the Finite Automata Theory

SHARIPBAY,

SAUKHANOVA,

SHAKHMETOVA

et al. 2023

EPSTEM

View full text Add to dashboard Cite

This paper describes project to conduct study of cryptographic protection of information on publications in publications and development of methods for reliable and efficient cryptographic protection of information based on finite automaton models-FAM, preparation of additions to standards and management of dissertations of undergraduates and doctoral students on information security and information protection. To achieve this goal, following tasks will be solved: 1. Study of mathematical foundations of cryptology and analysis of standards for cryptographi. Results: Theory of finite fields, models of FA, descriptions of requirements of standards, proposals to standards. 2. Study of applicability of various FA models in construction of reliable and efficient cryptoalgorithms. Results: Algorithm for obtaining an inverse FA from given FAproving applicability of FA in cryptosystem, algorithm for composing several FA -proving increase in reliability of cryptosystem using composite FA with increased number of states, algorithm for constructing equivalent FAproving increase in efficiency of cryptosystems using equivalent FA with reduced number of states. 3. Development and verification of programs for reliable and efficient cryptosystem based on KA. Results: FA cryptographic programs and their applications in steganography, verification and testing protocols for developed programs.

show abstract

Turing Machine based Syllable Splitter

Mallik

Khetarpal

2021

2021 Fourth International Conference on Computational Intelligence and Communication Technologies (CCICT)

View full text Add to dashboard Cite

Application of finite automata in cryptography

Cited by 5 publications

References 6 publications

Cryptography using Automata Theory

Cryptography using Automata Theory

Development of Reliable and Effective Methods of Cryptographic Protection of Information Based on the Finite Automata Theory

Turing Machine based Syllable Splitter

Contact Info

Product

Resources

About