Electronic device using homomorphic encryption and encrypted data processing method thereof
US-12170719-B2 · Dec 17, 2024 · US
US10142105B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-10142105-B2 |
| Application number | US-201515111365-A |
| Country | US |
| Kind code | B2 |
| Filing date | Jan 7, 2015 |
| Priority date | Jan 13, 2014 |
| Publication date | Nov 27, 2018 |
| Grant date | Nov 27, 2018 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A hypersphere-based multivariable public key encryption/decryption system may include an encryption module and a decryption module. The encryption module may include a processor and a public key transformation component for transforming plaintext into ciphertext. The decryption module may include a processor, a first affine transformation inversion component, a trapdoor component and a second affine transformation inversion component. The trapdoor component may include a linear equation system construction component and a linear equation system solving component. All components may execute corresponding operations, so that a set of data may be obtained finally, and the set of data may be stored and output as decrypted plaintext. If the decryption module does not produce data, the processor may output warning information about a decryption failure to a user.
Opening claim text (preview).
The invention claimed is: 1. A hypersphere-based multivariable public key encryption/decryption system, comprising: an encryption module, which comprises a processor and a public key transformation component, wherein, after a plaintext to be encrypted is transmitted to the processor, the processor stores the plaintext, and then transmits the plaintext to the public key transformation component; an encrypted ciphertext is obtained by respectively substituting the plaintext into multivariable polynomials; the encrypted ciphertext is subsequently transmitted to the processor for storage; and then the processor transmits the encrypted ciphertext to a plurality of decryption modules of other users; and a decryption module, which comprises the processor, a first affine transformation inversion component, a trapdoor component and a second affine transformation inversion component, with the trapdoor component containing a linear equation system construction component and a linear equation system solving component, wherein, after ciphertext data is received, the ciphertext data is firstly transmitted by the processor to the first affine transformation inversion component for an affine transformation inversion computation, and then transmitted to the linear equation system construction component and the linear equation system solving component of the trapdoor component respectively for a linear equation system construction computation and a linear equation system solving computation; a group of solutions obtained through the polynomial inversion computation are transmitted to the second affine transformation inversion component for an affine transformation inversion computation and are finally transmitted to the processor; for one or more sets of data transmitted, the processor respectively calculates a hash value for each set of data, if an obtained hash value of a certain set of data is equal to plaintext hash redundant data prestored in the processor, the set of data is stored and output as a decrypted plaintext; and if hash value is equal to the plaintext hash redundant data, the processor outputs warning information about a decryption failure to a user. 2. The hypersphere-based multivariable public key encryption/decryption system according to claim 1 , further comprising a selector which is connected to the processor, wherein, when the selector is in an open state, the encryption module of the system works; and when the selector is in a closed state, the decryption module of the system works. 3. The hypersphere-based multivariable public key encryption/decryption system according to claim 2 , wherein the processor comprises a scheduler connected to the selector, wherein the open state and the closed state of the selector are identified and processed by the scheduler in the processor, and data stored in the processor is controlled and scheduled by the scheduler to corresponding components for corresponding operations. 4. The hypersphere-based multivariable public key encryption/decryption system according to claim 1 , wherein processor further comprises a hash detector and a memory, wherein a calculation of the hash value of the data in the processor are accomplished by the hash detector, and a storage of the data in the processor is accomplished by the memory. 5. A hypersphere-based multivariable public key encryption/decryption method, comprising steps in the following order: (1) an encryption process: a. after a plaintext to be encrypted is transmitted to a processor, calculating a hash value thereof by the processor to obtain plaintext hash redundant data and storing the plaintext and the plaintext hash redundant data; b. transmitting the plaintext to a public key transformation component, and obtaining an encrypted ciphertext by substituting the plaintext into multivariable polynomials; and c. subsequently transmitting a ciphertext to the processor for storage, and transmitting, by the processor, the ciphertext together with the plaintext hash redundant data to a plurality of decryption modules of other users; and (2) a decryption process: a. after the ciphertext and the plaintext hash redundant data transmitted from other users is received, firstly storing the plaintext hash redundant data by the processor, and then transmitting the ciphertext to a first affine transformation inversion component for an affine transformation inversion computation; b. then transmitting inverted data to a linear equation system construction component and a linear equation system solving component of a trapdoor component respectively for a linear equation system construction operation and a linear equation system solving operation, with one or more groups of solutions obtained through the linear equation system solving operation; c. transmitting the solutions obtained above to a second affine transformation inversion component for an affine transformation inversion computation; and d. finally performing a transmission to the processor, and for one or more sets of data transmitted, respectively calculating a hash value for each set of data by the processor, if the hash value of a certain set of data is equal to the plaintext hash redundant data prestored in the processor, storing the set of data and outputting same as a decrypted plaintext; and if none of the hash value is equal to the plaintext hash redundant data, outputting, by the processor, warning information about a decryption failure to a user. 6. The hypersphere-based multivariable public key encryption/decryption method according to claim 5 , wherein said step (1) of encryption process comprises: a. after the plaintext to be encrypted (x 1 ′, . . . , x n ′)∈F n is transmitted to the processor, calculating the hash value thereof (h 1 ′, . . . , h j ′)=Hash(x 1 ′, . . . , x n ′) by the processor to obtain the plaintext hash redundant data (h 1 ′, . . . , h j ′), with Hash(·) with being a cryptographically secure one-way function, and storing the plaintext and the plaintext hash redundant data; b. transmitting the plaintext (x 1 ′, . . . , x n ′) data to the public key transformation component, and substituting, by the public key transformation component, the plaintext data into a public key mapping P(x 1 , . . . , x n ), namely respectively calculating values of the multivariable polynomials p 1 (x 1 ′, . . . , x n ′) , . . . , p m (x 1 ′, . . . , x n ′) of which the values are respectively denoted as y 1 ′, . . . , y m ′, with (y 1 ′, . . . , y m ′) being the encrypted ciphertext; and c. subsequently transmitting the ciphertext (y 1 ′, . . . , y m ′) to the processor for storage, and transmitting, by the processor, the ciphertext (y 1 ′, . . . , y m ′) together with the plaintext hash redundant data (h 1 ′, . . . , h j ′) to the plurality of decryption modules of other users; and the step (2) of decryption process contains: a. after the ciphertext (y 1 ′, . . . , y m ′) and the plaintext hash redundant data (h 1 ′, . . . , h j ′) transmitted from other users is received, firstly storing the plaintext hash redundant data (h 1 ′, . . . , h j ′) by the processor, and then transmitting the ciphertext (y 1 ′, . . . , y m ′) to the first affine transformation inversion component for the affine transformation inversion computation ({tilde over (y)} 1 , . . . , {tilde over (y)} m )=L 1 −1 (y 1 ′, . . . , y m ′); b. then transmitting the ({tilde over (y)} 1 , . . . , {tilde over (y)} m ) to the trapdoor component respectively for the linear equation system construction operation and the linear equation system solving operation, namely constructing, by the linear equation system construction component, an equation system simultaneously using m sets of data (c i,1 ,c i,2 ,. . . , c i,n ) preallocated to the trapdoor component by the scheduler
involving algebraic varieties, e.g. elliptic or hyper-elliptic curves · CPC title
involving Lattices or polynomial equations, e.g. NTRU scheme · CPC title
Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03) · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.