Abstract
In this paper, we present RBS (Redundant Bit Security) 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 order. 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 that it a good candidate for resource-constraint devices such as RFID systems and wireless sensors.
Users
Please
log in to take part in the discussion (add own reviews or comments).