CN117792660A - Key data anti-repudiation method and system - Google Patents
Key data anti-repudiation method and system Download PDFInfo
- Publication number
- CN117792660A CN117792660A CN202410201415.9A CN202410201415A CN117792660A CN 117792660 A CN117792660 A CN 117792660A CN 202410201415 A CN202410201415 A CN 202410201415A CN 117792660 A CN117792660 A CN 117792660A
- Authority
- CN
- China
- Prior art keywords
- data
- prime number
- signature
- function value
- repudiation
- Prior art date
- Legal status (The legal status 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 status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 71
- 230000006870 function Effects 0.000 claims abstract description 107
- 238000004364 calculation method Methods 0.000 claims description 15
- 230000008569 process Effects 0.000 claims description 11
- 238000004422 calculation algorithm Methods 0.000 claims description 10
- 238000012795 verification Methods 0.000 claims description 10
- 235000019227 E-number Nutrition 0.000 claims description 8
- 239000004243 E-number Substances 0.000 claims description 8
- 238000004590 computer program Methods 0.000 claims description 7
- 230000021615 conjugation Effects 0.000 claims description 4
- 230000007246 mechanism Effects 0.000 abstract description 8
- 238000010586 diagram Methods 0.000 description 4
- 238000012986 modification Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 239000002131 composite material Substances 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000003287 optical effect Effects 0.000 description 2
- 101100217298 Mus musculus Aspm gene Proteins 0.000 description 1
- 238000009795 derivation Methods 0.000 description 1
Landscapes
- Storage Device Security (AREA)
Abstract
The embodiment of the invention discloses a key data anti-repudiation method and a system, wherein the key data anti-repudiation method comprises the steps of obtaining data m to be signed, obtaining a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set; calculating summary results M corresponding to n summary functions; calculating a first prime numberAnd a second prime numberIs a Euler function value of (a); randomly generating a private key of the data m based on the Euler function value; randomly generating a public key of the data m based on the euler function value; generating signature information of data M based on the private key and the abstract result M; based on the instituteThe public key and signature information verify the signature. The key data anti-repudiation method solves the problems of low safety characteristic, high cost and complex implementation of an anti-repudiation mechanism of key data in the prior art.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method, a system, an electronic device, and a storage medium for resisting repudiation of key data.
Background
In the field of network security, data security is particularly important, and is to ensure that data is in an effective protection and legal utilization state by taking necessary measures, and has the capability of ensuring a continuous security state, and an anti-repudiation mechanism is required to be implemented for some critical data with legal significance.
In general, digital signature based on public key system, which is currently used, is a widely used technology for information security and authentication, and mainly uses asymmetric encryption algorithm and Public Key Infrastructure (PKI) to ensure data integrity and authentication.
Digital signatures based on public key systems include: asymmetric encryption, digital signature generation and digital signature verification; digital signatures based on public key systems are widely used in fields such as e-mail, website authentication, digital documents, electronic transactions, etc. to ensure the security and authenticity of communications and data; however, for general applications, the above-mentioned cumbersome mechanism may not be needed, and especially in a scenario that meets some special requirements, the application of PKI mechanism is not only cumbersome, but also has some economic overhead.
Therefore, there is a need for a key data anti-repudiation method that has high security characteristics, is low in cost, and is not cumbersome to implement.
Disclosure of Invention
An objective of the embodiments of the present invention is to provide a key data anti-repudiation method, a system, an electronic device and a storage medium, which are used for solving the problems of low security, high cost and complicated implementation of an anti-repudiation mechanism of key data in the prior art.
To achieve the above objective, an embodiment of the present invention provides a key data anti-repudiation method, which specifically includes:
acquiring data m to be signed, acquiring a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set;
calculating summary results M corresponding to n summary functions;
calculating a first prime number by formula (1)And (d)Two prime numbers->Is a Euler function value of (a);
formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->The first prime number on the number of the first,expansion of integer->And->On the integer complex plane, +.>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (a);
randomly generating a private key of the data m based on the Euler function value;
randomly generating a public key of the data m based on the euler function value;
generating signature information of data M based on the private key and the abstract result M;
and verifying the signature based on the public key and the signature information.
Based on the technical scheme, the invention can also be improved as follows:
further, the calculating the summary results M corresponding to the n summary functions includes:
calculating a summary result M through a formula (2);
formula (2);
wherein M is the result of the abstract,，/>for the method set->For the purposes of method->For data to be signed +.>..../>Different digest algorithms are collected for the digest function.
Further, the key data anti-repudiation method further comprises:
performing modular operation through a formula (3);
formula (3);
wherein N is a modulo operation,is->Complex number of planes on->Is->Conjugation of->As real part->Is imaginary.
Further, the randomly generating the private key of the data m based on the euler function value includes:
randomly selectPositive integer>And->；
SelectingE, and 0<e</>E and->Mutual quality;
calculating a positive integer reciprocal to the positive integer e number theory，0</></>，/>；
The private key is%)。
Further, the randomly generating the public key of the data m based on the euler function value includes:
randomly selecting the position meeting the preset conditionPrime number->；
With the positive integerIs +_with the prime number>Performing exponential operation to obtain an operation result +.>；
The public key is%)。
Further, the generating signature information of the data m based on the private key includes:
calculating a signature by formula (4);
formula (4);
in the method, in the process of the invention,for signature->For a positive integer reciprocal to the positive integer e number theory, M is the summary result, ++>Is->Positive integer on>Is an integer, representing +.>Is a residual system;
with the positive integer e and the prime numberPerforming exponential operation to obtain an operation result +.>；
The signature information is%)。
Further, the verifying the signature based on the public key and the signature information includes:
calculation ofWhen->When the signature is correct;
wherein,is>And prime number->An operation result obtained by performing an exponential operation, +.>For the positive integer e and signature->An operation result obtained by performing an exponential operation, +.>Is->Is the modular product of>For abstracting the result M and prime number->And (5) performing exponential operation to obtain an operation result.
A critical data repudiation system comprising:
the digest function determining module is used for acquiring data m to be signed, acquiring a digest function set corresponding to the data m, and randomly selecting n digest functions from the digest function set;
the first calculation module is used for calculating summary results M corresponding to n summary functions;
a second calculation module for calculating the first prime number by the formula (1)And a second prime number->Is a Euler function value of (a);
formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->The first prime number on the number of the first,expansion of integer->And->On the integer complex plane, +.>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (a);
the private key generation module is used for randomly generating a private key of the data m based on the Euler function value;
the public key generation module is used for randomly generating a public key of the data m based on the Euler function value;
the signature information generation module is used for generating signature information of the data M based on the private key and the abstract result M;
and the verification module is used for verifying the signature based on the public key and the signature information.
An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the method when the computer program is executed.
A non-transitory computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the steps of the method.
The embodiment of the invention has the following advantages:
the key data anti-repudiation method comprises the steps of obtaining data m to be signed, obtaining a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set; calculating summary results M corresponding to n summary functions; calculating a first prime numberAnd a second prime number->Is a Euler function value of (a); randomly generating a private key of the data m based on the Euler function value; randomly generating a public key of the data m based on the euler function value; generating signature information of data M based on the private key and the abstract result M; and verifying the signature based on the public key and the signature information. Solves the problems of low safety characteristic, high cost and high anti-repudiation mechanism of key data in the prior artThe implementation is complicated.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below. It will be apparent to those skilled in the art from this disclosure that the drawings described below are merely exemplary and that other embodiments may be derived from the drawings provided without undue effort.
The structures, proportions, sizes, etc. shown in the present specification are shown only for the purposes of illustration and description, and are not intended to limit the scope of the invention, which is defined by the claims, so that any structural modifications, changes in proportions, or adjustments of sizes, which do not affect the efficacy or the achievement of the present invention, should fall within the scope of the invention.
FIG. 1 is a flow chart of a key data anti-repudiation method of the invention;
FIG. 2 is a block diagram of a key data anti-repudiation system according to the present invention;
fig. 3 is a schematic diagram of an entity structure of an electronic device according to the present invention.
Wherein the reference numerals are as follows:
the device comprises a digest function determination module 10, a first calculation module 20, a second calculation module 30, a private key generation module 40, a public key generation module 50, a signature information generation module 60, a verification module 70, an electronic device 80, a processor 801, a memory 802 and a bus 803.
Detailed Description
Other advantages and advantages of the present invention will become apparent to those skilled in the art from the following detailed description, which, by way of illustration, is to be read in connection with certain specific embodiments, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Examples
Fig. 1 is a flowchart of an embodiment of a key data anti-repudiation method according to the present invention, and as shown in fig. 1, the key data anti-repudiation method according to the embodiment of the present invention includes the following steps:
s101, acquiring data m to be signed, acquiring a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set;
specifically, the hash value length used by SHA256 algorithm for text data "Hello World" is 256 bits, which is an abstract class, the only implementation is SHA256 management) is "d2a84f4b8b650937ec8f73cd8be2c74add5a911ba64df27458ed8229da804a26", and the above results can be shuffled (inserted at intervals), spliced, etc. to form a new digest using SHA1 algorithm "648a6a6 ffdaa0badb23b8baf90b6168dd16b3 a". Different summary results generated for the same data are processed using set methods including stitching, ordered shuffling, random shuffling, or the like.
Preferably, n.ltoreq.3.
S102, calculating summary results M corresponding to n summary functions;
specifically, calculating a summary result M through a formula (2);
formula (2);
wherein M is the result of the abstract,，/>for the method set->For the purposes of method->For being signedData,/->..../>Different digest algorithms are collected for the digest function.
S103, calculating the first prime number through the formula (1)And a second prime number->Is a Euler function value of (a);
in particular, the method comprises the steps of,formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->The first prime number on the number of the first,expansion of integer->And->On the integer complex plane, +.>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (c).
For the followingThe upper number->In other words, can be written as +.>。
The key data anti-repudiation method further comprises the following steps:
performing modular operation through a formula (3);
formula (3);
wherein N is a modulo operation,is->Complex number of planes on->Is->Conjugation of->As real part->Is imaginary.Conjugate of +.>N is by default a modulo operation, whose value is a positive integer greater than zero.
And S104, randomly generating a private key of the data m based on the Euler function value.
Specifically, randomly selectPositive integer>And->The method comprises the steps of carrying out a first treatment on the surface of the Calculate->I.e. for->Calculating its index->And (2) is about>Taking the rest;
selectingE, and 0<e</>E and->Mutual quality;
calculating a positive integer reciprocal to the positive integer e number theory，0</></>，/>；
The private key is%)。
S105, randomly generating a public key of the data m based on the Euler function value;
specifically, randomly selecting the position satisfying the preset conditionPrime number->The method comprises the steps of carrying out a first treatment on the surface of the The method meets the preset conditions:and->I.e. +.>Is smaller than->And is in charge of>Mutually plain;
with the positive integerIs +_with the prime number>Performing exponential operation to obtain an operation result +.>；
The public key is%)。
S106, generating signature information of the data M based on the private key and the abstract result M;
specifically, a signature is calculated by the formula (4);
formula (4);
in the method, in the process of the invention,for signature->For a positive integer reciprocal to the positive integer e number theory, M is the summary result, ++>Is->Positive integer on>Is an integer, representing +.>Is a residual system;
with the positive integer e and the prime numberPerforming exponential operationObtaining the operation result->；
The signature information is%)。
S107, verifying the signature based on the public key and the signature information;
specifically, calculateWhen->When the signature is correct;
wherein,is>And prime number->An operation result obtained by performing an exponential operation, +.>For the positive integer e and signature->An operation result obtained by performing an exponential operation, +.>Is->Is the modular product of>For abstracting the result M and prime number->Performing exponential operation to obtainIs a result of the operation of (a).
The verifier receives the public key information and the signature information and verifies the signature, and the specific process is as follows:
verifier calculationThe method comprises the steps of carrying out a first treatment on the surface of the If the calculation result is +.>The signature is considered correct, otherwise it is considered illegal.
The principle derivation of the verification signature is as follows: due to signature informationThen->Wherein e and->The product is 1 because of the inverse of the number theory of prime modulus, and is +/according to the Feima's theorem>It can be verified whether the final signature information is legal.
The signature verification method is to directly calculate a composite hash function, wherein the composite hash function (usually selects two) can digest the original information according to a certain proportion and combine the results to obtain a mixed content, so that the signature verification party does not know the hash algorithm, but only needs to know the result of Ha Xihou, so that an attacker cannot know how to obtain the digest content from the original information, and cannot tamper.
According to the key data anti-repudiation method, the data m to be signed is obtained, a summary function set corresponding to the data m is obtained, and n summary functions are randomly selected from the summary function set; calculating summary results M corresponding to n summary functions; calculating a first prime numberAnd a second prime number->Is a Euler function value of (a); randomly generating a private key of the data m based on the Euler function value; randomly generating a public key of the data m based on the euler function value; generating signature information of data M based on the private key and the abstract result M; and verifying the signature based on the public key and the signature information. The problems of low safety characteristic, high cost and complex implementation of an anti-repudiation mechanism of key data in the prior art are solved.
Compared with the conventional RSA algorithm and the like, the key data anti-repudiation method is harder to guess and decompose because more elements are used in the public key and prime numbers exist on the expansion of the integers, so that the key data anti-repudiation method has stronger safety characteristics; for the above reasons, an attacker cannot generally tamper with the data using a public tool such as openssl, even if knowing what Hash algorithm the system uses to calculate the signature; the implementation of this patent is more compact and convenient without the aid of Public Key Infrastructure (PKI), and therefore without further additional economic overhead.
FIG. 2 is a diagram of an embodiment of a critical data anti-repudiation system according to the present invention; as shown in fig. 2, the key data anti-repudiation system provided by the embodiment of the invention comprises the following steps:
the digest function determining module 10 is configured to obtain data m to be signed, obtain a digest function set corresponding to the data m, and randomly select n digest functions from the digest function set;
a first calculation module 20, configured to calculate summary results M corresponding to n summary functions;
the first computing module 20 is further configured to:
calculating a summary result M through a formula (2);
male (Male)Formula (2);
wherein M is the result of the abstract,，/>for the method set->For the purposes of method->For data to be signed +.>..../>Different digest algorithms are collected for the digest function.
A second calculation module 30 for calculating the first prime number by the formula (1)And a second prime number->Is a Euler function value of (a);
formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->The first prime number on the number of the first,expansion of integer->And->On the integer complex plane, +.>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (a);
the second computing module 30 is further configured to:
performing modular operation through a formula (3);
formula (3);
wherein N is a modulo operation,is->The number of complex planes on the upper surface,/>is->Conjugation of->As real part->Is imaginary.
A private key generation module 40, configured to randomly generate a private key of the data m based on the euler function value;
the private key generation module 40 is further configured to:
randomly selectPositive integer>And->；
SelectingE, and 0<e</>E and->Mutual quality;
calculating a positive integer reciprocal to the positive integer e number theory，0</></>，/>；
The private key is%)。
A public key generation module 50 for randomly generating a public key of the data m based on the euler function value;
the public key generation module 50 is further configured to:
randomly selecting the position meeting the preset conditionPrime number->；
With the positive integerIs +_with the prime number>Performing exponential operation to obtain an operation result +.>；
The public key is%)。
A signature information generation module 60 for generating signature information of the data M based on the private key and the digest result M;
the signature information generation module 60 is configured to calculate a signature according to formula (4);
formula (4);
in the method, in the process of the invention,for a labelName (L)/(L)>For a positive integer reciprocal to the positive integer e number theory, M is the summary result, ++>Is->Positive integer on>Is an integer, representing +.>Is a residual system;
with the positive integer e and the prime numberPerforming exponential operation to obtain an operation result +.>；
The signature information is%)。
And a verification module 70, configured to verify the signature based on the public key and the signature information.
The verification module 70 is further configured to:
calculation ofWhen->When the signature is correct;
wherein,is>And prime numbers/>An operation result obtained by performing an exponential operation, +.>For the positive integer e and signature->An operation result obtained by performing an exponential operation, +.>Is->Is the modular product of>For abstracting the result M and prime number->And (5) performing exponential operation to obtain an operation result.
According to the key data anti-repudiation system, data m to be signed is obtained through a digest function determining module 10, a digest function set corresponding to the data m is obtained, and n digest functions are randomly selected from the digest function set; calculating summary results M corresponding to n summary functions through a first calculation module 20; calculating the first prime number by the second calculation module 30And a second prime number->Is a Euler function value of (a); randomly generating a private key of the data m based on the euler function value by a private key generation module 40; randomly generating a public key of the data m based on the euler function value by a public key generation module 50; generating signature information of the data M based on the private key and the digest result M by a signature information generation module 60; the signature is verified by a verification module 70 based on the public key and the signature information. The key data is resistedThe method for repudiation solves the problems of low safety characteristic, high cost and complex implementation of an anti-repudiation mechanism of key data in the prior art.
Fig. 3 is a schematic diagram of an entity structure of an electronic device according to an embodiment of the present invention, as shown in fig. 3, an electronic device 80 includes: a processor 801 (processor), a memory 802 (memory), and a bus 803;
the processor 801 and the memory 802 complete communication with each other through the bus 803;
the processor 801 is configured to invoke program instructions in the memory 802 to perform the methods provided by the above-described method embodiments, including, for example: acquiring data m to be signed, acquiring a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set; calculating summary results M corresponding to n summary functions; calculating a first prime numberAnd a second prime number->Is a Euler function value of (a); randomly generating a private key of the data m based on the Euler function value; randomly generating a public key of the data m based on the euler function value; generating signature information of data M based on the private key and the abstract result M; and verifying the signature based on the public key and the signature information.
The present embodiment provides a non-transitory computer readable storage medium storing computer instructions that cause a computer to perform the methods provided by the above-described method embodiments, for example, including: when data m to be signed is obtained, a summary function set corresponding to the data m is obtained, and n summary functions are randomly selected from the summary function set; calculating summary results M corresponding to n summary functions; calculating a first prime numberAnd a second prime number->Euler function value of (2)The method comprises the steps of carrying out a first treatment on the surface of the Randomly generating a private key of the data m based on the Euler function value; randomly generating a public key of the data m based on the euler function value; generating signature information of data M based on the private key and the abstract result M; and verifying the signature based on the public key and the signature information.
Those of ordinary skill in the art will appreciate that: all or part of the steps for implementing the above method embodiments may be implemented by hardware associated with program instructions, where the foregoing program may be stored in a computer readable storage medium, and when executed, the program performs steps including the above method embodiments; and the aforementioned storage medium includes: various storage media such as ROM, RAM, magnetic or optical disks may store program code.
The apparatus embodiments described above are merely illustrative, wherein elements illustrated as separate elements may or may not be physically separate, and elements shown as elements may or may not be physical elements, may be located in one place, or may be distributed over a plurality of network elements. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of this embodiment. Those of ordinary skill in the art will understand and implement the present invention without undue burden.
From the above description of the embodiments, it will be apparent to those skilled in the art that the embodiments may be implemented by means of software plus necessary general hardware platforms, or of course may be implemented by means of hardware. Based on such understanding, the foregoing technical solution may be embodied essentially or in a part contributing to the prior art in the form of a software product, which may be stored in a computer readable storage medium, such as ROM/RAM, a magnetic disk, an optical disk, etc., including several instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the embodiments or the methods of some parts of the embodiments.
While the invention has been described in detail in the foregoing general description and specific examples, it will be apparent to those skilled in the art that modifications and improvements can be made thereto. Accordingly, such modifications or improvements may be made without departing from the spirit of the invention and are intended to be within the scope of the invention as claimed.
Claims (10)
1. A method for resisting repudiation of key data, the method comprising:
acquiring data m to be signed, acquiring a summary function set corresponding to the data m, and randomly selecting n summary functions from the summary function set;
calculating summary results M corresponding to n summary functions;
calculating a first prime number by formula (1)And a second prime number->Is a Euler function value of (a);
formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->First prime number on->Expansion of integer->And->On the integer complex plane, +.>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (a);
randomly generating a private key of the data m based on the Euler function value;
randomly generating a public key of the data m based on the euler function value;
generating signature information of data M based on the private key and the abstract result M;
and verifying the signature based on the public key and the signature information.
2. The method for resisting repudiation of key data according to claim 1, wherein said calculating the summary results M corresponding to n summary functions comprises:
calculating a summary result M through a formula (2);
formula (2);
wherein M is the result of the abstract,，/>for the method set->For the purposes of method->For data to be signed +.>..../>Different digest algorithms are collected for the digest function.
3. The critical data anti-repudiation method of claim 1, further comprising:
performing modular operation through a formula (3);
formula (3);
wherein N is a modulo operation,is->Complex number of planes on->Is->Conjugation of->As real part->Is imaginary.
4. A critical data anti-repudiation method according to claim 3, wherein said randomly generating a private key for data m based on said euler function value comprises:
randomly selectPositive integer>And->；
SelectingE, and 0<e</>E and->Mutual quality;
calculating a positive integer reciprocal to the positive integer e number theory，0</></>，/>；
The private key is%)。
5. The critical data anti-repudiation method of claim 4, wherein said randomly generating a public key of data m based on said euler function value comprises:
randomly selecting the position meeting the preset conditionPrime number->；
With the positive integerIs +_with the prime number>Performing exponential operation to obtain an operation result +.>；
The public key is%)。
6. The critical data repudiation method of claim 5, wherein the generating signature information of data m based on the private key comprises:
calculating a signature by formula (4);
formula (4);
in the method, in the process of the invention,for signature->For a positive integer reciprocal to the positive integer e number theory, M is the summary result, ++>Is->Positive integer on>Is an integer, representing +.>Is a residual system;
with the positive integer e and the prime numberPerforming exponential operation to obtain an operation result +.>；
The signature information is%)。
7. The critical data anti-repudiation method of claim 6, wherein said verifying a signature based on said public key and signature information comprises:
calculation ofWhen->When the signature is correct;
wherein,is>And prime number->An operation result obtained by performing an exponential operation, +.>To be signed with positive integer eAn operation result obtained by performing an exponential operation, +.>Is->Is the modular product of>For abstracting the result M and prime number->And (5) performing exponential operation to obtain an operation result.
8. A critical data repudiation system, comprising:
the digest function determining module is used for acquiring data m to be signed, acquiring a digest function set corresponding to the data m, and randomly selecting n digest functions from the digest function set;
the first calculation module is used for calculating summary results M corresponding to n summary functions;
a second calculation module for calculating the first prime number by the formula (1)And a second prime number->Is a Euler function value of (a);
formula (1);
in the method, in the process of the invention,for the first prime number->And a second prime number->Euler function value, < >>Is->First prime number on->Expansion of integer->And->On an integer complex plane，/>Is->A second prime number on, and said first prime number +>And said second prime number->Prime numbers on non-integers, N is modulo arithmetic, +.>Is->Is a modulus product of (a);
the private key generation module is used for randomly generating a private key of the data m based on the Euler function value;
the public key generation module is used for randomly generating a public key of the data m based on the Euler function value;
the signature information generation module is used for generating signature information of the data M based on the private key and the abstract result M;
and the verification module is used for verifying the signature based on the public key and the signature information.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method according to any one of claims 1 to 7 when the computer program is executed.
10. A non-transitory computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410201415.9A CN117792660A (en) | 2024-02-23 | 2024-02-23 | Key data anti-repudiation method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202410201415.9A CN117792660A (en) | 2024-02-23 | 2024-02-23 | Key data anti-repudiation method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN117792660A true CN117792660A (en) | 2024-03-29 |
Family
ID=90380100
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202410201415.9A Pending CN117792660A (en) | 2024-02-23 | 2024-02-23 | Key data anti-repudiation method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN117792660A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100046745A1 (en) * | 2008-08-25 | 2010-02-25 | Kabushiki Kaisha Toshiba | Encrypting apparatus, decrypting apparatus, cryptocommunication system, and methods and computer program products therefor |
| CN103117857A (en) * | 2013-01-16 | 2013-05-22 | 深圳市怡化电脑有限公司 | Automatic teller machine (ATM) information safety detection method and system based on hardware encryption algorithm |
| CN104463267A (en) * | 2014-10-31 | 2015-03-25 | 武汉大学 | RFID comprehensive encryption method for electric vehicle charging station |
| CN108055128A (en) * | 2017-12-18 | 2018-05-18 | 数安时代科技股份有限公司 | Generation method, device, storage medium and the computer equipment of RSA key |
| CN110098940A (en) * | 2019-06-10 | 2019-08-06 | 卓尔智联(武汉)研究院有限公司 | Email signature method, apparatus and storage medium |
| CN117155615A (en) * | 2023-08-11 | 2023-12-01 | 中信科移动通信技术股份有限公司 | Data encryption transmission method, system, electronic equipment and storage medium |
-
2024
- 2024-02-23 CN CN202410201415.9A patent/CN117792660A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100046745A1 (en) * | 2008-08-25 | 2010-02-25 | Kabushiki Kaisha Toshiba | Encrypting apparatus, decrypting apparatus, cryptocommunication system, and methods and computer program products therefor |
| CN103117857A (en) * | 2013-01-16 | 2013-05-22 | 深圳市怡化电脑有限公司 | Automatic teller machine (ATM) information safety detection method and system based on hardware encryption algorithm |
| CN104463267A (en) * | 2014-10-31 | 2015-03-25 | 武汉大学 | RFID comprehensive encryption method for electric vehicle charging station |
| CN108055128A (en) * | 2017-12-18 | 2018-05-18 | 数安时代科技股份有限公司 | Generation method, device, storage medium and the computer equipment of RSA key |
| CN110098940A (en) * | 2019-06-10 | 2019-08-06 | 卓尔智联(武汉)研究院有限公司 | Email signature method, apparatus and storage medium |
| CN117155615A (en) * | 2023-08-11 | 2023-12-01 | 中信科移动通信技术股份有限公司 | Data encryption transmission method, system, electronic equipment and storage medium |
Non-Patent Citations (3)
| Title |
|---|
| SANGEETA PATEL ET AL.: "A Novel Method of Encryption using Modified RSA Algorithm and Chinese Remainder Theorem", ETHESIS @ NIT ROURKELA, 11 May 2009 (2009-05-11), pages 4 * |
| 余亚辉;: "基于数论的RSA算法研究", 课程教育研究, no. 14, 15 May 2014 (2014-05-15) * |
| 贺卫红, 曹毅: "RSA公钥密码体制在数字签名中的应用", 微机发展, no. 09, 10 September 2003 (2003-09-10) * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107483212B (en) | Method for generating digital signature by cooperation of two parties | |
| US10652026B2 (en) | Implicitly certified digital signatures | |
| CN111066285B (en) | SM2 signature based public key recovery method | |
| CN108683493B (en) | Data aggregation method for providing privacy protection in smart power grid | |
| JP2023099091A (en) | Method, storage medium and electronic device for secure dynamic threshold signature scheme | |
| RU2376651C2 (en) | Using isogenies to design cryptosystems | |
| EP2533457B1 (en) | Secure implicit certificate chaining | |
| CN109818730B (en) | Blind signature acquisition method and device and server | |
| CN107911217B (en) | Method and device for cooperatively generating signature based on ECDSA algorithm and data processing system | |
| US20160352525A1 (en) | Signature protocol | |
| CN112436938B (en) | Digital signature generation method and device and server | |
| CN107947939A (en) | Support the PDF endorsement methods and system of SM3 cryptographic Hash algorithm and SM2 Digital Signature Algorithms | |
| US20150006900A1 (en) | Signature protocol | |
| Kumar et al. | An efficient implementation of digital signature algorithm with SRNN public key cryptography | |
| CN116566626B (en) | Ring signature method and apparatus | |
| CN111565108B (en) | Signature processing method, device and system | |
| Fanfara et al. | Usage of asymmetric encryption algorithms to enhance the security of sensitive data in secure communication | |
| Shankar et al. | Improved Multisignature Scheme for Authenticity of Digital Document in Digital Forensics Using Edward-Curve Digital Signature Algorithm | |
| CN110324357B (en) | Data sending method and device and data receiving method and device | |
| Xia et al. | An improved privacy preserving construction for data integrity verification in cloud storage | |
| WO2023159849A1 (en) | Digital signature methods, computer device and medium | |
| CN117792660A (en) | Key data anti-repudiation method and system | |
| CN111274613B (en) | Iterative SM2 digital signature generation method, system, medium and device | |
| TWI381696B (en) | Authentication based on asymmetric cryptography utilizing rsa with personalized secret | |
| CN115134093B (en) | Digital signature method and computing device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |