Reversible data mixing procedure for efficient public-key encryption
✍ Scribed by Mike Matyas; Mohammad Peyravian; Allen Roginsky; Nev Zunic
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 754 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0167-4048
No coin nor oath required. For personal study only.
✦ Synopsis
This paper describes a datd mixmg method for encrypting a plaintext block using a block encryption algorithm (such as Elliptic Curve, RSA, etc.) having a block size smaller than that of the plaintext block. The process of encrypting a plaintext block consists of first mixing the plaintext block and then encrypting a portion or all of the mixed plaintext block.The mixing method is a reversible procedure which performs a 'complete' mixing of the plaintext block such that no secret bit in the plaintext block can be determined unless every bit in the mixed plaintext block is known. The 'mixing' of the plaintext is done in such a way that encrypting only a small portion of the mixed plaintext will still provide the same level of protection :as if the entire plaintext was encrypted.