Abstract
This paper describes a data mixing 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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
