# US 2021/0243172 A1 · Methods to strengthen cyber-security and privacy in a deterministic internet of things

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2021/0243172 A1
- Document ID: US20210243172A1
- Status: Published application
- Kind: A1
- Application number: 17/234,627
- Filed: 2021-04-19
- Published: 2021-08-05
- Earliest claimed: 2016-02-03
- Inventors: Ted H. Szymanski
- Web page: https://patentgrep.com/patent/US20210243172A1

## CPC

- H04L 63/0428: {wherein the data content is protected, e.g. by encrypting or encapsulating the payload}
- H04L 9/0894: {Escrow, recovery or storing of secret information, e.g. secret key escrow or cryptographic key storage}
- H04L 9/14: using a plurality of keys or algorithms
- H04L 47/2483: involving identification of individual flows
- H04L 47/528: {Minimum bandwidth guarantee}
- H04L 47/621: {Individual queue per connection or flow, e.g. per VC}
- H04L 49/101: using crossbar or matrix
- H04L 49/254: {Centralised controller, i.e. arbitration or scheduling}
- H04L 49/30: {Peripheral units, e.g. input or output ports}
- H04L 63/1458: {Denial of Service}
- H04L 67/12: specially adapted for proprietary or special-purpose networking environments, e.g. medical networks, sensor networks, networks in vehicles or remote metering networks
- H04L 45/64: using an overlay routing layer
- H04L 49/3027: {Output queuing}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Methods to strengthen the cyber-security and privacy in a proposed deterministic Internet of Things (IoT) network are described. The proposed deterministic IoT consists of a network of simple deterministic packet switches under the control of a low-complexity ‘Software Defined Networking’ (SDN) control-plane. The network can transport ‘Deterministic Traffic Flows’ (DTFs), where each DTF has a source node, a destination node, a fixed path through the network, and a deterministic or guaranteed rate of transmission. The SDN control-plane can configure millions of distinct interference-free ‘Deterministic Virtual Networks’ (DVNs) into the IoT, where each DVN is a collection of interference-free DTFs. The SDN control-plane can configure each deterministic packet switch to store several deterministic periodic schedules, defined for a scheduling-frame which comprises F time-slots. The schedules of a network determine which DTFs are authorized to transmit data over each fiber-optic link of the network. These schedules also ensure that each DTF will receive a deterministic rate of transmission through every switch it traverses, with full immunity to congestion, interference and Denial-of-Service (DoS) attacks. Any unauthorized transmissions by a cyber-attacker can also be detected quickly, since the schedules also identify unauthorized transmissions. Each source node and destination node of a DTF, and optionally each switch in the network, can have a low-complexity private-key encryption/decryption unit. The SDN control-plane can configure the source and destination nodes of a DTF, and optionally the switches in the network, to encrypt and decrypt the packets of a DTF using these low-complexity encryption/decryption units. To strengthen security and privacy and to lower the energy use, the private keys can be very large, for example several thousands of bits. The SDN control-plane can configure each DTF to achieve a desired level of security well beyond what is possible with existing schemes such as AES, by using very long keys. The encryption/decryption units also use a new serial permutation unit the very low hardware cost, which allows for exceptional security and very-high throughputs in FPGA hardware.

## Claims

### Claim at position 1

1-28. (canceled)

### Claim 29

A ‘Deterministic Traffic Source’ (DTS) module for transmitting encrypted data associated with one or more ‘Deterministic Traffic Flows’ (DTFs) over an output link to a network of deterministic packet switches, given a scheduling-frame comprising F time-slots for positive integer F, wherein each DTF is associated with a deterministic (or guaranteed) data-rate, comprising:
a ‘computer system bus interface’ unit, operable to receive commands and data to transmit from an external computer system;
a memory, which is partitioned into a plurality of ‘Transmit-Queues’ (TX-Queues), wherein each TX-queue buffers data associated with one DTF to be transmitted;
a multiplexer, to select data to transmit from one of said plurality of TX-queues;
an ‘encryption unit’ operable to encrypt data that is to be transmitted;
a controller, wherein said controller is operable to receive data from, and send data to, an external control-plane;
wherein said controller is operable to receive a ‘Deterministic Transmission Schedule’ (DTX-schedule) from said control-plane, wherein said DTX-schedule specifies which TX-Queues, if any, have a reservation to transmit data over said output link in each time-slot of said scheduling-frame;
wherein said controller is operable to receive an ‘encryption key’ from said control-plane for each DTF to be transmitted, wherein said controller provides said encryption keys to said encryption-unit, to encrypt the packets associated with each DTF to provide an appropriate level of security;
and wherein said DTX-Schedule provides each DTF with a deterministic number of time-slot reservations for transmitting encrypted data in said scheduling-frame, to meet the deterministic (or guaranteed) data-rate associated with said DTF.

### Claim 30 (depends on 29)

The ‘Deterministic Traffic Source’ (DTS) module of claim 29,
wherein for each DTF to be transmitted with a deterministic data-rate equivalent to R time-slot reservations per scheduling-frame, said ‘Deterministic Transmission Schedule’ provides said DTF with substantially R/2 time-slot reservations in each half of said ‘Deterministic Transmission Schedule’ with a duration of substantially F/2 time-slots.

### Claim 31 (depends on 30)

The ‘Deterministic Traffic Source’ (DTS) module of claim 30,
wherein said ‘Deterministic Transmission Schedule’ provides said DTF with substantially R/4 time-slot reservations in each quarter of said ‘Deterministic Transmission Schedule’ with a duration of substantially F/4 time-slots.

### Claim 32 (depends on 30)

The ‘Deterministic Traffic Source’ (DTS) module of claim 30,
wherein when said ‘Deterministic Transmission Schedule’ is partitioned into K substantially-equal size partitions with substantially F/K time-slots per partition, then each of said partitions provides said DTF with substantially R/K time-slots.

### Claim 33 (depends on 29)

The ‘Deterministic Traffic Source’ (DTS) module of claim 29, further comprising:
an ‘electrical-to-optical’ (EO) converter, to convert electrical signals into optical signals for transmission onto a fiber-optic output link.

### Claim 34 (depends on 29)

The ‘Deterministic Traffic Source’ (DTS) module of claim 29,
wherein said controller is operable to receive a ‘DTF-Authorization Key’ for selected DTFs to be transmitted, wherein said DTF-Authorization key is a secrete key used to establish the authenticity of each packet to be transmitted for said DTF.

### Claim 35 (depends on 34)

The ‘Deterministic Traffic Source’ (DTS) module of claim 34,
wherein said encryption unit comprises:
a buffer memory, to store data to be encrypted;
an XOR-unit, to perform a logical exclusive-OR operation on data in said buffer memory;
wherein said encryption key comprises an XOR-key, and wherein said XOR-unit will perform a logical exclusive-OR operation on data in said buffer memory, and with the XOR-key.
