SYMMETRIC ENCRYPTION USING EVOLVED BIVARIATE FUNCTIONS AND RANDOM KEYS WITH GENETIC ALGORITHM

Abstract

ABSTRACT OF THE INVENTION This invention presents a novel symmetric encryption scheme that utilizes evolved random bivariate functions generated through a genetic algorithm(1 03). By integrating an asymmetric key exchange protocol, such as RSA key-pair generation(1 01 ), the proposed method enhances key management and secures digital communications. The dynamic nature of the evolved functions introduces variability, improving strength against cryptographic attacks while ensuring efficient data transmission. Comprehensive testing and validation will be conducted to assess the effectiveness of the encryption scheme in real-world scenarios. This approach of symmetric encryption coupled with asymmetric key exchange protocol can address the limitations of traditional cryptographic systems, providing a robust solution that meets the security needs of modern digital communication environments.

Specification

DESCRIPTION:
[0001]The invention aims to develop a symmetric encryption scheme that utilizes
evolved random bivariate functions generated through a genetic algorithm. This scheme
will incorporate an asymmetric key exchange protocol, such as RSA key-pair
generation, to enhance digital communication security. By combining these techniques,
the invention seeks to create a robust encryption method that ensures secure key
management and data transmission. The combination of these techniques is expected
to enhance the overall security of the encryption method, making it resilient against
potential attacks while providing efficient data transmission. The invention will also
involve testing and validation of the encryption scheme to ensure its effectiveness in
real-world applications.
PRIOR ART AND BACKGROUND:
[0002] Cryptography has long been a critical field for securing digital communication.
Traditional symmetric encryption methods, such as AES, rely on fixed algorithms that
can become vulnerable over time. Asymmetric key exchange protocols, like RSA
key-pair generation, allow secure key distribution but can face challenges in
performance and scalability. Recent advancements in evolutionary algorithms have
shown promise in generating dynamic and adaptive cryptographic functions.
[0003] Evolved random bivariate functions offer a novel approach by introducing
variability and complexity in the encryption process. Previous research has explored the
integration of genetic algorithms with cryptographic methods, yet gaps remain in their
practical application. Existing systems often lack the combination of both symmetric
encryption and asymmetric key exchange in a cohesive framework. This invention aims
to fill the gaps by ·providing a comprehensive solution that regards the strength of both
symmetric encryption and asymmetric key exchange protocol. The proposed scheme will
increase the security while maintaining efficiency for the digital communication. Thus,
there is a need for· innovative methods that improve upon traditional cryptographic
system through Adaptive techniques.
OBJECTIVE:
[0004] The objective of this invention is to develop a secure symmetric encryption
scheme that utilizes evolved random bivariate functions generated through a
genetic algorithm, integrated with an asymmetric key exchange protocol such as
RSA key-pair generation. This approach aims to enhance digital communication
security, improve key management, and ensure efficient data transmission,
ultimately providing a robust solution that addresses vulnerabilities in traditional
cryptographic methods.
-SUMMARY:
[0005] This invention aims to develop a novel symmetric encryption scheme that
leverages evolved random bivariate functions generated through a genetic
algorithm, enhancing traditional encryption methods. By integrating an
asymmetric key exchange protocol, such as RSA key-pair generation, the
scheme ensures secure key management and robust digital communication. The
use of dynamic and adaptive functions introduces variability, making the
encryption resilient against potential attacks while maintaining efficiency. The
invention will also include comprehensive testing and validation of the encryption
method to confirm its effectiveness in real-world applications. Ultimately, this
innovative approach addresses the limitations of existing cryptographic systems,
providing a comprehensive solution that meets the security demands of modern
digital communication.
DETAILED TECHNICAL DESCRIPTION:
[0006] The invention aims to develop a secure symmetric encryption scheme that
utilizes evolved random bivariate functions generated through a genetic algorithm to
enhance data security in digital, communication. The methodology unfolds in several key
steps: First, a symmetric key is shared between the sender and receiver using the RSA
key-pair generation asymmetric key exchange protocoL The sender then acquires the
plaintext, from which a random bivariate function is selected from a predefined set of
evolved functions. The plaintext is then ciphered using this selected bivariate function
along with the symmetric key to produce the cipher text. Additionally, the inverse of the
bivariate function is transformed into a key-dependent representation. Both the
ciphertext and this key-dependent transformation are transmitted to the receiver in a
structured file. Upon receiving, the receiver uses the cipher information and the
key-dependent transformation to reconstruct the original plaintext securely.
1. Key Exchange and Initialization
[0007] The process begins with establishing a common key between the sender and
receiver using the RSA key-pair g'eneration key exchange protocol. This protocol
enables both parties to generate a shared symmetric key over an insecure channel.
Each participant selects a private key and computes a corresponding public key, which
is then exchanged. By combining their private keys with the received public key, both
parties derive the same symmetric key independently. This ensures that only the sender
and receiver can access the key, forming a secure foundation for subsequent data
transmission.
2. Plaintext Acquisition
[0008] The original plaintext that has to be sent to the receiver is obtained after the
symmetric. key has been exchanged between parties. The sender transforms the
plaintext for transmission. This plaintext, containing information to be ciphered, is
converted to numerals through ascii value replacement. Ensuring the integrity and
clarity of the plaintext is necessary for an effective encryption process .
3. Genetic Algorithm for Evolved Bivariate Functions
[0009] The symmetric encryption scheme leverages genetic algorithms, to evolve a set
of random bivariate functions. The process initiates with a population of random
bivariate functions represented as g(x,y) where x is the plaintext content, say a
character represented as numeral using ascii and y is the numeral representation of the
shared key character. g(x,y) is the actual cipher of the plaintext of p. These bivariate
functions are evaluated based on fitness functions that measure their cryptographic
effectiveness such as non-linearity, confusion, diffusion and along with having the
necessa[001 0] During each generation, the very best bivariate functions are chosen, and
crossovers are computed to create offspring functions that inherit characteristics from
both parent functions. To ensure the diversity and avoid stagnation, mutation operations
are used to create subtle changes to functions. The iterative process continues for
several generations until the functions achieve desired fitness level, resulting in evolved
bivariate functions that are secure and strong for encryption.
4. Selection of Evolved Bivariate Function
[0011] From a set of Evolved functions, the sender randomly selects a bivariate function
for the encryption process. The random selection ensures that each encryption is
unique and unpredictable, enhancing the overall security of the encryption scheme and
also regards corresponding inverse function for the consequent stages of the encryption
process.
5. Encrypiion Process
[0012] The randomly selected bivariate function is used to encrypt the plaintext. The
encryption is represented as c = g(p,k) where c is the ciphertext , p is the plaintext and
k is the shared symmetric key, g is the random bivariate function. The ciphertext is
secure and resistant to unauthorized decryption .
6. Key-Dependent Transformation of the Inverse Function
[0013] The inverse function associated with the actual bivariate function is regarded to
be conveyed to the receiver, denoted by the g-1 is transformed into a key-dependent
representation. This transformation ensures that the receiver can know the inverse
bivariate function to retrieve the plaintext given by T=f(g-l,k) where the T dP.notes the
key-dependent transformation that ensures the decryption on the receiver side.
7. Transmission of Ciphertext and Key-Dependent Information
[0014] The sender then converts the ciphertext and the key-dependent transformation
into a structured format (such as JSON or XML) for secure transmission. This format
facilitates easy parsing and ensures that all necessary information for decryption is
included. The transmission occurs over a secure communication channel, such as TLS,
to protect against eavesdropping and tampering.
8. Decryption and Reconstruction of Plaintext
[0015] The receiver uses the ciphertext and the key-dependent transformation, by
regarding the symmetric key and the transformation, the receiver decrypts the ciphertext
with the inverse bivariate function given by p = g·'(c,k), helps to reconstruct the original
plaintext, enabling the receiver to access the transmitted information securely.
Throughout this process, the integrity and confidentiality of the data are preserved.
BRIEF DESCRIPTION OF THE DRAWING:
Fig 1-Fiowchart which illustrates the sequential steps of the encryption and decryption
process, starting with the RSA key-pair generation key exchange, followed by plaintext
acquisition, encryption using a bivariate function, and the final decryption by the
receiver.
Fig 2-System architecture, showing the sender's processes of plaintext acquisition, key
exchange, and encryption, alongside the receiver's role in decrypting the ciphertext to
recover the original plaintext.
LIST OF REFERENCE NUMERALS
1 01-Component of Flowchart representing Asymmetric Key Exchange Protocol.
1 02-Component of Flowchart representing Acquisition of Plaintext.
1 03-Component of Flowchart representing selecting evolved bivariate functions.
1 04-Component of Flowchart representing Encryption
1 05-Component of Flowchart representing key dependent format of inverse function.
1 06-Component of Flowchart representing the requisites for encryption.
107-Component of Flowchart representing decryption .
201-Responsible for initiating communication and acquiring plaintext.
202-Receives encrypted data and initiates the decryption process .
203-Executes RSA key-pair generation key exchange and applies the bivariate function
for encryption.
204-Utilizes the inverse function to decrypt the ciphertext and recover the original
plaintext.

CLAIM:
WE Claim,
1. A system for secure digital communication, comprising:
a) a sender configured to encrypt plaintext and convert it into a ciphertext;
b) a receiver configured to decrypt the ciphertext using the reconstructed
inverse function.
2. The system as mentioned in claim 1, wherein the random bivariate function(1 03) is
evolved to enhance non-linearity and security properties using genetic algorithm.
3. The system as mentioned in claim 1, wherein the key-dependent representation of
the inverse function is generated by a function(1 05) that combines the inverse
function and the shared key.
4. The system as mentioned in claim 1, wherein the receiver can reconstruct the
inverse function(1 07) from the key-dependent representation using the shared key.
The receiver applies the reconstructed inverse fu11ction to the ciphertext to retrieve
the original plaintext data.

Documents