IP Library Granted Patent US 12,739,097
Granted Patent B2
US 12,739,097 · App. 19/137,739 · Granted Sep 15, 2026

Method for encrypting plain text

Inventor: Viktor Friesen (Karlsruhe, DE)
Assignee: MERCEDES-BENZ GROUP AG
H04L9/0637
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 12,739,097
App. No.
19/137,739
Granted
Sep 15, 2026
Kind
B2
Abstract

Plain text that is part of the plain text message is encrypted using a reversible decomposition function, which allocates two plain text parts to each plain text to be encrypted. These plain text parts are then encrypted with at least one encryption function in two separate steps. Since the decomposition function is reversible, the inverse function can always be used to unambiguously derive the original plain text from the plain text parts. This is now used to decrypt the cipher text message created by the encryption with the cipher text parts using a suitable decryption. The cipher text parts are decrypted one after the other using at least one decryption function to then recover the plain text. A conventional initialization vector for encryption and decryption is then replaced by selected or all bits of the second plain text part or a bit sequence derived from this.

Claims (36)

1 . A method for encrypting a plain text to be encrypted contained in a plain text message, wherein the plain text message consists of the plain text to be encrypted and an associated data block not to be encrypted, and an associated method for decrypting first and second cipher text parts contained in a cipher text message, the method comprising:

providing a reversible decomposition function that allocates a decomposition of the reversible decomposition function to the plain text to be encrypted in first and second plain text parts, wherein the cipher text message consists of the first and second cipher text parts and the non-encrypted associated data block, wherein the decrypting of each of the first and second cipher text parts involves an implicit novelty bit sequence serving as an additional source of novelty;

providing at least one encryption function implicitly equipped with first fixed key material, wherein the at least one encryption function encrypts the plain text to be encrypted with the at least one encryption function by including a variable input bit sequence;

providing at least one decryption function, belonging to the at least one encryption function, implicitly equipped with second fixed key material, which decrypts a cipher text generated with the encryption function by including the variable input bit sequence;

encrypting the plain text to be encrypted contained in the plain text message by including the implicit novelty bit sequence and suppling the first and second cipher text parts;

obtaining the first cipher text part using the second plain text part, the associated data block, and the implicit novelty bit sequence, concatenated in any sequence, as a first parameter of the at least one encryption function and the first plain text part as a first second parameter of the at least one encryption function;

obtaining the second cipher text part using the first cipher text part as a second first parameter of the at least one encryption function and the second plain text part as a second parameter of the at least one encryption function;

receiving, by the at least one decryption function, the cipher text message with the implicit novelty bit sequence and the non-encrypted associated data block; and

performing the decrypting belonging to the encrypting of the first and second cipher text parts contained in the cipher text message the implicit novelty bit sequence and returning the plain text,

wherein the first and second plain text parts are obtained by the decrypting of the first cipher text part, the second cipher text part, the associated data block and the implicit novelty bit sequence,

wherein the second plain text part is obtained using the first and second cipher text parts as a first parameter and as a first second parameter of the at least one decryption function, and

wherein the first plain text part is decrypted separately from the second plain text part using the second plain text part, the non-encrypted associated data block, and the implicit novelty bit sequence, concatenated in the sequence used in the encrypting, as a second first parameter of the at least one decryption function, and the first cipher text part, as a second parameter of the at least one decryption function, according to which the plain text is obtained from the first and second plain text parts by an inversion of the reversible decomposition function.

2 . The method of claim 1 , wherein

the at least one encryption function includes two encryption functions, which are first and second encryption functions,

the at least one decryption function includes two decryption functions, which are first and second decryption functions,

the first and the second encryption functions are each implicitly provided with the first fixed key material, which encrypts the plain text to be encrypted with a respective one of the first and second encryption functions by including the variable input bit sequence,

the first and the second decryption function belonging to the respective first and second encryption function are implicitly equipped with the second fixed key material, which decrypt the cipher text generated with the respective encryption function by including the variable input bit sequence,

the encrypting of the plain text to be encrypted contained in the plain text message is performed by including the implicit novelty bit sequence and providing two cipher text parts,

the first cipher text part is obtained using the second plain text part, the associated data block, and the implicit novelty bit sequence, concatenated in any order, as the first parameter of the first encryption function and the first plain text part as the first second parameter of the first encryption function,

the second cipher text part is using the first cipher text part as the second first parameter of the second encryption function and the second plain text part, as the second parameter of the second encryption function,

the decrypting the cipher text parts contained in the cipher text message is performed using the implicit novelty bit sequence and returns the plain text,

the plain text parts are obtained by the first and second decryption functions from the first cipher text part, the second cipher text part, the associated data block, and the implicit novelty bit sequence,

the second plain text part is obtained using the first cipher text part as a first parameter of the second decryption function and the second cipher text part as a first second parameter of the second decryption function,

the first plain text part is obtained using the second plain text part, the associated data block, and the implicit novelty bit sequence concatenated in the sequence used in the encrypting, as a second first parameter of the first decryption function, and the first cipher text part as a second second parameter of the first decryption function.

3 . The method of claim 1 , wherein the associated data block or the implicit novelty bit sequence is specified as empty.

4 . The method of claim 1 , wherein the reversible decomposition function is a non-conventional decomposition function.

5 . The method of claim 1 , wherein the at least one encryption function is a novelty-preserving encryption function.

6 . The method of claim 1 , wherein the reversible decomposition function is defined once and implemented in the encrypting and the decrypting.

7 . The method of claim 1 , wherein the reversible decomposition function for one or more consecutive entities of two communication partners with encryption and decryption is agreed between the communication partners.

8 . The method of claim 1 , wherein the reversible decomposition function is set as a set of decomposition functions and is implemented in the encrypting and the decrypting.

9 . The method of claim 8 , wherein individual decomposition functions in the set of decomposition functions are numbered consecutively for identification.

10 . The method of claim 9 , wherein a number of the at least one decryption function used for encryption and required for decryption is integrated into the plain text to be encrypted.

11 . The method of claim 10 , wherein the number is arranged at a previously set position within the plain text or within one or both of the first and second plain text parts.

12 . The method of claim 10 , wherein the plain text is extended by an indication bit, which indicates whether or not the number of the reversible decomposition function is contained in the plain text or one of the first and second plain text parts.

13 . The method of claim 12 , wherein the indication bit is arranged at a previously defined position within the plain text or within one or both first and second plain text parts.

14 . The method of claim 10 , wherein the method uses a standard decomposition function if the number does not exist.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 18, 2025
From: FRIESEN, VIKTOR
To: MERCEDES-BENZ GROUP AG
Reel/Frame 071757/0333 →
Priority Claims (1)
DE 10 2022 004 632.6 · Dec 12, 2022 · national
Continuity (1)
Related Publication 20260019234A1 · Jan 15, 2026
References Cited (65)
US 4322576A · Miller · 1982 [cited by examiner]
US 5870470A · Johnson · 1999 [cited by examiner]
US 7945783B2 · Kent, Jr. · 2011 [cited by examiner]
US 8223967B2 · Bennett · 2012 [cited by examiner]
US 8316237B1 · Felsher · 2012 [cited by examiner]
US 8356177B2 · McGrew · 2013 [cited by examiner]
US 8358781B2 · Schneider · 2013 [cited by examiner]
US 9602277B2 · Marlow · 2017 [cited by examiner]
US 10097522B2 · Philipp · 2018 [cited by examiner]
US 10728019B2 · Winslow · 2020 [cited by examiner]
US 11294727B2 · Ragnoli · 2022 [cited by examiner]
US 11336447B2 · Samid · 2022 [cited by examiner]
US 11347895B2 · Abhyankar · 2022 [cited by examiner]
US 11451521B2 · Rangaraj · 2022 [cited by examiner]
US 11539505B2 · Onoda · 2022 [cited by examiner]
US 11546146B2 · Kalach · 2023 [cited by examiner]
US 11580234B2 · Kounavis · 2023 [cited by examiner]
US 11810676B2 · Brock · 2023 [cited by examiner]
US 11824840B1 · Meixler · 2023 [cited by examiner]
US 12160501B2 · Webster · 2024 [cited by examiner]
US 12341871B2 · Stapleton · 2025 [cited by examiner]
US 20030084308A1 · Van Rijnswou · 2003 [cited by examiner]
US 20050008162A1 · Brokenshire · 2005 [cited by examiner]
US 20050210179A1 · Walmsley · 2005 [cited by examiner]
US 20050213752A1 · Hawkes · 2005 [cited by examiner]
US 20050262573A1 · Bo · 2005 [cited by examiner]
US 20060100964A1 · Wilde · 2006 [cited by examiner]
US 20080288771A1 · Kulakowski · 2008 [cited by examiner]
US 20100002870A1 · Rose · 2010 [cited by examiner]
US 20100135486A1 · Schneider · 2010 [cited by examiner]
US 20100169645A1 · McGrew · 2010 [cited by examiner]
US 20110054767A1 · Schafer · 2011 [cited by examiner]
US 20110194693A1 · Izu · 2011 [cited by examiner]
US 20120314857A1 · Minematsu · 2012 [cited by examiner]
US 20130305328A1 · Leung · 2013 [cited by examiner]
US 20160226660A1 · Takatsukasa · 2016 [cited by examiner]
US 20160344707A1 · Philipp · 2016 [cited by examiner]
US 20170170952A1 · Hart · 2017 [cited by examiner]
US 20180285838A1 · Franaszek · 2018 [cited by examiner]
US 20180359222A1 · Hathaway · 2018 [cited by examiner]
US 20190251526A1 · Jackson · 2019 [cited by examiner]
US 20190305936A1 · King · 2019 [cited by examiner]
US 20190377904A1 · Sinha · 2019 [cited by examiner]
US 20200052884A1 · Tong · 2020 [cited by examiner]
US 20200084021A1 · Kim · 2020 [cited by examiner]
US 20200084027A1 · Duchon · 2020 [cited by examiner]
US 20200117810A1 · Kounavis · 2020 [cited by examiner]
US 20200127982A1 · Rangaraj · 2020 [cited by examiner]
US 20200250318A1 · Al Belooshi · 2020 [cited by examiner]
US 20200313856A1 · Basu · 2020 [cited by examiner]
US 20210092102A1 · Hathaway · 2021 [cited by examiner]
US 20210281407A1 · Samid · 2021 [cited by examiner]
US 20220004647A1 · Casella · 2022 [cited by examiner]
US 20220109559A1 · Kalach · 2022 [cited by examiner]
US 20230123475A1 · Johnson · 2023 [cited by examiner]
US 20230216659A1 · French · 2023 [cited by examiner]
US 20230336326A1 · Swahn · 2023 [cited by examiner]
US 20250036787A1 · Samid · 2025 [cited by examiner]
DE 102019113026A1 · 2019 [cited by applicant]
DE 102021001095A1 · 2021 [cited by applicant]
WO 2009013420A1 · 2009 [cited by applicant]
WO 2019079890A1 · 2019 [cited by applicant]
Decision to Grant a Patent mailed Mar. 20, 2025 in related/corresponding EP Application No. 23814130.3. [cited by applicant]
International Search Report and Written Opinion mailed Feb. 19, 2024 in related/corresponding International Application No. PCT/EP2023/083082. [cited by applicant]
Office Action created Sep. 26, 2023 in related/corresponding DE Application No. 10 2022 004 632.6. [cited by applicant]