Streaming authentication and multi-level security for communications networks using quantum cryptography

US11743049B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11743049-B2
Application numberUS-202016799116-A
CountryUS
Kind codeB2
Filing dateFeb 24, 2020
Priority dateSep 30, 2013
Publication dateAug 29, 2023
Grant dateAug 29, 2023

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentication tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message transmitter outputs the message and its authentication tag. A message receiver receives a message and authentication tag for the message. The message receiver derives a comparison tag for the message based at least in part on an authenticator that uses one or more quantum keys. The message receiver checks whether the message is authentic based on a comparison of the authentication tag and the comparison tag. In example implementations, the authenticator uses stream-wise cyclic redundancy code operations.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer-implemented method of quantum-secured communications comprising: receiving a concatenation of a message and an authentication tag for the message, wherein the authentication tag is formed based on the message; using at least one or more quantum keys in stream-wise operations to derive a comparison tag for the message, the stream-wise operations avoiding buffering, wherein derivation of the comparison tag is based on the least one or more quantum keys and occurs within an authenticator; and checking whether the message is authentic based on a comparison of the authentication tag and the comparison tag. 2. The method of claim 1 wherein the authenticator uses cyclic redundancy code operations. 3. The method of claim 1 wherein the authenticator is a function ƒ(α) that uses a binary polynomial α(x) based on the message, an irreducible binary polynomial p of degree b, and a b-bit quantum key k of the one or more quantum keys. 4. The method of claim 3 wherein bits of the message are coefficients of the binary polynomial α(x) based on the message. 5. The method of claim 3 wherein the authenticator is based on: ƒ(α)={[α(x)·x b ]mod p}⊕k, where x b represents a b-bit shift, and ⊕ represents an XOR operation. 6. The method of claim 3 wherein the irreducible binary polynomial p is determined by: receiving a primitive polynomial q of degree b; determining a random polynomial π using the primitive polynomial q, a primitive element, and another quantum key r of the one or more quantum keys; constructing a b-bit tuple based on the random polynomial π; using the b-bit tuple to confirm that the quantum key r will yield a b-degree polynomial that cannot be reduced; determining a minimum polynomial m of the random polynomial π; and determining the irreducible polynomial based upon the minimum polynomial m and the primitive polynomial q. 7. The method of claim 3 wherein the irreducible binary polynomial p is reused in the authenticator for different messages but different values of quantum key k are used in the authenticator for the different messages. 8. The method of claim 1 wherein the computing device is part of one of: a phasor measurement unit or phasor data concentrator in an electric grid; a node in a high-speed trading system; a control station in a water management system; and a control station in an oil or gas distribution system. 9. The method of claim 1 wherein distribution of the at least one or more quantum keys occurs after the message is received. 10. The method of claim 1 wherein the message is received as part of a data stream on a single fiber connection, and wherein the method further comprises repeating the receiving, the deriving and the checking for each of one or more other messages that are received as part of other data streams multiplexed to support multi-level security on the single fiber connection. 11. The method of claim 1 wherein the authenticator uses hashing operations with Toeplitz matrices. 12. A computer-implemented method of quantum-secured communications comprising: receiving a concatenation of a message and an authentication tag for the message, wherein the authentication tag is formed based on the message, wherein the authentication tag in derived based at least in part on at least a portion of the message and at least a first quantum key, the first quantum key comprising a random series of bits generated based at least in part on measured quantum states of photons; using at least one or more quantum keys in stream-wise operations to derive a comparison tag for the message, the stream-wise operations avoiding buffering, wherein derivation of the comparison tag based on the least one or more quantum keys occur within an authenticator; and checking whether the message is authentic based on a comparison of the authentication tag and the comparison tag. 13. A computer-implemented method of quantum-secured communications comprising: receiving a concatenation of a message and an authentication tag for the message, wherein the authentication tag is formed based on the message; using at least one or more quantum keys in stream-wise operations without holding back of the message to derive a comparison tag for the message, wherein derivation of the comparison tag based on the least one or more quantum keys occur within an authenticator; and checking whether the message is authentic based on a comparison of the authentication tag and the comparison tag.

Assignees

Inventors

Classifications

  • Information technology specific aspects, e.g. CAD, simulation, modelling, system security · CPC title

  • H04L9/3226Primary

    using a predetermined code, e.g. password, passphrase or PIN (network architectures or network communication protocols for supporting authentication of entities using passwords in a packet data network H04L63/083) · CPC title

  • Quantum cryptography (transmission systems employing electromagnetic waves other than radio waves, e.g. light, infrared H04B10/00; wavelength-division multiplex systems H04J14/02; WDM arrangements H04J14/03) · CPC title

  • for authentication of entities (cryptographic mechanisms or cryptographic arrangements for entity authentication H04L9/32) · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11743049B2 cover?
Message authenticators for quantum-secured communications facilitate low-latency authentication with assurances of security. Low-latency message authenticators are especially valuable in infrastructure systems where security and latency constraints are difficult to satisfy with conventional non-quantum cryptography. For example, a message transmitter receives a message and derives an authentica…
Who is the assignee on this patent?
Triad Nat Security Llc
What technology area does this patent fall under?
Primary CPC classification H04L9/3226. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Aug 29 2023 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).