Bit-Length Parameterizable Cipher for Ultra-Low Latency Encryption

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Current block ciphers are not bit-length parameterizable and do not support ultra-low latency encryption/decryption operations, limiting their effectiveness in cryptographic computing applications where arbitrary bit lengths and fast encryption are required.

Innovation Solution

A bit-length parameterizable cipher is developed, utilizing a novel confusion-diffusion network with a small number of rounds that combines strong bit mixing primitives, including integer arithmetic and bit-level reordering, to achieve encryption and decryption of arbitrary ciphertext lengths, supported by Galois field inverters and tweakable round keys.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Adaptability or versatility

If current block ciphers are used, then encryption security is maintained, but bit-length parameterizability and ultra-low latency encryption are not supported

Engineering Contradiction:
Improvebit-length parameterizabilityVSAvoidencryption latency
Core Design Contradiction:
Adaptability or versatilityVSLoss of time

Solution Approach 1:

The cipher structure is made dynamic and configurable to adapt to different bit lengths. The network includes configurable substitution boxes, permutation layers, and round functions that can be dynamically adjusted based on the input bit length parameter, enabling the same hardware or software implementation to efficiently encrypt data of varying lengths without fixed block size limitations.

Inventive Principle:
Principle #15Dynamics

Solution Approach 2:

The invention changes the parameter of bit length from fixed to variable. By introducing a bit length parameter that can be configured, the cipher achieves parameterizability. The internal state, round keys, and transformation operations are all adjusted based on this parameter, allowing the system to optimize performance for different data sizes and achieve ultra-low latency encryption.

Inventive Principle:
Principle #35Parameter changes

2Productivity

If a small number of rounds with strong bit mixing primitives is used, then encryption speed is improved, but cryptographic strength may be reduced

Engineering Contradiction:
Improveencryption speedVSAvoidcryptographic strength
Core Design Contradiction:
ProductivityVSReliability

Solution Approach 1:

The encryption process is segmented into distinct functional layers: substitution layer with configurable substitution boxes, permutation layer with bit-level reordering, and round key generation layer. Each layer performs a specific cryptographic function strongly, and their combination achieves both security and speed. The segmentation allows parallel execution of independent operations within each layer, improving encryption speed while maintaining cryptographic strength.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The cipher combines multiple strong bit mixing primitives into a composite transformation function. This includes mixing substitution operations, permutation operations, and arithmetic operations in a composite round function. The composite structure leverages the strengths of each primitive type to achieve both high security and high performance with fewer rounds.

Inventive Principle:
Principle #40Composite materials

Data Source

PatentEP3839788B1Bit-length parameterizable cipher
Publication Date: 2024.02.21 INTEL CORP
  • EP3839788B1 patent drawingFigure 1
  • EP3839788B1 patent drawingFigure 2
  • EP3839788B1 patent drawingFigure 3A

AI summary

In one embodiment, a method for implementing a bit-length parameterizable cipher includes obtaining a bit-length parameter indicating a number of plaintext bits to encrypt. The method also includes obtaining a set of plaintext bits and a set of key bits, wherein lengths of the set of key bits and the set of plaintext bits are equal to the bit-length parameter. The method further includes performing a sequence of logical operations on the set of plaintext bits and on the set of key bits to yield a ciphertext. The sequence of logical operations includes a plurality of AND operations and a plurality of XOR operations, with each of the operations being performed on at least one plaintext bit and at least one key bit.