Design of fast one-pass authenticated and randomized encryption schema using reversible cellular automata

• We propose a fast authenticated encryption using reversible cellular automata.
• The schemes are shown to be CCA-secure.
• Only one pass is performed to ensure both encryption and authentication.
• No need for hash mechanisms to ensure cipher-text integrity.
• A formal proof of the integrity preserving validity is provided.

A novel way to provide fast authenticated and randomized encryption is proposed using reversible cellular automata for the first time. A block-based cryptosystem is presented and shown to provide security against both active and passive attackers by the way of a strong authentication mechanism. The proposed system is much faster than existing authenticated encryption standards since only one pass per block is performed to ensure both encryption and integrity. Experimental results show robustness of the cryptosystem against several cryptanalysis techniques, when a formal proof of strict integrity preserving is included. Obtained results demonstrate superiority of the approach in both security and rapidity aspects.