CN111756540B - Ciphertext transmission method, terminal, server and system - Google Patents
Ciphertext transmission method, terminal, server and system Download PDFInfo
- Publication number
- CN111756540B CN111756540B CN201910231016.6A CN201910231016A CN111756540B CN 111756540 B CN111756540 B CN 111756540B CN 201910231016 A CN201910231016 A CN 201910231016A CN 111756540 B CN111756540 B CN 111756540B
- Authority
- CN
- China
- Prior art keywords
- sequence
- data
- random number
- ciphertext
- key
- 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.)
- Active
Links
Images
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/32—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
- H04L9/3271—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using challenge-response
- H04L9/3278—Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using challenge-response using physically unclonable functions [PUF]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L63/00—Network architectures or network communication protocols for network security
- H04L63/06—Network architectures or network communication protocols for network security for supporting key management in a packet data network
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0816—Key establishment, i.e. cryptographic processes or cryptographic protocols whereby a shared secret becomes available to two or more parties, for subsequent use
- H04L9/0819—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s)
- H04L9/0822—Key transport or distribution, i.e. key establishment techniques where one party creates or otherwise obtains a secret value, and securely transfers it to the other(s) using key encryption key
-
- 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/08—Key distribution or management, e.g. generation, sharing or updating, of cryptographic keys or passwords
- H04L9/0861—Generation of secret information including derivation or calculation of cryptographic keys or passwords
- H04L9/0869—Generation of secret information including derivation or calculation of cryptographic keys or passwords involving random numbers or seeds
Landscapes
- Engineering & Computer Science (AREA)
- Computer Security & Cryptography (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Computer Hardware Design (AREA)
- Computing Systems (AREA)
- General Engineering & Computer Science (AREA)
- Storage Device Security (AREA)
- Mobile Radio Communication Systems (AREA)
Abstract
The embodiment of the invention provides a method, a terminal, a server and a system for transmitting ciphertext, wherein the method applied to the terminal comprises the following steps: generating a generated response sequence through the PUF chip according to the challenge sequence in the challenge response pair; acquiring a random number sequence, and performing post-processing on the random number sequence to acquire a secret key; encrypting data acquired by a terminal according to the secret key to obtain a ciphertext; encrypting the secret key according to the random number sequence and the generated response sequence to obtain auxiliary data; and sending the auxiliary data and the ciphertext. The method applied to the server side comprises the following steps: receiving auxiliary data and ciphertext from a terminal; recovering the auxiliary data according to the response sequence in the challenge response pair to obtain a secret key; and decrypting the ciphertext according to the key to obtain data acquired by the terminal. The invention can encrypt data through the key of the PUF chip end to transmit to the server end, and simplify the PUF end structure.
Description
Technical Field
The present invention relates to the field of information security technologies, and in particular, to a method, a terminal, a server, and a system for transmitting ciphertext.
Background
The uncloneable function chip (PUF chip) is a physical analog signal function mapping. The PUF chip is subject to external environmental influences such as temperature, mechanical stress and even cosmic rays, and further, the functional relationship is subject to aging of device performance in the chip along with time, so that a challenge response (CR pair) generated by the PUF chip during use is different from a CR pair registered on a data platform or a server, and usually the differences are small; but is not acceptable for PUF chips for authentication and encryption. The authentication and encryption/decryption are carried out under the state of pure digital operation, the digital keys have to have avalanche performance, and the authentication and encryption states can be changed thoroughly with very small difference. So that very small changes in the mapping properties of the PUF chip function cannot be used without error correction.
When the PUF end needs to send data to be encrypted to the server end, the transmitted data is encrypted by receiving key data sent by the server end and decrypting the key, in this case, the PUF end needs to have a decoding function, and for the PUF end, a complex design has an influence on PUF stability.
Disclosure of Invention
The embodiment of the invention provides a method, a terminal, a server and a system for transmitting ciphertext, so that data can be transmitted to the server through encryption by a key generated by a PUF chip end, and the PUF end structure is simplified.
In one aspect, an embodiment of the present invention provides a method for transmitting ciphertext, which is applied to a terminal, where the method includes:
generating a generated response sequence corresponding to the challenge response pair through the non-replicable functional chip according to the challenge sequence in the challenge response pair;
acquiring a random number sequence, performing post-processing on the random number sequence, and taking the post-processed random number sequence as a secret key;
encrypting the data acquired by the terminal according to the secret key to obtain a ciphertext;
encrypting the secret key according to the random number sequence and the generated response sequence to obtain auxiliary data;
and sending the auxiliary data and the ciphertext.
On the other hand, the embodiment of the invention provides a method for transmitting ciphertext, which is applied to a server side, and comprises the following steps:
receiving auxiliary data and ciphertext from a terminal;
recovering the auxiliary data according to a response sequence in the challenge response pair to obtain a secret key;
and decrypting the ciphertext according to the key to obtain data acquired by the terminal.
In still another aspect, an embodiment of the present invention provides a terminal for transmitting ciphertext, where the terminal includes:
a generated response sequence acquisition unit for generating a generated response sequence corresponding to a challenge response pair through a non-replicable functional chip according to the challenge sequence in the challenge response pair;
the key acquisition unit is used for acquiring a random number sequence, carrying out post-processing on the random number sequence, and taking the random number sequence after the post-processing as a key;
the ciphertext encrypting unit encrypts the data acquired by the terminal according to the secret key to obtain ciphertext;
a key encryption unit for encrypting the key according to the random number sequence and the generated response sequence to obtain auxiliary data;
and the information sending unit is used for sending the auxiliary data and the ciphertext.
In yet another aspect, an embodiment of the present invention provides a server for transmitting ciphertext, the server including:
an information receiving unit for receiving the auxiliary data and the ciphertext from the terminal;
the key decryption unit is used for recovering the auxiliary data according to a response sequence in the challenge response pair to obtain a key; the method comprises the steps of carrying out a first treatment on the surface of the
And the ciphertext decrypting unit decrypts the ciphertext according to the key to obtain data acquired by the terminal.
In still another aspect, an embodiment of the present invention provides a system for transmitting ciphertext, where the system includes the terminal for transmitting ciphertext and the server for transmitting ciphertext.
The technical scheme has the following beneficial effects: the invention encrypts the secret key by generating the response sequence and the random number sequence according to the challenge sequence by the PUF end, and adopts a part of the random number sequence as the secret key, thereby improving the entropy source characteristic of the secret key, and the PUF terminal generates the secret key and encrypts the ciphertext for transmission, so that the PUF chip only needs to have the encoding functions of the RNG generator and the RNG, and does not need to set a decoding function, thereby simplifying the design of the PUF and increasing the stability of the PUF.
Drawings
In order to more clearly illustrate the embodiments of the invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the invention, and that other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flow chart of a method of transmitting ciphertext in accordance with an embodiment of the present invention;
FIG. 2 is a flow chart of a method of transmitting ciphertext in accordance with an embodiment of the present invention;
fig. 3 is a schematic structural diagram of a terminal for transmitting ciphertext according to an embodiment of the invention;
FIG. 4 is a schematic diagram of the structure of a key encryption unit according to an embodiment of the present invention;
FIG. 5 is a schematic diagram of a server for transmitting ciphertext according to an embodiment of the invention;
fig. 6 is a schematic diagram of the structure of a key decryption unit according to an embodiment of the present invention.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, 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.
As shown in fig. 1, a flowchart of a method for transmitting ciphertext according to an embodiment of the present invention is provided, where the method is applied to a terminal, and the method includes:
s101, generating a generated response sequence corresponding to a challenge response pair through a non-replicable functional chip according to the challenge sequence in the challenge response pair;
s102, acquiring a random number sequence, performing post-processing on the random number sequence, and taking the post-processed random number sequence as a secret key;
s103, encrypting the data acquired by the terminal according to the secret key to obtain a ciphertext;
s104, encrypting the secret key according to the random number sequence and the generated response sequence to obtain auxiliary data;
and S105, transmitting the auxiliary data and the ciphertext.
When a terminal with a non-replicable function chip needs to transmit data collected by the terminal to a server and the data needs to be transmitted in an encrypted mode, a challenge sequence C in a CR pair of challenge response registered at the server is obtained, and a PUF chip generates a response sequence R' corresponding to the challenge sequence C according to the challenge sequence C; a random number sequence RNG is obtained by adding a random number sequence RNG generator into a PUF chip in advance, in order to make the entropy source characteristic of the data used as a secret key better, a PUF terminal further extracts a part of the random number sequence RNG from the RNG, namely, the random number sequence RNG is subjected to post-processing, for example, a shift register method and the like, namely, a part of the random number sequence RNG1 is used as the secret key, and the data collected by the terminal are encrypted by using the secret key and are called ciphertext; the encryption of the secret key is carried out through the random number sequences RNG and R ', the R' is used for encrypting RNG1, and the PUF terminal sends the encrypted secret key data and ciphertext to the server.
Therefore, the PUF chip only needs to correspondingly arrange the RNG generator and the encoding function with the RNG, and does not need a decoding function, so that the design of the PUF can be simplified.
Further, the encrypting the key according to the random number sequence and the generated response sequence to obtain auxiliary data includes:
encoding the random number sequence by an error checking and correcting encoding method to obtain a random number sequence with a check code;
performing one-time pad encryption on the generated response sequence by using the random number sequence with the check code to obtain first data;
performing one-time pad encryption on the secret key by using the generated response sequence to obtain second data;
auxiliary data comprising the first data and the second data is obtained.
At the PUF terminal, the following is shown:
taking a random number sequence RNG, and coding the random number sequence by an error checking and correcting coding method ECC coding method; the ECC code can be a BCH error correction code obtained by a binary linear code BCH code coding method, or an LDPC code obtained by a low density parity check code LDPC code coding method, depending on the code length. The challenge response sequence produced by a PUF is typically short, and BCH encoding is sufficient. The code length of the RNG may be equal to the code length R 'of the generated response sequence, and the data (R' (rng|t)) is actually encrypted once by the RNG for the generated response sequence R ', which is theoretically absolutely indecipherable if the RNG is not taken according to shannon's theorem. Note that at the terminal or server side, the registered CR pair and RNG sequence must be guaranteed not to be stolen by a third party, which is a significant requirement for security.
Further, the post-processing the random number sequence includes: the random number sequence is processed through a shift register.
In order to improve the entropy source characteristics of the data serving as the key, the random number sequence RNG may be post-processed, and then the post-processed random number sequence RNG1 may be used as the key, and for example, the random number sequence RNG may be post-processed by a shift register, or the random number sequence RNG may be randomly extracted, and the RNG1 may be encrypted by R.
One-time pad encryption is performed on a part of the extracted RNG1, i.e., the key, by using the generated response sequence R ', and the data (R' (rng|t)) and the encrypted key data are transmitted as auxiliary data to the server.
The PUF terminal sends the encrypted helper data and ciphertext to the server.
Fig. 2 is a flowchart of a method for transmitting ciphertext according to an embodiment of the present invention, applied to a server, where the method includes:
s201, receiving auxiliary data and ciphertext from a terminal;
s202, recovering the auxiliary data according to a response sequence in the challenge response pair to obtain a secret key;
s203, decrypting the ciphertext according to the key to obtain data acquired by the terminal.
Further, the recovering the auxiliary data according to the response sequence in the challenge response pair to obtain a key includes:
performing modulo-2 addition operation on the response sequence and first data in the auxiliary data to obtain operated data;
decoding the operated data through an error checking and correcting module to obtain a random number sequence with a check code;
performing modulo-2 addition operation on the random number sequence with the check code and the first data to obtain a generated response sequence generated by a terminal according to a challenge sequence in a challenge response pair;
and carrying out modulo-2 addition operation on the generated response sequence and second data in the auxiliary data to obtain a secret key.
When the server receives the auxiliary data and ciphertext from the terminal, the server uses the response sequence R registered in the CR pair of the server to note that for a certain CR pair registered on the server, R' generated when C is input to the PUF chip is not strictly equal to R, and more or less distinction is possible; r and R'. Sub.R (RNG|T) are modulo-2 added at the server side.
Make the following steps
If R 'is very close to R, the difference in the obtained (R-R') is very small, then (RNG|T) can be interpreted by the decoding function of the corresponding ECC in the server. And performing modulo-2 addition on (RNG|T) and (R ' (RNG|T)) to obtain R ', so that a generated response sequence R ' which is identical to a challenge sequence generated by a challenge response through a PUF end is obtained at a server. Although R is somewhat different from the response R ' physically generated at the PUF chip end, the server uses the response sequence R in the CR response pair to solve R ' in the auxiliary data HelpData, and uses R ' to solve the secret key, so as to decrypt the ciphertext to obtain the data collected by the terminal.
There are two points to note here:
(1) the helper data can be transmitted over the public channel, although it is generated by RNG and R ', R' and RNG1, but does not contain any information that can be exploited for third party attacks, as it is equivalent to one-time pad encryption proven by shannon, which is theoretically absolutely indecipherable.
(2) The difference between R' and R cannot be too large, and there are two factor limitations, namely ECC error correction coding and decoding limitations. Second, the code length limitation of R, if the difference is too large, has a more probable chance that one PUF chip collides with the CR characteristics of another PUF, affecting security.
The decoding process at the server side takes advantage of the property of R' ≡r, and thus the security of the system depends on the uniqueness and unpredictability of the PUF.
An embodiment of a method for transmitting ciphertext applied to a terminal as described above is shown in fig. 3, which is a schematic structural diagram of a terminal for transmitting ciphertext according to an embodiment of the present invention, where the terminal includes:
a generated response sequence acquiring unit 11 for generating a generated response sequence corresponding to a challenge response pair by a non-replicable functional chip according to the challenge sequence in the challenge response pair;
a key obtaining unit 12, configured to obtain a random number sequence, perform post-processing on the random number sequence, and use the post-processed random number sequence as a key;
the ciphertext encrypting unit 13 encrypts the data acquired by the terminal according to the secret key to obtain ciphertext;
a key encryption unit 14 that encrypts the key based on the random number sequence and the generated response sequence to obtain auxiliary data;
an information transmitting unit 15 for transmitting the auxiliary data and the ciphertext.
Further, as shown in fig. 4, the key encryption unit 14 includes:
the encoding module 141 is configured to encode the random number sequence by using an error checking and correcting encoding method to obtain a random number sequence with a check code;
the first encryption module 142 performs one-time pad encryption on the generated response sequence by using the random number sequence with the check code to obtain first data.
A second encryption module 143, configured to perform one-time pad encryption on the key by using the generated response sequence, to obtain second data;
the auxiliary data acquisition module 144 acquires the first data and the second data as auxiliary data.
An embodiment of a method for transmitting ciphertext applied to a server side is shown in fig. 5, which is a schematic structural diagram of a server for transmitting ciphertext according to an embodiment of the present invention, where the server includes:
an information receiving unit 21 for receiving the auxiliary data and ciphertext from the terminal;
a key decryption unit 22, for recovering the auxiliary data according to the response sequence in the challenge response pair, and obtaining a key;
and the ciphertext decrypting unit 23 decrypts the ciphertext according to the key to obtain the data collected by the terminal.
Further, as shown in fig. 6, the key decryption unit 22 includes:
a first operation module 221, configured to perform modulo-2 addition on the response sequence and first data in the auxiliary data, to obtain calculated data;
the decoding module 222 decodes the operated data through the error checking and correcting module to obtain a random number sequence with a check code;
the second operation module 223 performs modulo-2 addition operation on the random number sequence with the check code and the first data to obtain a generated response sequence generated by the terminal according to the challenge sequence in the challenge response pair;
the key obtaining module 224 performs modulo-2 addition on the generated response sequence and the second data in the auxiliary data to obtain a key.
It should be understood that the specific order or hierarchy of steps in the processes disclosed are examples of exemplary approaches. Based on design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged without departing from the scope of the present disclosure. The accompanying method claims present elements of the various steps in a sample order, and are not meant to be limited to the specific order or hierarchy presented.
In the foregoing detailed description, various features are grouped together in a single embodiment for the purpose of streamlining the disclosure. This method of disclosure is not to be interpreted as reflecting an intention that the claimed embodiments of the subject matter require more features than are expressly recited in each claim. Rather, as the following claims reflect, invention lies in less than all features of a single disclosed embodiment. Thus the following claims are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate preferred embodiment of this invention.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. As will be apparent to those skilled in the art; various modifications to these embodiments will be readily apparent, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the disclosure. Thus, the present disclosure is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
The foregoing description includes examples of one or more embodiments. It is, of course, not possible to describe every conceivable combination of components or methodologies for purposes of describing the aforementioned embodiments, but one of ordinary skill in the art may recognize that many further combinations and permutations of various embodiments are possible. Accordingly, the embodiments described herein are intended to embrace all such alterations, modifications and variations that fall within the scope of the appended claims. Furthermore, as used in the specification or claims, the term "comprising" is intended to be inclusive in a manner similar to the term "comprising," as interpreted when employed as a transitional word in a claim. Furthermore, any use of the term "or" in the specification of the claims is intended to mean "non-exclusive or".
Those of skill in the art will further appreciate that the various illustrative logical blocks (illustrative logical block), units, and steps described in connection with the embodiments of the invention may be implemented by electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components (illustrative components), elements, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as hardware or software depends upon the particular application and design requirements of the overall system. Those skilled in the art may implement the described functionality in varying ways for each particular application, but such implementation is not to be understood as beyond the scope of the embodiments of the present invention.
The various illustrative logical blocks or units described in the embodiments of the invention may be implemented or performed with a general purpose processor, a digital signal processor, an Application Specific Integrated Circuit (ASIC), a field programmable gate array or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described. A general purpose processor may be a microprocessor, but in the alternative, the general purpose processor may be any conventional processor, controller, microcontroller, or state machine. A processor may also be implemented as a combination of computing devices, e.g., a digital signal processor and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a digital signal processor core, or any other similar configuration.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may be stored in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art. In an example, a storage medium may be coupled to the processor such that the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an ASIC, which may reside in a user terminal. In the alternative, the processor and the storage medium may reside as distinct components in a user terminal.
In one or more exemplary designs, the above-described functions of embodiments of the present invention may be implemented in hardware, software, firmware, or any combination of the three. If implemented in software, the functions may be stored on a computer-readable medium or transmitted as one or more instructions or code on the computer-readable medium. Computer readable media includes both computer storage media and communication media that facilitate transfer of computer programs from one place to another. A storage media may be any available media that can be accessed by a general purpose or special purpose computer. For example, such computer-readable media may include, but is not limited to, RAM, ROM, EEPROM, CD-ROM or other optical disk storage, magnetic disk storage or other magnetic storage devices, or any other medium that may be used to carry or store program code in the form of instructions or data structures and other data structures that may be read by a general or special purpose computer, or a general or special purpose processor. Further, any connection is properly termed a computer-readable medium, e.g., if the software is transmitted from a website, server, or other remote source via a coaxial cable, fiber optic cable, twisted pair, digital Subscriber Line (DSL), or wireless such as infrared, radio, and microwave, and is also included in the definition of computer-readable medium. The disks (disks) and disks (disks) include compact disks, laser disks, optical disks, DVDs, floppy disks, and blu-ray discs where disks usually reproduce data magnetically, while disks usually reproduce data optically with lasers. Combinations of the above may also be included within the computer-readable media.
The foregoing description of the embodiments has been provided for the purpose of illustrating the general principles of the invention, and is not meant to limit the scope of the invention, but to limit the invention to the particular embodiments, and any modifications, equivalents, improvements, etc. that fall within the spirit and principles of the invention are intended to be included within the scope of the invention.
Claims (6)
1. A method for transmitting ciphertext, the method being applied to a terminal, the method comprising:
generating a generated response sequence corresponding to the challenge response pair through the non-replicable functional chip according to the challenge sequence in the challenge response pair;
acquiring a random number sequence, performing post-processing on the random number sequence, and taking the post-processed random number sequence as a secret key;
encrypting the data acquired by the terminal according to the secret key to obtain a ciphertext;
encrypting the secret key according to the random number sequence and the generated response sequence to obtain auxiliary data;
transmitting the auxiliary data and the ciphertext;
the encrypting the key according to the random number sequence and the generated response sequence to obtain auxiliary data comprises the following steps:
encoding the random number sequence by an error checking and correcting encoding method to obtain a random number sequence with a check code;
performing one-time pad encryption on the generated response sequence by using the random number sequence with the check code to obtain first data;
performing one-time pad encryption on the secret key by using the generated response sequence to obtain second data;
auxiliary data comprising the first data and the second data is obtained.
2. The method of transmitting ciphertext as recited in claim 1 wherein said post-processing said sequence of random numbers comprises: the random number sequence is processed through a shift register.
3. A method for transmitting ciphertext, applied to a server, the method comprising:
receiving auxiliary data and ciphertext from a terminal;
recovering the auxiliary data according to a response sequence in the challenge response pair to obtain a secret key;
decrypting the ciphertext according to the key to obtain data acquired by the terminal;
the recovery of the auxiliary data according to the response sequence in the challenge response pair, to obtain a key, includes:
performing modulo-2 addition operation on the response sequence and first data in the auxiliary data to obtain operated data;
decoding the operated data through an error checking and correcting module to obtain a random number sequence with a check code;
performing modulo-2 addition operation on the random number sequence with the check code and the first data to obtain a generated response sequence generated by a terminal according to a challenge sequence in a challenge response pair;
and carrying out modulo-2 addition operation on the generated response sequence and second data in the auxiliary data to obtain a secret key.
4. A terminal for transmitting ciphertext, the terminal comprising:
a generated response sequence acquisition unit for generating a generated response sequence corresponding to a challenge response pair through a non-replicable functional chip according to the challenge sequence in the challenge response pair;
the key acquisition unit is used for acquiring a random number sequence, carrying out post-processing on the random number sequence, and taking the random number sequence after the post-processing as a key;
the ciphertext encrypting unit encrypts the data acquired by the terminal according to the secret key to obtain ciphertext;
a key encryption unit for encrypting the key according to the random number sequence and the generated response sequence to obtain auxiliary data;
an information transmitting unit configured to transmit auxiliary data and the ciphertext;
the key encryption unit includes:
the coding module is used for coding the random number sequence through an error checking and correcting coding method to obtain a random number sequence with a check code;
the first encryption module performs one-time encryption on the generated response sequence by utilizing the random number sequence with the check code to obtain first data;
the second encryption module performs one-time encryption on the secret key by using the generated response sequence to obtain second data;
and the auxiliary data acquisition module acquires the first data and the second data as auxiliary data.
5. A server for transmitting ciphertext, the server comprising:
an information receiving unit for receiving the auxiliary data and the ciphertext from the terminal;
the key decryption unit is used for recovering the auxiliary data according to a response sequence in the challenge response pair to obtain a key;
the ciphertext decrypting unit decrypts the ciphertext according to the key to obtain data acquired by the terminal;
the key decryption unit includes:
the first operation module is used for carrying out modulo-2 addition operation on the response sequence and first data in the auxiliary data to obtain operated data;
the decoding module is used for decoding the operated data through the error checking and correcting module to obtain a random number sequence with a check code;
the second operation module carries out modulo-2 addition operation on the random number sequence with the check code and the first data to obtain a generated response sequence generated by the terminal according to the challenge sequence in the challenge response pair;
and the key acquisition module is used for carrying out modulo-2 addition operation on the generated response sequence and the second data in the auxiliary data to obtain a key.
6. A system for transmitting ciphertext, the system comprising a terminal for transmitting ciphertext according to claim 4 and a server for transmitting ciphertext according to claim 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910231016.6A CN111756540B (en) | 2019-03-26 | 2019-03-26 | Ciphertext transmission method, terminal, server and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910231016.6A CN111756540B (en) | 2019-03-26 | 2019-03-26 | Ciphertext transmission method, terminal, server and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111756540A CN111756540A (en) | 2020-10-09 |
| CN111756540B true CN111756540B (en) | 2023-04-28 |
Family
ID=72671153
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910231016.6A Active CN111756540B (en) | 2019-03-26 | 2019-03-26 | Ciphertext transmission method, terminal, server and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111756540B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112463454B (en) * | 2020-12-04 | 2021-11-05 | 北京深思数盾科技股份有限公司 | Data recovery method, server, terminal device and storage medium |
| CN117896064B (en) * | 2024-03-14 | 2024-05-31 | 中国人民解放***箭军工程大学 | Superlattice twin PUF key synchronization method and system with low calculation overhead |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP5423088B2 (en) * | 2009-03-25 | 2014-02-19 | ソニー株式会社 | Integrated circuit, encryption communication device, encryption communication system, information processing method, and encryption communication method |
| CN107004380B (en) * | 2014-10-13 | 2020-11-13 | 本质Id有限责任公司 | Encryption device comprising a physical unclonable function |
| CA2993097C (en) * | 2015-07-22 | 2021-01-12 | Tendyron Corporation | Data processing method and apparatus, and pos machine transaction system |
| CN106301786B (en) * | 2016-08-10 | 2019-04-02 | 南京航空航天大学 | A kind of physics unclonable function response error correction circuit based on SRAM type memory |
| CN106788991A (en) * | 2016-12-05 | 2017-05-31 | 北京中交兴路信息科技有限公司 | A kind of method and device of data transfer |
| CN106789008B (en) * | 2016-12-16 | 2020-02-28 | 北京瑞卓喜投科技发展有限公司 | Method, device and system for decrypting sharable encrypted data |
-
2019
- 2019-03-26 CN CN201910231016.6A patent/CN111756540B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111756540A (en) | 2020-10-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR101267109B1 (en) | Cryptographic primitives, error coding, and pseudo-random number improvement methods using quasigroups | |
| US10650373B2 (en) | Method and apparatus for validating a transaction between a plurality of machines | |
| EP2789116B1 (en) | Soft decision error correction for memory based puf using a single enrollment | |
| KR101678568B1 (en) | System for establishing a cryptographic key depending on a physical system | |
| EP1149475B1 (en) | A fuzzy commitment scheme | |
| KR100887003B1 (en) | Apparatus and method for protecting the integrity of data | |
| KR20170100602A (en) | Cryptographic key production from a physical unclonable function | |
| US9496897B1 (en) | Methods and apparatus for generating authenticated error correcting codes | |
| JP6588048B2 (en) | Information processing device | |
| KR20150064148A (en) | System for generating a cryptographic key from a memory used as a physically unclonable function | |
| CN110869997B (en) | Electronic encryption device, electronic registration and reconstruction method, and computer-readable medium | |
| US11245680B2 (en) | Garbled circuit for device authentication | |
| JP2007510349A (en) | Reliable forward secret key system and method sharing a physical random function | |
| Gunlu | Key agreement with physical unclonable functions and biometric identifiers | |
| CN111756540B (en) | Ciphertext transmission method, terminal, server and system | |
| CN109995507A (en) | A kind of key generation method and device based on PUF, private key storage method | |
| Hiller et al. | Systematic low leakage coding for physical unclonable functions | |
| Hooshmand et al. | PKC‐PC: a variant of the McEliece public‐key cryptosystem based on polar codes | |
| US20120017086A1 (en) | Information security transmission system | |
| CN111756541A (en) | Method, server, terminal and system for transmitting secret key | |
| US20220358203A1 (en) | Puf-rake: a puf-based robust and lightweight authentication and key establishment protocol | |
| Adamo et al. | Joint scheme for physical layer error correction and security | |
| KR20180006251A (en) | Method and device for enrolling and authenticating biometric code | |
| Mihaljević et al. | Security evaluation and design elements for a class of randomised encryptions | |
| CN105049176B (en) | Decryption method for view data safe transmission |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20230605 Address after: Room 522, Floor 5, Building 101, No. 7, Yard 11, Xingke East Street, Yanqi Economic Development Zone, Huairou District, Beijing 101400 Patentee after: Beijing puanxin Technology Co.,Ltd. Patentee after: Suzhou Industrial Park Xinchuang Electronic Technology Co.,Ltd. Address before: 100102 floor 7, building 1, No. 50, wangjingsili, Chaoyang District, Beijing (No. 1725, xinqihang incubator) Patentee before: Beijing puanxin Technology Co.,Ltd. |
|
| TR01 | Transfer of patent right |