Sponge Construction Encryption Algorithm with Layered Permutation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current cryptographic systems lack a highly customizable and secure encryption algorithm capable of supporting high-rate networked waveforms and longer key lengths, which are essential for advanced security and throughput requirements.
Innovation Solution
A novel cryptographic algorithm based on sponge and duplex constructions, utilizing a unique permutation function that includes a substitution layer, permutation layer, mixing layer, and addition layer, with customizable parameters to ensure security and adaptability, is implemented to generate keystreams for encrypting data and producing authentication tags.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional cryptographic algorithms are used, then implementation is simple, but they lack customization and cannot support longer key lengths and high-rate networked waveforms
Solution Approach 1:
The cryptographic algorithm is segmented into distinct functional layers: substitution layer, permutation layer, mixing layer, and addition layer. Each layer performs a specific cryptographic function and can be independently configured. This segmentation enables customization of each layer's parameters while maintaining overall algorithm structure, resolving the contradiction between adaptability and complexity.
Solution Approach 2:
The algorithm employs dynamic parameters including variable key lengths, configurable number of rounds, and adjustable state sizes. The permutation function can be iterated a customizable number of times, and the algorithm supports different operating modes (authenticated and non-authenticated). This dynamic configurability provides high adaptability without requiring complete algorithm redesign, balancing customization capability with structural manageability.
2Reliability
If standard encryption algorithms are used, then throughput is limited, but increasing key length and security strength is required for military-grade threats
Solution Approach 1:
The algorithm allows parameter optimization to balance security and throughput. The state size can be configured as 64, 128, 256, or 512 bits, the number of rounds can be adjusted, and key lengths can be extended. By changing these parameters, users can achieve military-grade security (higher state sizes and more rounds) or optimized throughput (smaller state sizes and fewer rounds), resolving the contradiction between security strength and throughput.
Solution Approach 2:
The cryptographic algorithm serves multiple functions within a unified structure: it provides encryption, authentication (when configured for authenticated mode), key derivation, and message digest generation. The same permutation function and state structure support both authenticated and non-authenticated modes, allowing the system to achieve high security across multiple functions without requiring separate algorithms for each purpose, thereby maintaining throughput efficiency.
3Reliability
If fixed permutation functions are used, then implementation is straightforward, but they cannot provide enhanced security against various attacks
Solution Approach 1:
The permutation function is constructed as a composite of multiple cryptographic operations arranged in layers: substitution (non-linear transformation), permutation (position rearrangement), mixing (diffusion), and addition (constant incorporation). Each layer addresses specific cryptographic requirements: substitution provides non-linearity, permutation provides diffusion, mixing enhances confusion, and addition adds constant-dependent variation. This composite structure provides enhanced security against linear and differential attacks while maintaining a systematic implementation approach that manages complexity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Systems (100) and methods (600) for generating encrypted data. The methods involve: combining a cryptographic key with state initialization bits to generate first combination bits; producing a first keystream by performing a permutation function f using the first combination bits as inputs thereto; and using the first keystream to encrypt first data (e.g., authentication data or message body data) so as to produce first encrypted data. The permutation function f comprises a round function fround that is iterated R times. The round function fround consists of (1) a substitution layer in which the first combination bits are substituted with substitute bits, (2) a permutation layer in which the substitute bits are re-arranged, (3) a mixing layer in which multiple of the permutation layer are combined together, and (4) an addition layer in which a constant is added to the output of the mixing layer.