Cellular automata cryptographic model based on bi-directional toggle rules
dc.contributor.author | Oliveira G.M.B. | |
dc.contributor.author | Coelho A.R. | |
dc.contributor.author | Monteiro L.H.A. | |
dc.date.accessioned | 2024-03-13T01:44:51Z | |
dc.date.available | 2024-03-13T01:44:51Z | |
dc.date.issued | 2004 | |
dc.description.abstract | Cellular automata, (CA) are discrete dynamical systems that call be employed as cryptography algorithms. Irreversible CA with toggle rules - either to the right or to the left - were already proposed for encrypting. However, the similarity between ciphertexts when the plaintext is submitted to a small perturbation was identified as a flaw in this model. Here, such a model is altered by using bi-directional toggle CA rules instead of one-directional ones. Numerical experiments showed that the similarity flaw was eliminated by considering this modification, obtaining protection against differential cryptanalysis. | |
dc.description.firstpage | 1061 | |
dc.description.issuenumber | 8 | |
dc.description.lastpage | 1068 | |
dc.description.volume | 15 | |
dc.identifier.doi | 10.1142/S0129183104006583 | |
dc.identifier.issn | 0129-1831 | |
dc.identifier.uri | https://dspace.mackenzie.br/handle/10899/37920 | |
dc.relation.ispartof | International Journal of Modern Physics C | |
dc.rights | Acesso Restrito | |
dc.subject.otherlanguage | Cellular automata | |
dc.subject.otherlanguage | Cryptography | |
dc.subject.otherlanguage | Toggle rules | |
dc.title | Cellular automata cryptographic model based on bi-directional toggle rules | |
dc.type | Artigo | |
local.scopus.citations | 11 | |
local.scopus.eid | 2-s2.0-8744292045 | |
local.scopus.updated | 2024-05-01 | |
local.scopus.url | https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=8744292045&origin=inward |