Message Authenticator Generating Apparatus with Parallel Block Cipher Processing
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The existing block-cipher based message authentication algorithms provide higher security but at the cost of increased key size and efficiency degradation, which is not desirable.
Innovation Solution
A message authenticator generating apparatus that includes a randomizing unit, a compressing unit, and an authenticator generating unit, utilizing a block cipher to maintain randomness and generate an authenticator efficiently with a single k-bit key, allowing for parallel processing and maintaining high security.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If multiple block cipher keys are employed to improve security, then distinction probability decreases, but key size increases
Solution Approach 1:
The message is divided into multiple n-bit message blocks, and the block cipher is applied to each block separately. This segmentation allows the system to achieve higher security through multiple processing stages while reusing the same key K, avoiding the need to store multiple large keys.
Solution Approach 2:
The block cipher is called multiple times in a periodic manner for each message block (x times), where x represents the number of calls. This periodic application of the same key through multiple transformations achieves security equivalent to using multiple keys while maintaining a single key storage.
2Reliability
If multiple block cipher calls are made to improve security, then distinction probability decreases, but processing time increases
Solution Approach 1:
The message authentication process is segmented into independent block cipher calls for each message block. This segmentation enables parallel processing of multiple blocks simultaneously, reducing overall processing time while maintaining the required number of cipher calls for security.
Solution Approach 2:
The system performs preliminary processing by dividing the message into blocks and preparing the structure for parallel block cipher operations. This preliminary organization allows efficient concurrent execution, minimizing total processing time despite multiple cipher calls.
3Reliability
If block cipher calls are increased to improve security, then distinction probability decreases, but computational efficiency decreases
Solution Approach 1:
By segmenting the message into n-bit blocks and processing each block independently through the block cipher, the system achieves linear scalability. Each block can be processed in parallel, maintaining computational efficiency while requiring multiple cipher calls per block for security.
Solution Approach 2:
The same block cipher function E(K, ·) is used universally for all message blocks and for generating subkeys, rather than employing different functions or larger key sizes. This universal application maintains computational efficiency while achieving the required security level through multiple calls.
Data Source
AI summary
A message authenticator generating apparatus (10), for each integer i, taking as input a key K and a value m′[i] which is generated from a message M, calculates a value c[i] by a block cipher E. The message authenticator generating apparatus (10), taking as input the value c[i] for each integer i, calculates a value w[1], a value w[2], and a value w[3] each maintaining the randomness of the value c[i]. The message authenticator generating apparatus (10), taking as input the value w[2] and the key K, calculates a value K′ by a function e which is a substitution function if the key K is fixed, taking as input the value w[1] and the value K′, calculates a value c by a block cipher E, and taking as input the value w[3] and the value c, calculates an authenticator T by a function d which is a substitution function if the value w[3] is fixed.


