Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Operation method and system for ciphertext numbers

An operation method and encryption algorithm technology, which is applied in the field of information security, can solve the problems of limited and complex homomorphic encryption operations, and achieve the effect of low possibility of cooperative cheating and avoiding cooperative cheating

Active Publication Date: 2016-12-21
WUHAN UNIV OF TECH
View PDF5 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Compared with full homomorphism, partial homomorphic encryption algorithm is relatively simple, but supports limited homomorphic encryption operations; although fully homomorphic encryption algorithm supports many homomorphic encryption operations, it is very complicated
Although there is a fully homomorphic encryption algorithm at present, it is far from practical application due to its complexity.

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Operation method and system for ciphertext numbers

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0023] Example 1: Multiplying a ciphertext number by a plaintext number

[0024] The specific implementation is as follows:

[0025] When a calculation component or device multiplies a ciphertext number and a plaintext number, the calculation component or device first decomposes the ciphertext number into the homomorphic encryption addition sum of n ciphertext numbers, and then uses the decomposed n Each ciphertext number in the ciphertext number and the plaintext number to be multiplied form a group to form n groups of numbers, and then submit the n groups of numbers to n cryptographic servers to request multiplication operations;

[0026] After n cryptographic servers receive each set of numbers, they decrypt the ciphertext numbers respectively, and then multiply the plaintext numbers obtained after decrypting the ciphertext numbers with the received plaintext numbers, and use additive homomorphic encryption for the calculation results The algorithm is encrypted and returne...

Embodiment 2

[0028] Example 2: Divide a ciphertext number by a plaintext number

[0029] The specific implementation is as follows:

[0030] When a calculation component or device divides a ciphertext number by a plaintext number, the calculation component or device first decomposes the ciphertext number into the homomorphic encryption addition sum of n ciphertext numbers, and then uses the decomposed n Each ciphertext number in the ciphertext numbers and the plaintext number as the divisor form n groups of numbers, and then submit the n groups of numbers to n password servers to request division operations;

[0031] After receiving each group of numbers, n cryptographic servers decrypt the ciphertext numbers respectively, divide the plaintext numbers obtained after decrypting the ciphertext numbers by the plaintext numbers as the divisor, and encrypt the calculation results with the additive homomorphic encryption algorithm and then returned to the computing component or device;

[0032...

Embodiment 3

[0033] Embodiment 3: Divide a plaintext number by a ciphertext number

[0034] The specific implementation is as follows:

[0035] When a computing component or device divides a plaintext number by a ciphertext number, the computing component or device first multiplies a random plaintext number by the dividend plaintext number (as the dividend plaintext number) to form a new dividend plaintext number, Calculate the divisor ciphertext number (as the ciphertext number of the divisor) by the same random plaintext number with the calculation method for the ciphertext number, as in Example 1, form a new divisor ciphertext number, and then divide the new dividend The plaintext number is decomposed into the sum of n plaintext numbers, and the decomposed n plaintext numbers are called the components of the new dividend plaintext number, and then each component of the decomposed n new dividend plaintext number components is combined with the new The divisor ciphertext number is a grou...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The present invention relates to an operation method and system for ciphertext numbers. The operation method for ciphertext numbers includes the following steps that: when carrying out algebraic operation involving ciphertext numbers, a calculation component or apparatus exports n groups of numbers from numbers to be operated, and then, submits the n groups of numbers to n password servers for carrying corresponding algebraic operation, wherein each group of numbers includes ciphertext numbers; after receiving each group of numbers, the n password servers decrypt the ciphertext numbers in each group of numbers, carries out operation required by the calculation component or apparatus by using plaintext numbers obtained after the decryption, and returns the ciphertext number of calculation results to the calculation component or apparatus; and after receiving the ciphertext number results returned by the n password servers, the calculation component or apparatus obtains final operation results through homomorphic encryption additive operation. With the method and system of the invention adopted, the multiplication, division and exponentiation operation of a ciphertext can be carried out through only using the additive homomorphic encryption algorithm with the origin plaintext numbers of the ciphertext numbers involved in operation not leaked.

Description

technical field [0001] The invention belongs to the field of information security, in particular to an operation method and system for ciphertext numbers. Background technique [0002] Homomorphic encryption (homomorphic encryption) can realize the original ciphertext by operating on the ciphertext of the encrypted number (ie, ciphertext number) without decrypting the encrypted number (number). Number (that is, plaintext number, plaintext number) operation, for example, let E be an encryption function, D be a decryption function, x, y be the number before encryption (plaintext number), if there is an effective algorithm ⊕ (homomorphic encryption addition) such that : E(x+y)=E(x)⊕E(y), or x+y=D(E(x)⊕E(y)) is established, then this encryption algorithm E is an additive homomorphic encryption algorithm; if There is an effective algorithm ⊙ (homomorphic encryption multiplication) such that: E(x×y)=E(x)⊙E(y), or x×y=D(E(x)⊙E(y)), then this The encryption algorithm E is a multip...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H04L9/30H04L9/00
CPCH04L9/008H04L9/3006H04L9/3066
Inventor 龙毅宏
Owner WUHAN UNIV OF TECH
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products