CN109245892A - Variable length key RSA cryptographic algorithms big data information security processing method and system - Google Patents
Variable length key RSA cryptographic algorithms big data information security processing method and system Download PDFInfo
- Publication number
- CN109245892A CN109245892A CN201811343903.4A CN201811343903A CN109245892A CN 109245892 A CN109245892 A CN 109245892A CN 201811343903 A CN201811343903 A CN 201811343903A CN 109245892 A CN109245892 A CN 109245892A
- Authority
- CN
- China
- Prior art keywords
- message
- function
- key
- prime number
- data information
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/302—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters involving the integer factorization problem, e.g. RSA or quadratic sieve [QS] schemes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L9/00—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
- H04L9/30—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy
- H04L9/3006—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters
- H04L9/3033—Public key, i.e. encryption algorithm being computationally infeasible to invert or user's encryption keys not requiring secrecy underlying computational problems or public-key parameters details relating to pseudo-prime or prime number generation, e.g. primality test
Abstract
The invention belongs to data information security technical fields, more particularly to a kind of big data information security processing method of variable length key RSA cryptographic algorithms, present invention simultaneously provides a kind of big data information security processing systems of variable length key RSA cryptographic algorithms, this method includes that key generates: prime number p and prime number q, common element N is obtained by common element function, and intermediate variable r is calculated according to Euler's function, selection one is less than the integer e of r, mould antielement d is calculated by mould inverse function, determine public keys (N, and private key (N e), d), the present invention solves the prior art and exists since symmetric encipherment algorithm uses identical key, therefore both parties use same key, the problem of safety cannot be guaranteed, have systematic highly-safe, it is simple and practical, elongated transmission, the effect of the safety of signature Fruit.
Description
Technical field
The invention belongs to data information security technical field more particularly to a kind of big numbers of variable length key RSA cryptographic algorithms
According to information security processing method, present invention simultaneously provides a kind of processing of the big data information security of variable length key RSA cryptographic algorithms
System.
Background technique
RSA cryptographic algorithms are a kind of rivest, shamir, adelmans.RSA is made extensively in public key encryption and e-business
With.RSA is 1977 by Peter Lonard Lee Vista (Ron Rivest), A Di Shamir (Adi Shamir) He Lunna
De Ademan (Leonard Adleman) is proposed together.Three of them worked in the Massachusetts Institute of Technology at that time.RSA is just
That their three people's surnames beginning letter is stitched together composition, the prior art exist due to symmetric encipherment algorithm use it is identical close
Key, therefore the problem of both parties use same key, and safety cannot be guaranteed.
Summary of the invention
The present invention provides the big data information security processing method and system of a kind of variable length key RSA cryptographic algorithms, with solution
The prior art is proposed in certainly above-mentioned background technique to exist since symmetric encipherment algorithm uses identical key, both parties
All use same key, the problem of safety cannot be guaranteed.
Technical problem solved by the invention is realized using following technical scheme: a kind of variable length key RSA cryptographic algorithms
Big data information security processing method, comprising:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Further, the prime number p and prime number q is randomly generated and is prime number.
Further,
If setting p=1 and q=11, N=33 is obtained according to common element function；
R=11 is obtained according to Euler's function；
If set n=1 and e, d as positive integer and e and r it is relatively prime, exd=21 and e=3 and d=are obtained according to mould inverse function
7；
Determine public keys (33,3) and private key (33,7).
Further, the key generation can be applied to information signature.
Further, the message m can be converted to the Unicode code of this word, and corresponding Unicode code is connected together
A message number is formed, if message number is greater than 16, by corresponding message number by 16 segmentations, then by every one 16
Segmentation is converted to positive integer n.
Meanwhile the present invention also provides a kind of big data information security processing systems of variable length key RSA cryptographic algorithms, it is special
Sign is, including key generation module, message encryption module and message deciphering module；
The key generation module is used for:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
The message encryption module is used for:
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
The message deciphering module is used for:
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Advantageous effects:
1, the present invention uses a kind of big data information security processing method of variable length key RSA cryptographic algorithms, comprising:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Since sender will be sent to one personal information of another client by a client, sender first will be given birth to
At a public keys and a private key, random selection two big prime number p and q, p are not equal to q, calculate N=pq, according to
Euler's function acquires r=(p-1) (q-1), selects the integer e for being less than r, acquires mould antielement of the e about mould r, be named as
D, it is relatively prime with r and if only if e due to the presence of mould antielement, the record of p and q is destroyed, (N, e) is public keys, (N, d)
For private key, sender sends its public keys to reciever, and his private key (N, d) is stashed, wherein
For encrypting, private key, by the generation of public keys and two sets of keys of private key, guarantees public keys for decrypting
The safety of system.
2, the present invention passes through message encryption: if sending a message m and determining public keys (N, e), then passing through the anti-letter of mould
Message m is converted to the positive integer n for being less than N by number；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Since sender is intended to send a message m, reciever is had received public keys (N, e), reciever use with it about
M is converted to the positive integer n for being less than N by fixed format, then calculates c by formula, is returned it into after calculating c by recipient
Sender is decoded, and c is converted to n, after obtaining n, by information m after sender obtains the c of reciever return using key d
It restores, it is thereby achieved that the encoding and decoding of big data information security, the advantage of asymmetric arithmetic is that key distribution means are relatively simple
It is single, it is assumed that two users will mutually transfer data, and both sides first exchange public keys, if the public keys secret of other side, separately
One side need to only be decrypted with the private key of oneself, and therefore, it is practical that the distribution of such key will become very simple.
3, the present invention can be converted to the Unicode code of this word using the message m, by corresponding Unicode code company
A message number is formed together, if message number is greater than 16, by corresponding message number by 16 segmentations, then will be every
One 16 segmentations are converted to positive integer n, due to the decryption by Unicode code, it can be achieved that the elongated transmission of long data.
4, the present invention can be applied to information signature using key generation, since RSA can also be used to as a message
Signature, if first wants that the message that a signature is transmitted to second, first calculate a hashed value for his message, then passes through his close
Key encrypts this hashed value, and this " signature " is added in the back of message, this message only uses his public keys ability
Be decrypted, after second obtains this message, this hashed value can be decrypted with the public keys of first, then by this data and he from
Oneself compares for the hashed value that this message calculates, if if the two is consistent, then he can instruct addresser to hold first
Key and this message be not tampered on propagation path, to improve the safety of signature.
5, present invention simultaneously provides a kind of big data information security processing systems of variable length key RSA cryptographic algorithms, improve
The practicability of system.
Detailed description of the invention
Fig. 1 is that a kind of key of the big data information security processing method of variable length key RSA cryptographic algorithms of the present invention generates
Algorithm flow chart；
Fig. 2 is a kind of message encryption of the big data information security processing method of variable length key RSA cryptographic algorithms of the present invention
Algorithm flow chart；
Fig. 3 is a kind of message decryption of big data information security processing method of variable length key RSA cryptographic algorithms of the present invention
Algorithm flow chart；
Specific embodiment
The present invention is described further below in conjunction with attached drawing:
In figure:
S101- prime number p and prime number q obtains common element N by common element function；
S102- calculates intermediate variable r according to Euler's function；
S103- selects the integer e for being less than r, calculates mould antielement d by mould inverse function；
S104- determines public keys (N, e) and private key (N, d)；
If S201- sends a message m and determines public keys (N, e)；
Message m is converted to the positive integer n for being less than N by mould inverse function by S202-；
S203- calculates encryption message c by message transfer function；
S204- will encrypt message c transmission；
C is reduced to the positive integer n for being less than N by decoding functions by S301-；
Decoding functions are converted to prime number transfer function by S302-；
Embodiment:
The present embodiment: as shown in Figure 1, a kind of big data information security processing method of variable length key RSA cryptographic algorithms, packet
It includes:
Key generates: prime number p and prime number q, obtains common element NS101 by common element function；
The common element function is
Intermediate variable rS102 is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement dS103 by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d) S104.
As shown in Fig. 2, message encryption: if sending a message m and determining public keys (N, e) S201, then anti-by mould
Message m is converted to the positive integer n S202 for being less than N by function；
Encryption message cS203 is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent into cS204；
As shown in figure 3, message is decrypted: c being reduced to the positive integer n S301 for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function S302；
The prime number transfer function is。
Due to the big data information security processing method using a kind of variable length key RSA cryptographic algorithms, comprising:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Since sender will be sent to one personal information of another client by a client, sender first will be given birth to
At a public keys and a private key, random selection two big prime number p and q, p are not equal to q, calculate N=pq, according to
Euler's function acquires r=(p-1) (q-1), selects the integer e for being less than r, acquires mould antielement of the e about mould r, be named as
D, it is relatively prime with r and if only if e due to the presence of mould antielement, the record of p and q is destroyed, (N, e) is public keys, (N, d)
For private key, sender sends its public keys to reciever, and his private key (N, d) is stashed, wherein
For encrypting, private key, by the generation of public keys and two sets of keys of private key, guarantees public keys for decrypting
The safety of system.
Due to passing through message encryption:, then will by mould inverse function if sending a message m and determining public keys (N, e)
Message m is converted to the positive integer n for being less than N；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Since sender is intended to send a message m, reciever is had received public keys (N, e), reciever use with it about
M is converted to the positive integer n for being less than N by fixed format, then calculates c by formula, is returned it into after calculating c by recipient
Sender is decoded, and c is converted to n, after obtaining n, by information m after sender obtains the c of reciever return using key d
It restores, it is thereby achieved that the encoding and decoding of big data information security, the advantage of asymmetric arithmetic is that key distribution means are relatively simple
It is single, it is assumed that two users will mutually transfer data, and both sides first exchange public keys, if the public keys secret of other side, separately
One side need to only be decrypted with the private key of oneself, and therefore, it is practical that the distribution of such key will become very simple.
The prime number p and prime number q is randomly generated and is prime number.
If setting p=1 and q=11, N=33 is obtained according to common element function；
R=11 is obtained according to Euler's function；
If set n=1 and e, d as positive integer and e and r it is relatively prime, exd=21 and e=3 and d=are obtained according to mould inverse function
7；
Determine public keys (33,3) and private key (33,7).
The key generation can be applied to information signature.
Due to can be applied to information signature using key generation, since RSA can also be used to sign for a message,
If first wants that the message for transmitting a signature to second, first calculate a hashed value for his message, then adds by his key
This close hashed value, and this " signature " is added in the back of message, this message only uses his public keys that could be solved
It is close, after second obtains this message, this hashed value can be decrypted with the public keys of first, then be with himself by this data
The hashed value that this message calculates compares, if if the two is consistent, then he can instruct addresser to hold the close of first
Key and this message were not tampered on propagation path, to improve the safety of signature.
The message m can be converted to the Unicode code of this word, and corresponding Unicode code is connected together composition one
A message number by corresponding message number by 16 segmentations, then every one 16 is segmented and is turned if message number is greater than 16
It is changed to positive integer n.
Since the Unicode code of this word can be converted to using the message m, corresponding Unicode code is connected in one
One message number of composition is played, if message number is greater than 16, by corresponding message number by 16 segmentations, then by every 1
Position segmentation is converted to positive integer n, due to the decryption by Unicode code, it can be achieved that the elongated transmission of long data.
Meanwhile the present invention also provides a kind of big data information security processing systems of variable length key RSA cryptographic algorithms, it is special
Sign is, including key generation module, message encryption module and message deciphering module；
The key generation module is used for:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
The message encryption module is used for:
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
The message deciphering module is used for:
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is
Due to mentioning present invention simultaneously provides a kind of big data information security processing system of variable length key RSA cryptographic algorithms
The high practicability of system.
Working principle:
The present invention is generated by key: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d).
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted by mould inverse function
It is less than the positive integer n of N for one；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Since sender will be sent to one personal information of another client by a client, sender first will be given birth to
At a public keys and a private key, random selection two big prime number p and q, p are not equal to q, calculate N=pq, according to
Euler's function acquires r=(p-1) (q-1), selects the integer e for being less than r, acquires mould antielement of the e about mould r, be named as
D, it is relatively prime with r and if only if e due to the presence of mould antielement, the record of p and q is destroyed, (N, e) is public keys, (N, d)
For private key, sender sends its public keys to reciever, and his private key (N, d) is stashed, wherein
For public keys for encrypting, private key passes through the generation of public keys and two sets of keys of private key, this hair for decrypting
The bright prior art that solves exists since symmetric encipherment algorithm is using identical key, and both parties use same key
The problem of spoon, safety cannot be guaranteed, has systematic highly-safe, simple and practical, the elongated safety transmitted, signed
Advantageous effects.
Using technical solution of the present invention or those skilled in the art under the inspiration of technical solution of the present invention, design
Similar technical solution out, and reach above-mentioned technical effect, it is to fall into protection scope of the present invention.
Claims (6)
1. a kind of big data information security processing method of variable length key RSA cryptographic algorithms characterized by comprising
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d)；
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted to one by mould inverse function
A positive integer n less than N；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
2. a kind of big data information security processing method of variable length key RSA cryptographic algorithms according to claim 1, special
Sign is that the prime number p and prime number q are randomly generated and are prime number.
3. a kind of big data information security processing method of variable length key RSA cryptographic algorithms according to claim 1, special
Sign is:
If setting p=1 and q=11, N=33 is obtained according to common element function；
R=11 is obtained according to Euler's function；
If set n=1 and e, d as positive integer and e and r it is relatively prime, exd=21 and e=3 and d=7 are obtained according to mould inverse function；
Determine public keys (33,3) and private key (33,7).
4. a kind of big data information security processing method of variable length key RSA cryptographic algorithms according to claim 1, special
Sign is that the key generation can be applied to information signature.
5. a kind of big data information security processing method of variable length key RSA cryptographic algorithms according to claim 1, special
Sign is that the message m can be converted to the Unicode code of this word, and corresponding Unicode code is connected together and forms one
Corresponding message number is segmented, then every one 16 segmentations are converted by message number if message number is greater than 16 by 16
For positive integer n.
6. a kind of big data information security processing system of variable length key RSA cryptographic algorithms, which is characterized in that generated including key
Module, message encryption module and message deciphering module；
The key generation module is used for:
Key generates: prime number p and prime number q, obtains common element N by common element function；
The common element function is
Intermediate variable r is calculated according to Euler's function；
The Euler's function is r=(p-1) x (q-1)；
Selection one is less than the integer e of r, calculates mould antielement d by mould inverse function；
The mould inverse function is
Determine public keys (N, e) and private key (N, d)；
The message encryption module is used for:
Message encryption: if sending a message m and determining public keys (N, e), then message m is converted to one by mould inverse function
A positive integer n less than N；
Encryption message c is calculated by message transfer function again；
The message transfer function is ne=c (mod N)；
Encryption message c is sent；
The message deciphering module is used for:
Message decryption: c is reduced to the positive integer n for being less than N by decoding functions；
The decoding functions are cd=n (mod N)；
Decoding functions are converted into prime number transfer function；
The prime number transfer function is。
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811343903.4A CN109245892A (en) | 2018-11-13 | 2018-11-13 | Variable length key RSA cryptographic algorithms big data information security processing method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811343903.4A CN109245892A (en) | 2018-11-13 | 2018-11-13 | Variable length key RSA cryptographic algorithms big data information security processing method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109245892A true CN109245892A (en) | 2019-01-18 |
Family
ID=65078408
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811343903.4A Pending CN109245892A (en) | 2018-11-13 | 2018-11-13 | Variable length key RSA cryptographic algorithms big data information security processing method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109245892A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11101987B2 (en) | 2019-06-10 | 2021-08-24 | International Business Machines Corporation | Adaptive encryption for entity resolution |
| CN113420304A (en) * | 2021-05-21 | 2021-09-21 | 巨霖(上海)微电子有限公司 | Encryption and decryption method, device and computer readable medium for SPICE netlist and model |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106850670A (en) * | 2017-03-06 | 2017-06-13 | 浙江晨泰科技股份有限公司 | A kind of charging pile communication system encrypting and decrypting method |
| CN107332663A (en) * | 2017-07-04 | 2017-11-07 | 四川云物益邦科技有限公司 | Archive management method based on encryption technology |
| CN107682379A (en) * | 2017-11-22 | 2018-02-09 | 南京汽车集团有限公司 | Safe information transmission device, transmission method and storage method based on homomorphic cryptography |
-
2018
- 2018-11-13 CN CN201811343903.4A patent/CN109245892A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106850670A (en) * | 2017-03-06 | 2017-06-13 | 浙江晨泰科技股份有限公司 | A kind of charging pile communication system encrypting and decrypting method |
| CN107332663A (en) * | 2017-07-04 | 2017-11-07 | 四川云物益邦科技有限公司 | Archive management method based on encryption technology |
| CN107682379A (en) * | 2017-11-22 | 2018-02-09 | 南京汽车集团有限公司 | Safe information transmission device, transmission method and storage method based on homomorphic cryptography |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US11101987B2 (en) | 2019-06-10 | 2021-08-24 | International Business Machines Corporation | Adaptive encryption for entity resolution |
| CN113420304A (en) * | 2021-05-21 | 2021-09-21 | 巨霖(上海)微电子有限公司 | Encryption and decryption method, device and computer readable medium for SPICE netlist and model |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Padmavathi et al. | A survey on performance analysis of DES, AES and RSA algorithm along with LSB substitution | |
| Jirwan et al. | Review and analysis of cryptography techniques | |
| Ayele et al. | A modified RSA encryption technique based on multiple public keys | |
| Shankar et al. | Hybrid cryptographic technique using RSA algorithm and scheduling concepts | |
| Garg et al. | Comparison of asymmetric algorithms in cryptography | |
| Chhabra et al. | Modified RSA algorithm: a secure approach | |
| Al Busafi et al. | Review and analysis of cryptography techniques | |
| CN109245892A (en) | Variable length key RSA cryptographic algorithms big data information security processing method and system | |
| Singh et al. | Comparative study of DES, 3DES, AES and RSA | |
| Ordonez et al. | Modified El Gamal algorithm for multiple senders and single receiver encryption | |
| Kumar et al. | Distinction between Secret key and Public key Cryptography with existing Glitches | |
| Gobi et al. | A comparative study on the performance and the security of RSA and ECC algorithm | |
| Goel | Encryption algorithm using dual modulus | |
| KR100388059B1 (en) | Data encryption system and its method using asymmetric key encryption algorithm | |
| Sheth et al. | Analysis of cryptography techniques | |
| Kaur et al. | An Encryption Scheme Based on AES and SHA-512 | |
| Kaur et al. | Comparative Study Of Different Cryptoghraphic Algorithms. | |
| Daeri et al. | ElGamal public-key encryption | |
| CN104158663B (en) | A kind of public-key cryptosystem and endorsement method based on hyperbolic line-group arithmetic | |
| Rawal et al. | Cryptography Algorithm | |
| AU2021106127A4 (en) | A novel cloud cryptography based on adaptive configuration | |
| SEM | Introduction to Block chain | |
| Kumar et al. | A survey on various asymmetric algorithms | |
| Koren | Introduction to Cryptography | |
| Balitanas | Wi Fi protected access-pre-shared key hybrid algorithm |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190118 |