Description:FORM 2
THE PATENTS ACT, 1970
(39 OF 1970)
&
THE PATENTS RULES, 2003
COMPLETE SPECIFICATION
(See section 10 and rule 13)
1. Title of the invention: “Trimev - Triple Mathematical Expression Variable-key”

2. Applicant:
NAME NATIONALITY ADDRESS
1. Marwadi University
2. Dr. R. Sridaran
3. Mr. Keshav Agrawal
4.Dr. Pankaj Mudholkar Indian Marwadi University, Rajkot-Morbi Road At & PO: Gauridad, Rajkot 360 003 Gujarat, India
Email:
shreedattalawconsultancy@gmail.com
Chothani18preeti@gmail.com
(M) +91 8238022850
3. Preamble to the description
COMPLETE SPECIFICATION
The following specification particularly describes the invention and the manner in which it is to be performed:
Field of the Invention:
The present invention relates to cryptography or information security. The present invention pertains to the development of a new post-quantum cryptography algorithm. More specifically, the present invention is Trimev - Triple Mathematical Expression Variable-key, which is designed to enhance the security of data transmission and communication systems.
Background of the Invention:
Cryptography is a fundamental aspect of modern communication and security. Cryptography algorithms are used to ensure that messages exchanged between two parties remain confidential and secure from unauthorized access. Many existing cryptography algorithms rely on a shared secret key that is generated and exchanged between the parties beforehand. However, the process of exchanging the secret key can be vulnerable to interception and compromise.
Over the years, the field of cryptography has played a crucial role in ensuring secure communication and protecting sensitive information from unauthorized access or malicious attacks. However, with the advancement of technology, particularly the development of quantum computers, traditional cryptographic systems face new challenges. Quantum computers have the potential to break many of the current encryption algorithms, rendering them vulnerable to cyber threats.
In light of these concerns, there is a pressing need for new post-quantum cryptography algorithms that can resist attacks from quantum computers and provide robust security for data transmission and communication. The present invention, Trimev - Triple Mathematical Expression Variable-key, represents an innovative solution designed to address the growing security concerns posed by quantum computing.
These cryptography algorithms use a combination of static and dynamic keys to generate a shared secret key on-the-fly. The dynamic key changes after every 10th character, making it more difficult for attackers to intercept and replicate the key. The proposed invention takes this approach one step further by incorporating two static keys and one dynamic key that is generated after the 10th letter. This approach adds an additional layer of security by making it more difficult for attackers to predict or replicate the dynamic key. The invention could have potential applications in various domains, including secure communication, financial transactions, and online authentication. The algorithm's enhanced security could also be particularly beneficial in high-risk environments where security is of utmost importance, such as military and government communications.
Object of the Invention:
Main objective of the present invention is to design a new cryptography algorithm that is encrypted by dual static key with single dynamic key.
Another objective of the present invention is develop a dynamic key generation process that utilizes the dual keys and output of every 10th character while encrypting text so the key is changed after every 10th character of text.
Yet another objective of the present invention is to evaluate the performance and security of the proposed algorithm.
Yet another objective of the present invention is to compare the proposed algorithm with existing cryptography algorithms in terms of security and efficiency.
Yet another objective of the present invention is to demonstrate the practical application of the proposed algorithm in secure communication, financial transactions, and online authentication.

Yet another objective of the present invention is to explore potential extensions and improvements to the proposed algorithm, such as varying the position of the dynamic key or adjusting the length of the message required to generate the dynamic key.
Summary of the Invention:
The present invention introduces "Trimev - Triple Mathematical Expression Variable-key," a cutting-edge post-quantum cryptography algorithm developed to tackle the growing security concerns brought about by quantum computing. Quantum computers pose a threat to traditional encryption methods, necessitating the development of advanced cryptographic systems resistant to quantum attacks.
The Trimev algorithm employs a triple key system, incorporating two static keys unique to each party and a dynamic key generated based on the plaintext message. The dynamic key evolves after every 10th character, providing an added layer of security against potential attacks.
Utilizing mathematical expressions and ASCII codes of characters, the Trimev algorithm generates the dynamic number used to calculate variables for rail fencing the mathematical expressions. The resulting key is employed for symmetric encryption and decryption of exchanged data.
With potential applications in secure communication, financial transactions, and online authentication, the Trimev algorithm offers enhanced security while ensuring efficient and practical usage. Careful management of the dynamic key generation process and the quality of the static keys are crucial for maintaining the algorithm's security and efficacy.
Brief description of the drwaing:
Figure 1 shows functional Design of the system

Detailed Description of the Invention:
The present invention proposes a new post-quantum cryptography algorithm, "Trimev - Triple Mathematical Expression Variable-key," designed to address the growing security concerns raised by the development of quantum computers. Quantum computers have the potential to break many of the current encryption algorithms, rendering them ineffective. Therefore, there is a pressing need for new cryptographic systems that can resist attacks from quantum computers.
The proposed Trimev algorithm employs a triple key cryptographic system, incorporating two static keys unique to each party and a dynamically generated key after every 10th character of the plaintext message. The dynamic key generation process involves extracting every 10th character of the plaintext and utilizing a key mathematical function that combines the expression key and plain key to generate the dynamic key. This dynamic key changes after every 10th character, enhancing the algorithm's security against potential attacks.
Figure 1 describes about the use cases of our proposed algorithm. Where sender will have two keys mathematical expression key and plain 100-character key. There one mathematical expression used to create sub keys using plain key. Using mathematical key and the ASCII (American Standard Code for Information Interchange) code of character on every 10th place in plaintext will be combined to create the dynamic number which will be used to calculate the variable which used to rail fence the mathematical expression.
Figure 1 describes about the function and module used while forming the algorithm. Here we use two files and one main file. Main.go file is executed after that main.go will call encryption.go for encryptionor decryption.go for decryption. After that these file will execute the comman function like creatingsubkey(), creatingExpressionBlocks(), create2darray(intarray), variable (expresstionblockarray, dynamicnum) which then call the encryption or decryption method for final step where we are going to encrypt or decrypt the plain text.
The proposed system is developed to provide a secured platform for the users to transmit their messages securely. The invention is a new cryptography algorithm that utilizes two static keys and a dynamic key generated after the 10th letter of the plaintext message. To generate the shared secret key, the algorithm uses a key mathematical function that combines the expression key& plain key to generate dynamic key using 10th letter of the plaintext message. The resulting key is then used for symmetric encryption and decryption of the data exchanged between the parties.
The present invention provides an additional layer of security by generating the dynamic key from the plain text message itself, which makes it harder for an attacker to predict or replicate the key. The invention is applied in various domains where the security is a concern, for example, online authentication for financial transactions etc. The innovation aspect of this algorithm is the quantity of the two static keys and one associated dynamic key which is generated randomly.
Steps for Encryption:
1. We will take 100 characters key,
2. Convert characters into ascii code
3. Create a sub key of 5 ascii code each ({ascii1, ascii2, ascii3, ascii4, ascii5}, {ascii6, ascii7, ascii8, ascii9, ascii10}, …….)
4. Apply math function of your choice to each sub key
For example:
Subkey1=ascii1+ascii2-ascii3*ascii4+ ascii5
Subkey2=ascii6+ascii7-ascii8*ascii9+ascii10
.
.
.
Subkey20=ascii96+ascii97-ascii98*ascii99+ascii100.
5. Apply math function of your choice and add some constant values to that expression and also *dynamic number which we will find out after 10 rounds
For Example:
Var [0] = Subkey+subkey2+subkey3*subkey4*subkey5/subkey6+subkey7+subkey8*subkey9+subkey10-……+subkey20+constant 1-constant2+dynamic number.
6. Convert Var [0] into non decimal if it is in the decimal form.
7. Create an array of 100,000 different characters (there should be unique character on different position).
8. Convert the plain text into ascii code
9. Now we will be having the 10rounds of adding the plaintext ascii code with var [0]
Steps for round: -
• Then add each ascii (Ascii code in 10th position obtain from plain text) with var till 10th ascii code (Ascii code in 10th position obtain from plain text) +position of ascii output [1] =ascii code [1] ^ Var [0] ^1
.
.
.
Output [10] =ascii code [10] ^Var [0] ^ 10
• Then to get dynamic number
Suppose we have 210 in asci code [10] so dynamic number will be cal as:
2=2^1^0(xor all its digits)

• Now replace the number with the position (output []) of character in above array or use the Unicode library to convert these number into cipher text.
• Rail fence the expression (math function in step 5) with the dynamic number.
Suppose dynamic number is 2 so
Var [1] = Subkey2*subkey4/subkey6+subkey8+subkey10….+subkey20+subkey+subkey3*subkey5+subkey7*subkey9…..+subkey19+constant1-constant2+dynamic number()
10. Repeat the round again till your last no.
Steps of Decryption
1. We will take 100 characters key,
2. Convert characters into ascii code
3. Create a sub key of 5 ascii code each ({ascii1, ascii2, ascii3, ascii4, ascii5}, {ascii6, ascii7, ascii8, ascii9, ascii10}, …….)
4. Apply math function of your choice to each sub key
For example:
Subkey1=ascii1+ascii2-ascii3*ascii4+ ascii5
Subkey2=ascii6+ascii7-ascii8*ascii9+ascii10
.
.
.
Subkey20=ascii96+ascii97-ascii98*ascii99+ascii100.
5. Apply math function of your choice and add some constant values to that expression and also *dynamic number which we will find out after 10 rounds
For Example:
Var [0] = Subkey+subkey2+subkey3*subkey4*subkey5/subkey6+subkey7+subkey8*subkey9+subkey10-……+subkey20+constant 1-constant2+dynamic number.
6. Convert Var [0] into non decimal if it is in the decimal form.
7. Take the array of 10,00,000 different characters (there should be unique character on different position) defined while doing encryption or you can use Unicode library also.
8. We will now be having the rounds for first 10 characters
• Convert characters into number with respective of their position of character or use the Unicode library if used in previous steps present above array
1. ascii code [1] = output [1] ^var [0] ^1
2. ascii code [2] = output [2] ^var [0] ^2
3. ascii code [3] = output [3] ^var [0] ^3
4. .
5. .
6. .
7. ascii code [10] = output [10] ^var [0] ^10
• dynamic number = Xor of all digits of ascii code [10]
• Rail fence the expression (math function in step 5) with the dynamic number.
Suppose dynamic number is 2 so
Var [1] = Subkey2*subkey4/subkey6+subkey8+subkey10….+subkey20+subkey+subkey3*subkey5+subkey7*subkey9…..+subkey19+constant1-constant2+dynamic number()
9. Repeat the steps 8 till you decrypt last no.
Main embodiment of the present invention a Triple Mathematical Expression Variable-key as post-quantum cryptography algorithm comprising of:
a) Two static keys, unique to each party engaged in data transmission;
b) A dynamic key generation process that generates a dynamic key after every 10th character of the plaintext message;
c) A key mathematical function that combines the expression key and plain key to generate the dynamic key; and
d) Symmetric encryption and decryption of data using the resulting dynamic key;
wherein said algorithm provides a means of securing a data using cryptographic algorithm.
Another embodiment of the present invention an algorithm uses the triple key cryptographic algorithm.
Another embodiment of the present invention a cryptography algorithm develop a dynamic key generation process that utilize the dual keys and output of every 10th character while encrypting text so the key is changed after every 10th character of text.
Another embodiment of the present invention a system is a dynamic key generation process that utilizes the characters of the message to generate a unique key after each 10th character.
Another embodiment of the present invention a system uses cryptographic algorithm which manages the key properly with the feature of ever-changing dynamic key.
Another embodiment of the present invention a method for dynamic key generation in Triple Mathematical Expression Variable-key as post-quantum cryptography algorithm comprising of:
a) Receiving a plaintext message;
b) Extracting the 10th character, and every 10th character thereafter, from the plaintext message;
c) Utilizing the extracted characters to generate a dynamic key through a key mathematical function;
d) Updating the dynamic key after every 10th character; and
e) Applying the dynamic key in symmetric encryption and decryption for secure data transmission.
The present invention is a new cryptography algorithm that utilizes two static keys and a dynamic key generated after the 10th letter of the plaintext message. The two static keys are unique to each party and are kept secret, while the dynamic key is generated by extracting the 10th, and so on every character of the plaintext and using them to generate a key. To generate the shared secret key, the algorithm uses a key mathematical function that combines the expression key& plain key to generate dynamic key using 10th letter of the plaintext message. The resulting key is then used for symmetric encryption and decryption of the data exchanged between the parties.
The advantage of this algorithm is that it provides an additional layer of security by generating the dynamic key from the plaintext message itself, making it harder for an attacker to predict or replicate the key. The algorithm has potential applications in various domains, including secure communication, financial transactions, and online authentication. However, it is important to note that the security of this algorithm depends on the quality of the two keys used by algorithm and the randomness of the dynamic key generation process. Therefore, proper implementation and management of the dynamic key generation process is crucial for the algorithm's security.
In conclusion, developing new cryptography algorithms is essential to maintain the security of information and communication systems. The development of new algorithms can address current challenges such as quantum computing, side channel attacks, key management, and cryptography in distributed environments. New cryptography algorithms can also improve the efficiency and usability of cryptographic systems, making them easier to use for end-users. The scope of studying and developing new cryptography algorithms is broad, and it covers various areas related to information security, including theoretical research, cryptanalysis, implementation, key management, post-quantum cryptography, side channel attacks, and distributed cryptography. Overall, developing new cryptography algorithms is an ongoing process that requires continuous research and development to meet the evolving security needs of information and communication systems. , Claims:We claim,
1. A Triple Mathematical Expression Variable-key as post-quantum cryptography algorithm comprising of:
a) Two static keys, unique to each party engaged in data transmission;
b) A dynamic key generation process that generates a dynamic key after every 10th character of the plaintext message;
c) A key mathematical function that combines the expression key and plain key to generate the dynamic key; and
d) Symmetric encryption and decryption of data using the resulting dynamic key;
wherein said algorithm provides a means of securing a data using cryptographic algorithm.

2. The Triple Mathematical Expression Variable-key as claimed in claim 1, wherein said algorithm uses the triple key cryptographic algorithm.

3. The Triple Mathematical Expression Variable-key as claimed in claim 1, wherein said cryptography algorithm develop a dynamic key generation process that utilize the dual keys and output of every 10th character while encrypting text so the key is changed after every 10th character of text.

4. The Triple Mathematical Expression Variable-key as claimed in claim 1, wherein said system is a dynamic key generation process that utilizes the characters of the message to generate a unique key after each 10th character.

5. The Triple Mathematical Expression Variable-key as claimed in claim 1, wherein said system uses cryptographic algorithm which manages the key properly with the feature of ever-changing dynamic key.

6. A method for dynamic key generation in Triple Mathematical Expression Variable-key as post-quantum cryptography algorithm comprising of:
a) Receiving a plaintext message;
b) Extracting the 10th character, and every 10th character thereafter, from the plaintext message;
c) Utilizing the extracted characters to generate a dynamic key through a key mathematical function;
d) Updating the dynamic key after every 10th character; and
e) Applying the dynamic key in symmetric encryption and decryption for secure data transmission.

Dated 28th July, 2023

Chothani Pritibahen Bipinbhai
Reg. No.: IN/PA-3148
For and on behalf of the applicant