Abstract

In this paper, we present RBS (Redundant Bit Securi ty) algorithm which is a low-complexity symmetric encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data bits to change the location of the plaintext bits in the transmitted data without changing their o rder. The location of redundant bits inside the transmitted data represents the secret key between sender and receiver. The algorithm provides integrity and authentication of the original data as well. The implementation comparison of this algorithm with other algorithms confirms thatit a good candidate for resource-constraint devices such as RFID systems and wireless sensors .

Full Text
Published version (Free)

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 call