SD-REE: A Cryptographic Method to Exclude Repetition from a Message
Somdip Dey

TL;DR
The paper introduces SD-REE, a cryptographic technique that removes repetitive terms from messages before encryption, enhancing security by preventing attackers from analyzing repetitions to retrieve or predict the original message.
Contribution
The paper presents a novel cryptographic method, SD-REE, that eliminates message repetitions prior to encryption, reducing vulnerability to pattern analysis and improving message confidentiality.
Findings
Repetitive bytes are effectively removed from messages.
Encrypted messages show no traces of original repetitions.
The method enhances security against pattern-based cryptanalysis.
Abstract
In this paper, the author presents a new cryptographic technique, SD-REE, to exclude the repetitive terms in a message, when it is to be encrypted, so that it becomes almost impossible for a person to retrieve or predict the original message from the encrypted message. In modern world, cryptography hackers try to break a code or cryptographic algorithm [1,2] or retrieve the key, used for encryption, by inserting repetitive bytes / characters in the message and encrypt the message or by analyzing repetitions in the encrypted message, to find out the encryption algorithm or retrieve the key used for the encryption. But in SD-REE method the repetitive bytes / characters are removed and there is no trace of any repetition in the message, which was encrypted.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCryptography and Residue Arithmetic · Chaos-based Image/Signal Encryption · Cryptographic Implementations and Security
