On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction

DOI10.17951/AI.2015.15.1.21-31zbMath1412.94172OpenAlexW2593151880WikidataQ127819015 ScholiaQ127819015MaRDI QIDQ5377238

Kamel Mohammed Faraoun

Publication date: 24 May 2019

Published in: Annales Universitatis Mariae Curie-Sklodowska, sectio AI – Informatica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.17951/ai.2015.15.1.21-31

zbMATH Keywords

cryptographyblock cipherssemantic securityreversible cellular automata

Mathematics Subject Classification ID

Cryptography (94A60) Cellular automata (computational aspects) (68Q80)

This page was built for publication: On the semantic security of cellular automata based pseudo-random permutation using results from the Luby-Rackoff construction