ES2935191A1 - Palindrome-hybrid cryptographic processing method and system, to encrypt/decrypt messages and data in programmable devices or machines (Machine-translation by Google Translate, not legally binding) - Google Patents

Abstract

Method and system, of palindromo-hybrid cryptographic processing, to encrypt/decrypt messages and data in high security computing devices/machines. The method comprises: a hybrid of virtual Enigma machine cylinders in ASCII code, a transformation matrix into pseudo RNA codons and a set of operons, which is inserted into the message itself. Finally, the message is introduced into a pseudo-random structure, thus creating its own and different language before transmitting it. The nature of the system allows to read/execute/interrupt the transmitted data, during the transmission process. (Machine-translation by Google Translate, not legally binding)

Description

DESCRIPTION

Palindrome-hybrid cryptographic processing method and system, to encrypt/decrypt messages and data in programmable devices or machines

Technical sector

Telecommunications, computing, information security, any system that requires the secure transmission of data

Background of the invention

The need to hide information from third parties is a constant in human history. Cryptography, a science that is based on writing codes and encryption to protect communications; it is one of the most important elements that make modern cryptocurrencies and blockchains possible. The cryptographic techniques that are used today, however. they are the result of an incredibly long development history. World War II would bring with it the perfect example of analog cryptography: the Enigma machine. The Enigma machine would be deciphered thanks to early advances in computing, however. There are still cryptographic systems based on the Enigma machine (Enigma System, US 10,820,089 (2020) and Virtual Enigma Cipher US 10,972,253 B2 (2021). The simplicity of these systems, which maintain the linguistic structure of the original language, makes them easily amenable to decryption.

The need for security in communications has given rise to thousands of patents for encryption/decryption processes. Almost all international telecommunication companies have their own developments for document and data encryption (Mitsubishi Co. WO11062136 (2011) and WO 13133158 (2013), Nokia Co. EP2 270 628 (1999), Nagravision Co. EP 2 955871 (2019) and AU 2015202994 A1, Certco Inc. (1994) US181859), and a long etcetera... In all cases and regardless of the patent in question, the problems to be solved are 3/0004/0542) and it has to be resistant to classical decryption methods without consuming huge computational time resources (The failure of the digital computer. Adam N. Roseenburge,(2022) http://www.the-adam.com/adam/rantrave/computers .html This is so true that even slowing down the transfer rate of a computer device has been the subject of a patent (ES 2363355 Al).

Most of the solutions to the dilemma on the market use symmetric or asymmetric cryptography with cryptogram generation systems using RSA, DES or SHAI algorithms; the most advanced use hash equations, at the cost of greatly increasing processing time.

An option that is gaining popularity among security system developers are hybrid systems, which combine the advantages of the previous ones, the speed of symmetrical systems and the security of asymmetrical ones. (Hybrid Cryptography Technique for Improving Network Security. V. Kapoor and R. Yadav. International Journal of Computer Applications. (2016) Vol 141 n°11 25-30). Patents for such systems are quite widespread (Method and hybrid system for authenticating communications. (2005) US 2005/0114650 A1, Hybrid public key encryption scheme based on quadratic residue groups. (2007) KR100778057B1 and Data hybrid encryption method. (2018). CN108270565A).

Most of these systems are quite cumbersome, square roots are huge consumers of computational time and do not provide sufficient protection. A strategy that gains efficiency and time is to use systems that are already present in all computer equipment such as ASCII coding (Developing a Cryptographic Algorithm Base with ASCII Conversions and a Cyclic Mathematical Function. (2014) P.Uddin, A.Marjan, NB Sadia and R.Islam. 3rd International Conference on Informatics, Electronics & Vision 978-1-4799-5180-2/14/$31.00 @2014 IEEE). However, its practical application requires a high number (n) of encryption rounds. If a minimum of security is desired, since it acts as the bowler hat of a safe. (Symmetric encryption method. (2014) CN 104022871A).

Since the complete sequencing of human DNA and the completion of the Human Genome project (April 6, 2000), patents using genetic coding (A, T, C, and G) have multiplied, directly in synthetic molecules or in their virtual analogues, as a method of encrypting information. (CN 101719908 A, CN 103114127 A, CN 103856329 A, CN 109617673 A, CN 102025482 A, CN 105046634 A, KR 10-2018-0136407 A, US 6,312,911 B1, US 3817/03 A). Most of these patents, from Asian companies or research centers, are based on the power of DNA, as a way of compressing information, and on the fact that the control codes (Operons, Introns and Trasposons) of the genetic code are well known. The use of RNA as a form of information encryption has also been postulated, although not patented (Encrypted messages in biological processes (2018) Department of Molecular Biology and Genetics, Aarhus University, Denmark)

Another trend in Cryptography is the use of random number generators to "hide" information among the numerical chaos. This strategy, although very secure, gives rise to very long processing times, which makes its application very cumbersome. (US 2007/0294508 Al, US 11,146,387 B1, US 2008/0025505 Al, and US 10,778,413 B2)

The latest star trend is quantum encryption, using the quantum entanglement effect of Einstein, Podolsky and Rosen and the wave-particle duality, the creation of a theoretically insurmountable quantum distribution key (QKD) can be achieved, since it only reveals the distribution when the recipient reads the information. (WO 2015/092479 Al). This system suffers from the variability inherent to the quantum world and the slightest variation in the environment of the equipment (vibrations, radiation, thermal changes) can give rise to cumulative errors. This implies massive equipment that is hardly compatible with current computer equipment.

Although very few, there are some proposals that combine different superimposed (palindromic) encryption systems. The theoretical development of Marcial Castillo L.R., Basurto Munguia E.L., Rivera Martinez M. and Sandoval Solis M. de L. from the Benemérita Universidad Autónoma de Puebla (Symmetrical cryptographic method, using chaos theory, operations on DNA and roots of non-linear functions (2016) (Research in Computing Science 128 pp 21-34), which uses three of the aforementioned systems (Random, DNA and non-linear functions) and the American patent of Carlos Enrique Brathwaite (US 2018/ 0288005 Al (2018)) that uses ASCII code and DNA-amino acid transcription to encode messages as proteins and inversely to decode them.

Explanation of the invention

The invention that is presented is a palindrome-hybrid cryptographic processing method and system, to encrypt/decrypt messages and data in computing devices. The system consists of a symmetrical transition of circular ASCII code that can consist of as many cylinders as desired, in the manner of an Enigma machine. The code thus obtained is transformed into n matrices of numerical pseudo-codons obtained by a random number generator, controlled by a set of operons/introns/transposons, as if it were a pseudo-RNA, defined by the user and that constitute the key that can be public or self-defined. Finally, the entire message is assembled in a random structure before its transmission. The system is therefore homomorphic (same input and output).

The security level and the distribution of the keys can be redefined at the time of the message issuance, thus also controlling the computer processing time of the encryption/decryption.

Brief description of the drawings

1) Introduction of the operons, as non-alphanumeric codes, transformation of the entire text/data packet through an ASCII ring/enigma cylinder.

2) Pseudo codon matrix (RNA structure)-Transformation of the pure numerical code obtained in (1) into a codon matrix(es) of 5 or more digits obtained randomly.

3) The information of the matrix(es), the number of ASCII cylinders and their displacements is transformed into the public key. The definition of operons in private.

4) According to the orders encoded in the operons, pseudorandom sequences are added to the numerical sequence before transmission.

5) In transit and/or reception and after recognizing the operons, the pseudorandom sequences are eliminated.

6) With the public and private keys, the codon matrix is inverted to the numerical sequence. 7) With the public and private keys, it is passed through the ASCII ring/Enigma Cylinder to obtain the alphanumeric sequence.

8) By removing the inserted operons, the original Texts/Data are recovered.

Preferred embodiment of the invention

The object of the present invention, at least as a preferred embodiment, is to solve, in part, the drawbacks caused by the possible decryption of the transmission of encrypted information. To this end, the present invention proposes a method, for the secure exchange of data, between at least two points, which involves the implementation of a cryptographic process that is particularly complex. By way of example of the invention, the secret keys, which are shared by all the devices of the same system as a symmetric key, are never used directly as a message encryption/decryption key. In fact, the key used to encrypt/decrypt the messages exchanged between the devices of the same system always depends on two unpredictable aspects: the presence of non-alphanumeric codes that are in themselves operating instructions for the system (such as DNA operons) and a plurality of random numbers, in particular. More specifically, each device generates at least one number that must be taken into account to determine the key used to encrypt/decrypt the messages exchanged and at least one numeric matrix of 240 terms (ASCII). Therefore, if the system consists of three security blocks; the choice of operons, the number of ASCII/Enigma cylinders and their displacements, and the exchange matrix or matrices. said key will depend on at least three separate sets of data.

In addition, the desired level of complexity can be determined, additionally before encrypting/decrypting the message to be exchanged; the number of ASCII/Enigma cylinders can be increased and the number of matrices can be increased. Additionally, instead of a set of 8 initial orders in the form of operons, these orders can be increased, indefinitely (at the cost of increasing computer processing time). Accordingly, the present method involves three key levels to encrypt/decrypt the messages. In addition, the message to be exchanged is never directly used as input to the algorithm to generate the cryptogram to be sent, but is always used with a set of random numbers, to first generate a pseudo-message that will then be added to the generated message, by the aforementioned cryptographic algorithm. Preferably, the random numbers are renewed every time a message has to be exchanged. Consequently, the present invention prevents any malicious person from guessing the shared secret keys, through any attack that involves a differential analysis of failures. Additionally. Thanks to the complexity provided, both by the pseudo-message, and by the derived keys used for encryption, the cryptographic method of the present invention achieves a particularly high level of security.

Said invention therefore provides a cryptographic method for exchanging information securely between elements with computing capacity that are part of at least one machine, each of which stores a shared secret key, common to said devices.

In another example, the transmission can be digital, reducing the alphanumeric codes to mere 1, 0 and operons, not being necessary to go through the ASCII/ENIGMA cylinders.

In general, this invention provides a cryptographic device to implement the cryptographic method, as described in this document, which comprises several components that include at least one communication interface for data exchange, a secure memory to store a shared secret key, a random generator for generating random numbers, at least one calculation unit that outputs the result of an operation using operands as inputs, at least one cryptographic unit for executing algorithms using at least one cryptographic key, and a processing center, in charge of managing said components according to the steps of said cryptographic method.

As it is a homomorphic method, decryption can be performed during transmission, which would allow users to interpret, execute, monitor and/or

block the transmission of the message.

Finally, the present invention can also be used to encrypt the programs themselves, when they carry the encryption algorithms to the input and output of said computer programs, in any language that supports them.

Claims (11)

1. A method and system, to provide cryptography to any transmission of information that comprises instructions for a processing unit to transmit or receive encrypted information according to said procedure, by means of a virtual cryptographic machine. A tamper-evident system, at shipment, that protects unauthorized third-party cryptographic processing and data, as well as the computer instructions for operating the virtual cryptographic machine. 2. The product of claim 1 in which a combination of the ASCII code and the cylinders of the enigma machine are used for the previous transformation of the alphanumeric data into numerical codes. 3. The product of claim 1, wherein the numerical data obtained in claim 2 are transformed into numerical sequences obtained by a random number generator, by means of a matrix transformation. 4. The product of claim 1, to which non-alphanumeric codes (operons) are added, which correspond to reading and processing instructions included in the message itself as if it were a base pair language (DNA, RNA). . 5. The product of claims 1, 2 and 3 to which is added a pseudo-message generated by a random number generator, following the instructions of claim 4. The product of claim 1 wherein the various generated keys are inside or outside the virtual cryptographic machine. The product of claim 1 wherein additionally encrypted keys and data can be stored within a memory space of the virtual cryptographic machine or in an external memory space (a new storage). 8. The product of claim 1 regardless of the information transmission medium and the structure of the data stream. 9. The product of claims 1,2,3,4 and 5 in which the complexity is increased by increasing the number of variations involved. 10. The product of claim 1, wherein the encryption/decryption occurs during data transmission, allowing the interpretation, execution, monitoring and eventual blocking or deletion of the transmitted data. 11. A means readable by any programmable device or machine, which stores software, to carry out the encryption/decryption through any of the preceding claims.