Lattice-based distributed relinearization public key generation method
A heavy-linear and distributed technology, applied in instruments, computing, electrical and digital data processing, etc., can solve problems such as high noise, and achieve the effect of less noise
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0029] A lattice-based distributed relinearization public key generation method, comprising the following steps:
[0030] Step 1: Initial system setting: Set the initial parameters of the lattice cipher system and the relinearization public key generation process, as follows:
[0031] Set the system parameter params={param0, param1}.
[0032] for Security parameter λ=128 is set, the quantity m=4 of participating users (according to the actual situation, the user quantity is the power of 2 all can, adopt 4 in the present embodiment), the ordered set U={A, B of all participating users ,C,D}, polynomial degree d=2047, polynomial coefficient modulus q=18014398492704769, plaintext polynomial modulus t=114689, circular polynomial f(x)=x 2047 +1, Ring And Rq represents the polynomial after coefficient modulo q. Then set the χ distribution, the uniform distribution μ, and select the polynomial from Rq according to the uniform distribution Finally, the hybrid encryption system ...
Embodiment 2
[0047] A lattice-based distributed relinearization public key generation method, comprising the following steps:
[0048] Step 1: Initial system setting: set the initial parameters of the lattice cipher system and the relinearization public key generation process; the details are as follows:
[0049] Set the system parameter params={param0, param1}.
[0050] for Security parameter λ=128 is set, and the quantity m=4 of participating users (according to the actual situation, the quantity of users is the power of 2 all can, adopt 4 in the present embodiment.), the ordered collection U={A of all participating users, B, C, D}, polynomial degree d=4095, polynomial coefficient modulus q=324518553658426726783156032454657, plaintext polynomial modulus t=114689, circular polynomial f(x)=x 4095 +1, Ring And Rq represents the polynomial after coefficient modulo q. Then set the χ distribution, the uniform distribution μ, and select the polynomial from Rq according to the uniform dist...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com