CN1472914A - High performance and quick public pin encryption - Google Patents

Abstract

The present invention relates to a fast and high efficient public key encrypting method. The two parties of communication are A and B, they have the private keys and public keys respectively, which are stored in the trustable verification center of the third party. 1. A produces randomly one of some temporary secret-key and encrypts the private information using the symmetric secret-code encrypting system to acquire encrypted file; 2. A converts the secret-key selected presently into an assigned file using the secret-key assigning technique of the public key secret-code system and using the public key of the receiving part B, and then transmits the secret-key assigning file and encrypted file to the receiving party; 3. The receiving party acquires the secret-key assigned by the transmitting party using his own private key.

Description

Efficient and quick public key encryption method

Technical Field

The invention belongs to the data encryption technology in the field of information security, and particularly relates to a high-efficiency and quick public key encryption method.

Background

Data encryption is a fundamental task of cryptographic systems. According to the relationship between encryption key and decryption key, the current various data encryption systems can be divided into two categories: a symmetric cipher encryption system and a public key cipher encryption system.

The symmetric cipher encryption body has a history of thousands of years, and is the most common encryption technology at present. Among them, the most representative symmetric cryptographies include DES, AES, IDEA, RC6, and the like. The algorithm has the advantages of high encryption speed, high strength, good safety and the like. But since the encryption process and the decryption process of the symmetric cipher are reciprocal, both processes use the same key, i.e. the secret key. For the symmetric cipher encryption system, the distribution and management of the key are very difficult, and a cumbersome authentication process and an expensive dedicated secret channel are generally required, which greatly limits the application range of the symmetric cipher encryption system.

The public key cryptographic system was first proposed by Diffie and Hellman at the end of the last 70's of the century. The method is established on the basis of a trapdoor mathematical function, and by introducing mutually independent public and private key pairs, the encryption process and the decryption process are not symmetrical to each other, so that the key distribution and management problems disturbing the symmetric cipher encryption system are successfully solved. However, although the public key encryption system solves the problem of key distribution and management of the symmetric encryption system, the public key encryption system is established on the basis of a trapdoor mathematical function and needs a large amount of complex mathematical operations, so the implementation speed is very slow, and generally only 1/100-1/1000 which is equal to the implementation speed of the symmetric encryption system with the same intensity is needed, so the public key encryption system is not practical and cannot be practically applied to a data encryption system.

Disclosure of Invention

The invention aims to realize a high-efficiency and quick public key encryption method by combining a public key distribution technology and a symmetric cipher encryption system.

In order to achieve the purpose, the method comprises the following specific steps:

two communication parties are A and B, and the private keys of the two communication parties are SK_AAnd AK_BThe public key is PK_AAnd PK_BAnd storing in a trusted third party authentication center, and when the communication party A needs to send a private message M to the receiving party B through an unsafe channelThen, the message M may be encrypted as follows:

a randomly generating a certain temporary Key, using the Key as a secret Key of a symmetric cipher encryption system, and encrypting a private message M by using the symmetric cipher encryption system to obtain a ciphertext C;

secondly, a secret key distribution technology of a public key cryptosystem is utilized, and a public key PK of a receiver B is utilized_BThe secret key selected immediately is converted into a distribution message S, and the secret key distribution message S and the ciphertext C are sent to a receiving party B through a public channel.

For receiving party B, firstly, according to secret key distribution technique, utilizing its own private key SK_BThe secret Key distributed by the sender a is acquired, and then the received ciphertext C is decrypted by using the secret Key to obtain the private message M.

The invention combines the advantages of two encryption systems of a symmetric cipher encryption system and a public key cipher encryption system: the method has the advantages of high encryption speed and high strength of a symmetric cipher encryption system, and also has the advantages of a public key encryption system in key distribution and management and an additional identity authentication function.

Compared with the mode of directly exchanging the temporary session key through the key exchange protocol and finishing data encryption through secret communication, the invention does not require both parties of communication to be on line at the same time and does not need a special authentication process, thereby having stronger practicability, higher efficiency, more convenience and more safety; compared with the prior single encryption technology, the method has the advantages of high encryption speed, safety and high efficiency of key management, does not need various complicated authentication processes and expensive special secret channels, can resist various known attack schemes, has high safety, simple and high efficiency in operation and very low calculation overhead and space requirements, and can be widely applied to various software and hardware environments such as computers, communication networks, smart cards, mobile phones, electronic commerce and the like.

Drawings

The figure graphically depicts the data encryption process of the present invention.

Detailed Description

The invention is further described with reference to the following figures and examples, which should not be construed as limiting the invention.

Example 1

When the public key distribution technology is an XECDA key distribution technology based on the problem of discrete logarithm of an elliptic curve and AES is selected in a symmetric cryptosystem, the specific implementation mode of the invention is as follows:

system parameters: randomly selecting a large prime number p, an elliptic curve E (GF (p): y)²＝x³+ ax + b (mod p) is a secure elliptic curve defined over the finite field gf (p), where the randomly chosen base point is G, n ═ E (gf (p) is the order of the elliptic curve E, r is a large prime factor of n, private key SK of A, B_AAnd SK_BIs a random positive integer less than r-1. Then the public key PK_AAnd PK_BObtained as follows:

and is placed in a trusted third party certification authority. The data encryption process is as follows:

a) a randomly selects an integer k epsilon [1, r-1 ]]If K is K × G, K is a secret key used for the symmetric cipher system AES in the data encryption process; meanwhile, encrypting the private message M to be sent by using a secret key K by using an AES symmetric encryption technology to obtain a ciphertext C; and obtaining the public key PK of B from the certification center CA_BCalculating R ═ k × PK_BThen using its own private key SK_ADigitally signing the message (R, C) to obtain S ═ Sig_A(R, C); finally, A sends the message (R, C, S) to B;

b) b for the message (R, C, S) received from A, firstly, the public key PK of A is obtained from the certification center CA_AAnd the digital signature verification algorithm verifies the authenticity and the integrity of the message, and then uses the private key SK of the message_BCalculating K ═ SK_BxAR, namely obtaining a secret key K used for the symmetric cipher system AES in the data encryption process, and then decrypting the received ciphertext C by using the obtained secret key K as the control of the AES symmetric cipher system to obtain the private message M sent by A.

Example 2

RSA is selected in the public key cryptosystem, and DES is selected in the symmetric cryptosystem:

system parameters: randomly selecting two large prime numbers p and q (needing to be kept secret), calculating the product n ═ pq of the two large prime numbers p and q as the public modulus of the system, and randomly selecting an integer as the public key PK of the communication party A (B)_A(PK_B) Then its private key SK_A(SK_B) Can be obtained as follows:

wherein,

*(n)＝(p-1)×(q-1)

at the same time, the public key PK_A(PK_B) And if the data is placed in a trusted third party authentication center, the data encryption process is as follows:

a) a randomly selects a positive integer k epsilon [1.n-1 ]]And K is a secret key used for a symmetric cryptosystem DES in the data encryption process, and meanwhile, the secret key K is used for encrypting the private message M to be sent by using a DES symmetric encryption technology to obtain a ciphertext C. And obtaining the public key PK of B from the certification center CA_BCalculating $R=k^{{\mathrm{PK}}_B}\mathrm{mod}n;$ Then uses its own private key SK_ADigitally signing the message (R, C) to obtain S ═ Sig_A(R, C); finally, A sends the message (R, C, S) to the receiving party B through the public channel:

b) b firstly uses the public key PK of A obtained from the certification center CA for the message (R, S, C) received from A_AVerifying the authenticity and integrity of the message by using a corresponding digital signature verification algorithm; then uses its private key SK_BComputing $K=C^{{\mathrm{SK}}_B}\mathrm{mod}n,$ The secret key K used for the symmetric cipher system DES in the data encryption process can be obtained; then, the obtained secret key K is used as a control parameter of a DES symmetric cryptosystem to decrypt the received ciphertext C, and the private message M sent by the A can be obtained.

What is not described in detail in this specification is prior art to the knowledge of those skilled in the art.

Claims (3)

1. A high-efficiency and quick public key encryption method comprises the following specific steps:

two communication parties are A and B, and the private keys of the two communication parties are SK_AAnd SK_BThe public key is PK_AAnd PK_BAnd storing the message in a trusted third party authentication center, and when the communication party A needs to send the private message M to the receiving party B through an unsafe channel, encrypting the message M according to the following operations:

a randomly generating a certain temporary Key, using the Key as a secret Key of a symmetric cipher encryption system, and encrypting a private message M by using the symmetric cipher encryption system to obtain a ciphertext C;

secondly, a secret key distribution technology of a public key cryptosystem is utilized, and a public key PK of a receiver B is utilized_BThe secret key selected immediately is converted into a distribution message S, and the secret key distribution message S and the ciphertext C are sent to a receiving party B through a public channel.

For receiving party B, firstly, according to secret key distribution technique, utilizing its own private key SK_BThe secret Key distributed by the sender a is acquired, and then the received ciphertext C is decrypted by using the secret Key to obtain the private message M.

2. The efficient and fast public key encryption method according to claim 1, comprising the following steps:

when the public key distribution technology is an XECDA key distribution technology based on the problem of discrete logarithm of an elliptic curve and AES is selected in a symmetric cryptosystem, the specific implementation mode of the invention is as follows:

system parameters: randomly selecting a large prime number p, an elliptic curve E (GF (p): y)²＝x³+ ax + b (mod p) is a secure elliptic curve defined over the finite field gf (p), where the randomly chosen base point is G, n ═ E (gf (p) is the order of the elliptic curve E, r is a large prime factor of n, private key SK of A, B_AAnd SK_BIs a random positive integer less than r-1. Then the public key PK₄And PK_BObtained as follows:

and is placed in a trusted third party certification authority. The data encryption process is as follows:

a) a randomly selects an integer k epsilon [1, r-1 ]]If K is K × G, K is a secret key used for the symmetric cipher system AES in the data encryption process; meanwhile, encrypting the private message M to be sent by using a secret key K by using an AES symmetric encryption technology to obtain a ciphertext C; and obtaining the public key PK of B from the certification center CA_BCalculating R ═ k × PK_BThen using its own private key SK_AFor messages (R, C)Line digital signature to get S ═ Sig_A(R, C): finally, A sends the message (R, C, S) to B;

b) b for the message (R, C, S) received from A, firstly, the public key PK of A is obtained from the certification center CA_AAnd the digital signature verification algorithm verifies the authenticity and the integrity of the message, and then uses the private key SK of the message_BCalculating K ═ SK_BxAR, namely obtaining a secret key K used for the symmetric cipher system AES in the data encryption process, and then decrypting the received ciphertext C by using the obtained secret key K as the control of the AES symmetric cipher system to obtain the private message M sent by A.

3. The efficient and fast public key encryption method according to claim 1, comprising the following steps:

RSA is selected in a public key cryptosystem, DES is selected in a symmetric cryptosystem:

system parameters: randomly selecting two large prime numbers p and q (needing to be kept secret), calculating the product n ═ pq of the two large prime numbers p and q as the public modulus of the system, and randomly selecting an integer as the public key PK of the communication party A (B)_A(PK_B) Then its private key SK_A(SK_B) Can be obtained as follows:

wherein,

*(n)＝(p-1)×(q-1)

at the same time, the public key PK_A(PK_B) And if the data is placed in a trusted third party authentication center, the data encryption process is as follows:

a) a randomly selects a positive integer k epsilon [1.n-1 ]]And K is a secret key used for a symmetric cryptosystem DES in the data encryption process, and meanwhile, the secret key K is used for encrypting the private message M to be sent by using a DES symmetric encryption technology to obtain a ciphertext C. And obtaining the public key PK of B from the certification center CA_BCalculating $R=k^{{\mathrm{PK}}_B}\mathrm{mod}n;$ Then uses its own private key SK_ADigitally signing the message (R, C) to obtain S ═ Sig_A(R, C); finally, A sends the message (R, C, S) to the receiving party B through the public channel;

b) b firstly uses the public key PK of A obtained from the certification center CA for the message (R, S, C) received from A_AVerifying the authenticity and integrity of the message by using a corresponding digital signature verification algorithm; then uses its private key SK_BComputing $K=C^{{\mathrm{SK}}_B}\mathrm{mod}n,$ The secret key K used for the symmetric cipher system DES in the data encryption process can be obtained; then, the obtained secret key K is used as a control parameter of a DES symmetric cryptosystem to decrypt the received ciphertext C, and the private message M sent by the A can be obtained.

Images