Javascript must be enabled to continue!
DEVELOPMENT OF CRYPTOCODE CONSTRUCTIONS BASED ON ALGEBRAIC, LDPC, AND DAMAGE CODES
View through CrossRef
The development of post-quantum technologies calls into question the cryptographic strength of modern symmetric and asymmetric cryptosystems. With the advent of a full-scale quantum computer, such systems will not be able to provide the required level of cryptographic strength (level 5 according to the US NIST scale). The competition of post-quantum algorithms has revealed a tendency towards the construction of cryptosystems based on the synthesis (integration) of security theories with Galois theory. Among the winners of post-quantum algorithms are the crypto-code constructions (CCC) of McEliece and Niederreiter, which make it possible to comprehensively provide the necessary level of protection and increase the level of probability of information transfer. But a significant drawback is the possibility of hacking such systems using linear codes, as well as the need to build them on the Galois field 210–213, which significantly reduces their ability to build systems based on intelligent technologies and mesh networks. The work proposes the use of symmetric CCC (SCCC) based on the Rao-Nama scheme (SCCC R-N) on MEC (modified elliptic codes), LDPC, and damage codes, which makes it possible to significantly reduce the volume of key data (constructing CCC using the Galois field 24–26) while maintaining the level of cryptographic strength of the probability of information transmission (the safe time is equal to the execution time of 1025–1035 elementary group operations). This approach makes it possible to create intelligent information security systems (ISPS). The purpose of the research is to develop post-quantum algorithms based on the integration of theories for constructing cryptosystems of symmetric and asymmetric cryptography with methods for constructing error-resistant codes. This approach allows you to regulate the required level of stability of the cryptosystems based on the requirements for the secrecy of the information message, as well as the time it is stored, and the level of stability of the system as a whole.
Borys Grinchenko Kyiv Metropolitan University
Title: DEVELOPMENT OF CRYPTOCODE CONSTRUCTIONS BASED ON ALGEBRAIC, LDPC, AND DAMAGE CODES
Description:
The development of post-quantum technologies calls into question the cryptographic strength of modern symmetric and asymmetric cryptosystems.
With the advent of a full-scale quantum computer, such systems will not be able to provide the required level of cryptographic strength (level 5 according to the US NIST scale).
The competition of post-quantum algorithms has revealed a tendency towards the construction of cryptosystems based on the synthesis (integration) of security theories with Galois theory.
Among the winners of post-quantum algorithms are the crypto-code constructions (CCC) of McEliece and Niederreiter, which make it possible to comprehensively provide the necessary level of protection and increase the level of probability of information transfer.
But a significant drawback is the possibility of hacking such systems using linear codes, as well as the need to build them on the Galois field 210–213, which significantly reduces their ability to build systems based on intelligent technologies and mesh networks.
The work proposes the use of symmetric CCC (SCCC) based on the Rao-Nama scheme (SCCC R-N) on MEC (modified elliptic codes), LDPC, and damage codes, which makes it possible to significantly reduce the volume of key data (constructing CCC using the Galois field 24–26) while maintaining the level of cryptographic strength of the probability of information transmission (the safe time is equal to the execution time of 1025–1035 elementary group operations).
This approach makes it possible to create intelligent information security systems (ISPS).
The purpose of the research is to develop post-quantum algorithms based on the integration of theories for constructing cryptosystems of symmetric and asymmetric cryptography with methods for constructing error-resistant codes.
This approach allows you to regulate the required level of stability of the cryptosystems based on the requirements for the secrecy of the information message, as well as the time it is stored, and the level of stability of the system as a whole.
Related Results
Generalised array low‐density parity‐check codes
Generalised array low‐density parity‐check codes
In this study, using Group Permutation Low‐Density Parity‐Check (GP‐LDPC) codes, the authors generalise the concept of array Low‐Density Parity‐Check (LDPC) codes from fields of pr...
Novel algorithm to construct QC-LDPC codes for high data rate applications
Novel algorithm to construct QC-LDPC codes for high data rate applications
A novel algorithm to construct highly sparse, quasi-cyclic low-density parity check codes with large girth and high code rates that can be employed in high data rate applications i...
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
Abstract
A number of studies focus on Low-Density Parity-Check (LDPC) codes to ensure reliable data communications. This study proposes an algebraic algorithm to generate s...
Decoding of block and convolutional codes in rank metric
Decoding of block and convolutional codes in rank metric
Décodage des codes en bloc et des codes convolutifs en métrique rang
Les code en métrique rang attirent l’attention depuis quelques années en raison de leur applica...
Editorial Messages
Editorial Messages
Just as it has been continually happening in the world of mathematical sciences, the group of mathematical scientists led by (for example) Professor Eyup Cetin and his colleagues (...
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The Role of Eigenvalues of Parity Check Matrix in Low-Density Parity Check Codes
The new developments in coding theory research have revolutionized the application of coding to practical systems. Low-Density Parity Check (LDPC) codes form a class of Shannon lim...
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
A Convergence Analysis of LDPC Decoding Based on Eigenvalues
Low-density parity check (LDPC) codes are very popular among error correction codes because of their high-performance capacity. Numerous investigations have been carried out to ana...
Quantum XYZ Product Codes
Quantum XYZ Product Codes
We study a three-fold variant of the hypergraph product code construction, differing from the standard homological product of three classical codes. When instantiated with 3 classi...

