Ring signature method for anonymizing information based on MQ problem in finite field
A finite field, ring signature technology, applied in the field of information security, can solve the problem of insecure ring signature system
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment
[0122] An anonymous ring signature scheme based on multivariable public key cryptography TTS (20, 28) system
[0123] Step 1. Generate system parameters
[0124] 1) Set k=GF(q l )=GF(2 8 ) Is a finite field with p=2;
[0125] 2) Let m=20 be the number of equations in the multivariable equation system, and n=28 be the number of variables;
[0126] 3) Select H: {0, 1} * →k m It is a cryptographically safe anti-collision one-way irreversible hash function, the system parameters are (k, q, p, l, m, n, H).
[0127] Step 2. Key generation
[0128] 1) Assuming that there are t users in the ring, set U = {u 0 , U 1 ,..., u t-1 };
[0129] 2) According to the multivariable public key cryptosystem, each user u i (0≤i≤t-1) Choose F from k n To k m Reversible mapping of, F is the central mapping below
[0130] y i = x i + X j = 1 7 p i , j x j x 8 + ( i + j mod 9 ) , i = 8 · · · 16 ;
[0131] y 17 = X 17 +p...
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