WO2022021005A1 - Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle - Google Patents

Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle Download PDF

Info

Publication number
WO2022021005A1
WO2022021005A1 PCT/CN2020/104889 CN2020104889W WO2022021005A1 WO 2022021005 A1 WO2022021005 A1 WO 2022021005A1 CN 2020104889 W CN2020104889 W CN 2020104889W WO 2022021005 A1 WO2022021005 A1 WO 2022021005A1
Authority
WO
WIPO (PCT)
Prior art keywords
random
information
key
plaintext
polynomial
Prior art date
Application number
PCT/CN2020/104889
Other languages
English (en)
Chinese (zh)
Inventor
刘江
杨文强
Original Assignee
中国科学院重庆绿色智能技术研究院
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中国科学院重庆绿色智能技术研究院 filed Critical 中国科学院重庆绿色智能技术研究院
Priority to PCT/CN2020/104889 priority Critical patent/WO2022021005A1/fr
Priority to CN202080102633.7A priority patent/CN115843360A/zh
Publication of WO2022021005A1 publication Critical patent/WO2022021005A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
    • G06F21/60—Protecting data
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/06—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols the encryption apparatus using shift registers or memories for block-wise or stream coding, e.g. DES systems or RC4; Hash functions; Pseudorandom sequence generators

Definitions

  • the invention is a symmetric encryption and decryption method based on exponential complexity, belongs to the technical field of information security, and relates to the improvement of the symmetric encryption and decryption method.
  • information security involves all aspects of people's lives, and more and more fields such as mobile payment, social software, and personal information query have higher and higher requirements for information security.
  • the exponential complexity-based symmetric encryption scheme proposed in the present application is based on a strict exponential complexity problem, and the encryption and decryption processes are very efficient. Therefore, it can be widely used in many technical fields such as information communication security and computer network security.
  • the purpose of the present invention is to provide technical support for ensuring the security of information communication by providing an efficient and strictly theoretically guaranteed symmetric cryptographic method, which fully develops a set of efficient key generation techniques to ensure that cryptographic attack is an exponential problem.
  • the present invention provides the following technical solutions:
  • Step 1 Determine the basic code table and disclose it according to the information content to be transmitted;
  • Step 2 The sender inputs the information plaintext on the encoding device, and the encoding device encodes the information plaintext corresponding to the basic code table into digital plaintext;
  • Step 3 the encryption device adopts a symmetric encryption method based on exponential complexity to generate a random key, a seed key, a random recursive function and its corresponding start key, and then encrypts the digital plaintext to obtain an information ciphertext;
  • Step 4 the information network equipment discloses the information ciphertext through the public channel, and transmits the random key, the seed key, the random recursive function and its corresponding start key to the decryption device through the secure channel;
  • Step 5 the decryption device uses a symmetric decryption method based on exponential complexity to decrypt the information ciphertext to generate a random cryptic text;
  • Step 6 the decryption device uses the random key to decrypt the digital plaintext corresponding to the random cryptic text according to the corresponding relationship between the random cryptic text and the digital plaintext;
  • Step 7 The decoding device decodes the digital plaintext into information plaintext, and displays the information plaintext content to the receiver through the output terminal.
  • the basic code table described in step 1 is determined by any one or both parties or a third party according to the needs of the receiver or the sender, which is a one-to-one correspondence between the basic element set of the information content and the integer interval. Once determined. After that, it is fixed; among them, the number of basic elements of the information content is K, and the integer interval is [0, K-1].
  • the symmetric encryption method based on exponential complexity described in step 3 is specifically: (1) grouping the digital plaintext; (2) randomly selecting a finite field, and selecting a random key on the finite field to encrypt the digital plaintext. Each group is randomized and encrypted to obtain the random cryptic text of the new group; (3) randomly select a polynomial matrix on the finite field as the seed key M(x), and randomly select a recursion based on the number of groups t function ⁇ and its corresponding start key U ⁇ (t) , and use the seed key and the start key to encrypt the random cryptic text to obtain the information cipher text.
  • the seed key M(x) is the product of random 2(L+c) triangular polynomial matrices, wherein there are L+c upper triangular polynomial matrices and L+c lower triangular polynomial matrices respectively;
  • the diagonals of the upper triangular polynomial matrix and the lower triangular polynomial matrix are the non-zero elements on the algebraic field F q , and the non-diagonal elements of the non-zero elements are sparse polynomials; the sparse polynomials are from sparse polynomials.
  • k 1,2,...,N ⁇ , where N is the upward rounding of q/2; (b) randomly select a corresponding one m k times for each element m k of the set m on the finite field F q (c) If the polynomial generated in step (b) is not in the sparse polynomial set, put the polynomial into the sparse polynomial set, otherwise return to step (b); ( d) Repeat steps (a) to (c) until the number of elements in the sparse polynomial set is (L+c) 3 .
  • the recursive function ⁇ is a randomly selected one-to-one mapping function from the set ⁇ 1,2,...,t ⁇ to itself; the starting key U ⁇ (t) is the ⁇ th (t) random cryptic texts corresponding to the groupings.
  • the encrypted random cryptic text is specifically: first, starting from the first new group, using the seed key M(x) and the start key U ⁇ (t) to calculate the information encryption corresponding to the first new group.
  • the key X ⁇ (1) M(U ⁇ (t) )
  • V j U j [1:L]-H ⁇ (s,U j [L+1:L+c]), where 1: L represents the elements in the vector in the order 1 to L.
  • the encoding device is a computer device that integrates a data information collector and a processor loaded with a basic code table;
  • the encryption device is connected to the encoding device and the information network device, and integrates output ports and
  • the information network device is a computer device that integrates an output port and a processor to convert information ciphertext into a standard encrypted signal ;
  • Described decryption device is connected with decoding equipment and information network equipment, integrates output port and processor in one computer equipment, and is loaded with symmetric encryption method based on exponential complexity;
  • Described decoding equipment is integrated A computer device that integrates an output port and a processor loaded with a basic code table;
  • the public channel is an open network channel;
  • the security channel is the security and privacy set by the dominant party or both parties in the receiver or the sender network channel.
  • the data information collector is usually a camera, various keyboards (including smart phone screen input keyboards, cash machine buttons, etc.), microphones, etc.; the information content to be transmitted is usually user passwords, chat records, etc. data.
  • the beneficial effects of the present invention are as follows: by using the random polynomial matrix as the seed key and the random cryptic text to generate the random key of the encrypted plaintext, the seed key attack problem is converted into the solution problem of polynomial reduction, and the cryptographic security is established to On the exponential difficulty problem, while satisfying security, the ciphertext expansion rate is also low, and efficient encryption and decryption can be achieved.
  • FIG. 1 is a flowchart of a symmetric encryption/decryption method based on exponential complexity in an embodiment of the present invention.
  • Embodiment 1 In this embodiment, it is assumed that a user (sender) of a chat software sends a message to a friend (receiver) through a smartphone loaded with the software. For the convenience of demonstrating the method of the present invention, it is assumed that the content of the sent message is Hello".
  • the exponential complexity-based symmetric encryption and decryption method in this embodiment includes:
  • S1 Determine the basic code table and disclose it according to the information content to be transmitted;
  • S2 The sender inputs plaintext information on the input keyboard of the smartphone, and the encoding device encodes the plaintext information corresponding to the basic code table into digital plaintext;
  • S3 The sender's smartphone uses a symmetric encryption method based on exponential complexity to generate a random key, a seed key, a random recursive function and its corresponding start key, and then encrypts the digital plaintext to obtain the information ciphertext;
  • the communication module of the sender's smartphone discloses the information ciphertext through the public channel through the wireless network/mobile network, and transmits the random key, the seed key, the random recursive function and its corresponding start key through the secure channel to the recipient's smartphone;
  • S5 The recipient's smartphone uses the exponential complexity-based symmetric decryption method to decrypt the information ciphertext to generate a random cryptic text;
  • S6 The receiver's smartphone uses the random key to decrypt the digital plaintext corresponding to the random cryptic text according to the corresponding relationship between the random cryptic text and the digital plaintext;
  • the receiver's smartphone uses a decoding algorithm to decode the digital plaintext into information plaintext, and displays the information plaintext to the receiver through the display screen.
  • step S1
  • step S2
  • step S3
  • the symmetric encryption method based on exponential complexity is specifically: S301 group the digital plaintext; S302 randomly select a finite field, select a random key on the finite field to randomize and encrypt each grouping of the digital plaintext, and obtain a new grouping S303 randomly selects a polynomial matrix on the finite field as the seed key M(x), and randomly selects a recursive function ⁇ and its corresponding start key U ⁇ (t based on the number of groups t) ) , and use the seed key and the start key to encrypt the random ciphertext to obtain the information ciphertext.
  • k 1, 2,...,N ⁇ , where N is the upward rounding of q/2; (b) randomly select a corresponding monomial of degree m k
  • the recursive function ⁇ is a randomly selected one-to-one mapping function from the set ⁇ 1,2,...,t ⁇ to itself; the starting key U ⁇ (t) is the corresponding ⁇ (t)th grouping random cryptic text.
  • step S5
  • step S6
  • V j U j [1:L]-H ⁇ (s,U j [L+1:L+c]), where 1:L indicates that in the vector Elements in order from 1 to L.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Computer Security & Cryptography (AREA)
  • Software Systems (AREA)
  • Computer Hardware Design (AREA)
  • General Health & Medical Sciences (AREA)
  • Health & Medical Sciences (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Bioethics (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Storage Device Security (AREA)

Abstract

La divulgation concerne un procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle qui appartient au domaine technique des informations. Le procédé comprend les étapes suivantes : étape 1, déterminer une table de code de base et la publier ; étape 2, effectuer un codage numérique sur un texte en clair d'informations pour obtenir un texte en clair numérique ; étape 3, chiffrer le texte en clair numérique à l'aide d'un procédé de chiffrement symétrique basé sur une complexité exponentielle de façon à obtenir un texte chiffré d'informations ; étape 4, effectuer un transfert d'informations ; étape 5, déchiffrer le texte chiffré d'informations à l'aide d'un procédé de déchiffrement symétrique sur la base d'une complexité exponentielle de façon à générer un texte masqué aléatoire ; étape 6, déchiffrer le texte masqué aléatoire en fonction d'une corrélation pour obtenir le texte en clair numérique ; et étape 7, décoder le texte en clair numérique pour obtenir le texte en clair d'informations. Au moyen de la présente invention, la sécurité d'un ordre exponentiel est satisfaite et, en outre, l'allure d'expansion de texte chiffré est relativement faible, ce qui permet d'effectuer un chiffrement et un déchiffrement efficaces.
PCT/CN2020/104889 2020-07-27 2020-07-27 Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle WO2022021005A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
PCT/CN2020/104889 WO2022021005A1 (fr) 2020-07-27 2020-07-27 Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle
CN202080102633.7A CN115843360A (zh) 2020-07-27 2020-07-27 基于指数复杂度的对称加解密方法

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2020/104889 WO2022021005A1 (fr) 2020-07-27 2020-07-27 Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle

Publications (1)

Publication Number Publication Date
WO2022021005A1 true WO2022021005A1 (fr) 2022-02-03

Family

ID=80037219

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2020/104889 WO2022021005A1 (fr) 2020-07-27 2020-07-27 Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle

Country Status (2)

Country Link
CN (1) CN115843360A (fr)
WO (1) WO2022021005A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116032624A (zh) * 2022-12-30 2023-04-28 北京长鹰恒容电磁科技有限公司 一种基于融合加密的数据传输方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107800533A (zh) * 2017-09-26 2018-03-13 南京航空航天大学 一种基于文言语法的信息加密与隐藏的方法及解密方法
WO2019010421A1 (fr) * 2017-07-07 2019-01-10 Ligatti Jay Systèmes et procédés de génération de clés cryptographiques symmétriques
CN109344627A (zh) * 2018-08-16 2019-02-15 中国科学院重庆绿色智能技术研究院 一种新型香农完美保密方法
CN109409106A (zh) * 2018-09-25 2019-03-01 中国科学院重庆绿色智能技术研究院 一种新型无穷字母表的香农完美保密方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019010421A1 (fr) * 2017-07-07 2019-01-10 Ligatti Jay Systèmes et procédés de génération de clés cryptographiques symmétriques
CN107800533A (zh) * 2017-09-26 2018-03-13 南京航空航天大学 一种基于文言语法的信息加密与隐藏的方法及解密方法
CN109344627A (zh) * 2018-08-16 2019-02-15 中国科学院重庆绿色智能技术研究院 一种新型香农完美保密方法
CN109409106A (zh) * 2018-09-25 2019-03-01 中国科学院重庆绿色智能技术研究院 一种新型无穷字母表的香农完美保密方法

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116032624A (zh) * 2022-12-30 2023-04-28 北京长鹰恒容电磁科技有限公司 一种基于融合加密的数据传输方法

Also Published As

Publication number Publication date
CN115843360A (zh) 2023-03-24

Similar Documents

Publication Publication Date Title
CN110677237B (zh) 一种具有似混沌特性的文件加密方法
EP1834438B1 (fr) Cryptographie liee a des cles
CN111510281B (zh) 一种同态加密方法及装置
AU2008327506B2 (en) Method and system for encryption of data
WO1997031448A1 (fr) Methode de communication utilisant une cle commune
CN112532613A (zh) 一种基于区块链地址的隐蔽通信方法
US8180048B2 (en) Method and system for computational transformation
Abusukhon et al. A novel network security algorithm based on private key encryption
CN113711564A (zh) 用于加密数据的计算机实现的方法和系统
Pandya et al. Brief history of encryption
US20140334623A1 (en) Rapid data encryption and decryption for secure communication over open channels with plausible deniability
US20020159588A1 (en) Cryptography with unconditional security for the internet, commercial intranets, and data storage
CN110795762A (zh) 基于流密码的保留格式加密方法
CN112383397A (zh) 一种基于生物特征的异构签密通信方法
WO2022021005A1 (fr) Procédé de chiffrement et de déchiffrement symétrique basé sur une complexité exponentielle
CN111835766B (zh) 一种可重随机的公钥加解密方法
Erondu et al. An encryption and decryption model for data security using vigenere with advanced encryption standard
WO2023030316A1 (fr) Procédé de génération et de distribution de clé, appareil de génération de clé et système de gestion de clé
Mohan et al. An Encryption Technique Using A Complete Graph With A Self-Invertible Matrix
CN108768923A (zh) 一种基于量子可逆逻辑线路的加密算法的聊天实时加密方法
Mohan et al. An encryption technique using the adjacency matrices of certain graphs with a self-invertible key matrix
CN111835506B (zh) 基于一次使用密码本的信息安全数字加密方法
Simmons Symmetric and asymmetric encryption
Ojugo et al. Cryptography: Salvaging exploitations against Data integrity
Hamsanandhini et al. Securing Data in the Image Using SHA & ECC

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 20946687

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 20946687

Country of ref document: EP

Kind code of ref document: A1