密码学中元胞自动机的演化集体行为

MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference Pub Date : 2006-05-16 DOI:10.1109/MELCON.2006.1653219

M. Szaban, F. Seredyński, P. Bouvry

{"title":"密码学中元胞自动机的演化集体行为","authors":"M. Szaban, F. Seredyński, P. Bouvry","doi":"10.1109/MELCON.2006.1653219","DOIUrl":null,"url":null,"abstract":"We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed in a set of predefined rules. We discover new subsets of CA rules providing very high quality of PNSs, which can be used in cryptographic modules","PeriodicalId":299928,"journal":{"name":"MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":"{\"title\":\"Evolving collective behavior of cellular automata for cryptography\",\"authors\":\"M. Szaban, F. Seredyński, P. Bouvry\",\"doi\":\"10.1109/MELCON.2006.1653219\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed in a set of predefined rules. We discover new subsets of CA rules providing very high quality of PNSs, which can be used in cryptographic modules\",\"PeriodicalId\":299928,\"journal\":{\"name\":\"MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"10\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MELCON.2006.1653219\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.2006.1653219","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 10

摘要

我们考虑一维细胞自动机(CA)，并应用遗传算法(GA)来发现控制CA细胞的规则子集，这些子集的集体行为导致高质量的伪随机数序列(PNSs)适合对称密钥加密。规则子集的搜索在一组预定义的规则中执行。我们发现了新的CA规则子集，提供了非常高质量的pns，可以用于加密模块

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Evolving collective behavior of cellular automata for cryptography

We consider 1D cellular automata (CA) and apply genetic algorithm (GA) to discover subsets of rules controlling CA cells, which collective behavior results in a high quality of pseudorandom number sequences (PNSs) suitable for symmetric key cryptography. The search of subsets of rules is performed in a set of predefined rules. We discover new subsets of CA rules providing very high quality of PNSs, which can be used in cryptographic modules

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

MELECON 2006 - 2006 IEEE Mediterranean Electrotechnical Conference

自引率

0.00%

发文量