Mixed unary cryptography

US11212097B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-11212097-B2
Application numberUS-202117323908-A
CountryUS
Kind codeB2
Filing dateMay 18, 2021
Priority dateMay 17, 2015
Publication dateDec 28, 2021
Grant dateDec 28, 2021

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A stream of plaintext is marked per its more sensitive parts. These marked parts are being encrypted via mathematically secure ciphers for which the ciphertext may be much larger than the plaintext. This invention creates a mix of size-preserving encryption for the not so sensitive parts of the plaintext, and size-enlarging encryption for the marked parts, thereby security is served without the inconvenience of a very long ciphertext.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: receiving, by a computing device, a plaintext message M; selecting, by the computing device, n segments (P 1 , P 2 , P 3 . . . P n ) from the plaintext message M, wherein n is a positive integer greater than or equal to two, and wherein the selected n segments (P 1 , P 2 , P 3 . . . P n ) are a subset of the plaintext message M; removing, by the computing device, each of the selected n segments (P 1 , P 2 , P 3 . . . P n ) from the plaintext message M; and concatenating, by the computing device, remaining sections of plaintext message to a contiguous left-over message M i ; for each of the selected n segments (P 1 , P 2 , P 3 . . . P n ): identifying, by the computing device, a bit position value t i , i=1, 2, . . . n, wherein the bit position value t i denotes a bit position for each of the selected n segments (P 1 , P 2 , P 3 . . . P n ) relative to the plaintext message M; generating, by the computing device, a concatenated segment P* i , i=1, 2, . . . n, for each of the selected n segments (P 1 , P 2 , P 3 . . . P n ), wherein each of the concatenated segments P* i , i=1, 2, . . . n, is generated from concatenating a corresponding segment P i , i=1, 2, . . . n, with a first header with h header bits corresponding to the bit position value t i and a first trailer bits, according to the formula P* i =[ h bits indicating t i ]∥ P i ∥[trailer bits], wherein the first trailer bits are set to 1 for i=1, 2, . . . (n−1), and 0 for i=n; concatenating, by the computing device, a second header bits in the form of “1000 . . . 1” to each of the concatenated segments P* i , i=1, 2, . . . n, the second header bits comprise of an arbitrary number of numerical zeros between numerical ones; concatenating, by the computing device, a second trailer bits in the form of “0111 . . . 0” to each of the concatenated segments P* i , i=1, 2, . . . n, the second trailer bits comprise an arbitrary number of numerical ones between numerical zeros, so as to update the each of the concatenated segments P* i , i=1, 2, . . . n; encrypting, by the computing device, each of the updated concatenated segments P* i , i=1, 2, . . . n, using an augmented-ciphertext cipher A with an augmented cipher key K a , and generating a corresponding ciphertext C i , i=1, 2, . . . n, according to the formula C i =α( P* i ,K a ), where α denotes encryption with the augmented-ciphertext cipher A, wherein each of the ciphertexts C i , i=1, 2, . . . n, has same bit size; for the contiguous left-over message M 1 : encrypting, by the computing device, the contiguous left-over message M 1 using a base cipher B with a base cipher key K b , according to the formula C 1 =β( M 1 ,K b ), where β denotes encryption with the base cipher B, wherein the base cipher B uses different encryption algorithm and encryption key from the augmented-ciphertext cipher A; generating, by the computing device, a mixed ciphertext C m by concatenating the ciphertext C i , i=1, 2, . . . n, and C 1 according to the formula C m =C 1 ∥C 2 ∥ . . . ∥C n ∥C 1 ; and transmitting, by the computing device, the mixed ciphertext C m to an intended recipient.

Assignees

Inventors

Classifications

  • involving random numbers or seeds · CPC title

  • H04L9/14Primary

    using a plurality of keys or algorithms · CPC title

  • H04L9/0618Primary

    Block ciphers, i.e. encrypting groups of characters of a plain text message using fixed encryption transformation · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US11212097B2 cover?
A stream of plaintext is marked per its more sensitive parts. These marked parts are being encrypted via mathematically secure ciphers for which the ciphertext may be much larger than the plaintext. This invention creates a mix of size-preserving encryption for the not so sensitive parts of the plaintext, and size-enlarging encryption for the marked parts, thereby security is served without the…
Who is the assignee on this patent?
Samid Gideon
What technology area does this patent fall under?
Primary CPC classification H04L9/14. Mapped technology areas include Electricity.
When was this patent published?
Publication date Tue Dec 28 2021 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).