| Sonstiges: |
- Nachgewiesen in: USPTO Patent Grants
- Sprachen: English
- Patent Number: 11991,275
- Publication Date: May 21, 2024
- Appl. No: 17/930681
- Application Filed: September 08, 2022
- Assignees: BTQ AG (Vaduz, LI)
- Claim: 1. A method of generating a private cryptographic key for use in a secure cryptogram for transmission between a first entity and a second entity, the method comprising: generating an n-dimensional vector space shared between the first entity and the second entity prior to selecting a random vector in the n-dimensional vector space, comprising the steps of: generating a random binary string; dividing the random binary string into a plurality of discrete sub-sections, each sub-section comprising a plurality of bits; associating an index to each sub-section; projecting the binary string into the n-dimensional vector space using a projection function, the projection function mapping the indices associated with at least some of the subsections, to different coordinate values in the n-dimensional vector space; selecting the random vector defined in the n-dimensional vector space shared between the first entity and the second entity, comprising generating a random sequence of indices and selecting the random vector by identifying the coordinate value associated with each index in the sequence of randomly generated indices, each coordinate value being associated with a plurality of bits; determining the plurality of bits associated with each coordinate value comprised in the random vector, by identifying the index associated with each coordinate value, and determining the plurality of bits associated with each coordinate value in dependence on the identified index; and generating the private key in dependence on the plurality of bits associated with each coordinate value comprised in the random vector.
- Claim: 2. The method of claim 1 , comprising: transmitting information associated with the random vector to the second entity, the information associated with the random vector enabling the second entity to recover the private key from the shared n-dimensional vector space.
- Claim: 3. The method of claim 2 , wherein the information associated with the random vector comprises information indicative of the one or more coordinate values associated with the random vector.
- Claim: 4. The method of claim 2 , comprising: generating the cryptogram in dependence on the private key; and transmitting the cryptogram to the second entity, the cryptogram comprising confidential information recoverable by the second entity in dependence on the recovered private key.
- Claim: 5. The method of claim 4 , comprising: compressing the confidential information with a lossless compression algorithm; combining the compressed confidential information with random data; generating the cryptogram by encrypting the compressed confidential information combined with the random data; wherein the cryptogram comprises information enabling the confidential information to be distinguished from the random data; and optionally compressing the random data with a lossy compression algorithm; and generating the cryptogram by encrypting the compressed confidential information combined with the compressed random data.
- Claim: 6. The method of claim 4 , comprising the steps of: generating a first nonce; encrypting the first nonce using the generated private key; forwarding the encrypted first nonce from the first entity to the second entity; receiving a response message from the second entity comprising a second nonce; determining if the first nonce and the second nonce are correlated; authenticating the second entity in dependence on the first nonce and the second nonce being correlated; and optionally comprising the steps of: generating a third nonce; encrypting the third nonce using the generated private key; forwarding the encrypted third nonce from the second entity to the first entity; receiving a response message from the first entity comprising a fourth nonce; determining if the third nonce and the fourth nonce are correlated; and authenticating the first entity in dependence on the third nonce and the fourth nonce being correlated.
- Claim: 7. The method of claim 1 , comprising: generating the random vector using a mathematical function, the mathematical function comprising a pseudo-random number generator configured to generate random coordinate values defining the random vector; and optionally generating the random vector using a mathematical function comprising a pseudo-random number generator seeded with a value from a source of random numbers.
- Claim: 8. The method of claim 1 , comprising: generating the random vector using a quantum key distribution protocol executed between the first and second entities, the quantum key distribution protocol being configured to generate the random sequence of indices, and associating the random sequence of indices with coordinate values defining the random vector.
- Claim: 9. The method of claim 1 , wherein the binary string comprises a linear array of bits, and the projection function is configured to map the linear array of bits to an n-dimensional array of bits comprised in the n-dimensional vector space.
- Claim: 10. The method of claim 1 , wherein the n-dimensional vector space comprises any one of: i. one or more fractal dimensions; and ii. one or more nested complex dimensions.
- Claim: 11. The method of claim 1 , wherein the projection function is a state-dependent one-way function.
- Claim: 12. The method of claim 1 , wherein the step of generating the random binary string comprises: the first entity generating a first random binary string; the second entity generating a second random binary string; and combining portions of the first and second binary strings to generate the binary string.
- Claim: 13. The method of claim 12 , wherein the portions of the first and second binary strings are randomly combined.
- Claim: 14. The method of claim 12 , wherein the portions of the first and second binary strings are combined in accordance with one or more of: i. a mixing function; ii. a merging function; iii. a substitute function; iv. an exchange function; v. a shuffle function; and vi. a riffle shuffle function.
- Claim: 15. The method of claim 12 , comprising combining portions of the first and second binary strings using an exclusive OR operator “XOR”.
- Claim: 16. The method of claim 1 , comprising: generating the shared n-dimensional vector space in a secure environment.
- Claim: 17. The method of claim 1 , comprising: generating the random sequence of indices using a random number generator.
- Claim: 18. The method of claim 1 comprising: partitioning the random binary string into two or more separate partitions; and projecting at least a portion of the separate partitions into the n-dimensional vector space using the projection function.
- Claim: 19. The method of claim 18 , comprising: partitioning the random binary string into a plurality of partitions of equal length; or partitioning the random binary string into a random number of partitions, each partition having a random length.
- Claim: 20. The method of claim 1 , comprising: generating the private key by combining the plurality of bits associated with each component coordinate comprised in the random vector; and optionally generating the private key by combining the plurality of bits associated with adjacent component coordinates comprised in the random vector.
- Claim: 21. The method of claim 20 , wherein the plurality of bits associated with each component coordinate comprised in the random vector are combined in accordance with a logical operator; and optionally wherein the logical operator is an exclusive OR operator “XOR”.
- Claim: 22. The method of claim 1 , wherein the private key is a one-time key, and the method comprises: generating a new private key for each new cryptogram required for transmission between the first entity and the second entity.
- Claim: 23. A system for generating a private cryptographic key for use in a secure cryptogram for transmission between a first device and a second device, the system comprising a processor and a random number generator, the random number generator configured to generate a random binary string and a random sequence of indices, and wherein the processor is configured to: generate an n-dimensional vector space shared between the first device and the second device, comprising the steps of: dividing the random binary string generated by the random number generator into a plurality of discrete sub-sections, each sub-section comprising a plurality of bits; associating an index to each sub-section; projecting the binary string into the n-dimensional vector space using a projection function, the projection function mapping the indices associated with at least some of the subsections, to different coordinate values in the n-dimensional vector space; selecting a random vector defined in the n-dimensional vector space shared between the first device and the second device, by identifying the coordinate value associated with each index comprised in the random sequence of indices generated by the random number generator, each coordinate value being associated with a plurality of bits; determining the plurality of bits associated with each coordinate value comprised in the random vector, by identifying the index with each coordinate value, and determining the plurality of bits associated with each coordinate value in dependence on the identified index; and generating the private key in dependence on the plurality of bits associated with each coordinate value comprised in the random vector.
- Patent References Cited: 20220385484 December 2022 Behnia
- Primary Examiner: Farooqui, Quazi
- Attorney, Agent or Firm: FINNEGAN, HENDERSON, FARABOW, GARRETT & DUNNER LLP
|
