256位块大小的对合轻量级块密码

2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT) Pub Date : 2018-08-01 DOI:10.1109/ICGCIOT.2018.8753016

Sukanya Saha, Krishnendu Rarhi, Abhishek Bhattacharya, Pratyusa Mukherjee

{"title":"256位块大小的对合轻量级块密码","authors":"Sukanya Saha, Krishnendu Rarhi, Abhishek Bhattacharya, Pratyusa Mukherjee","doi":"10.1109/ICGCIOT.2018.8753016","DOIUrl":null,"url":null,"abstract":"As the heavily loaded world of information is coming out with rapid growth, the need for securing specific details also have a great significance. Among the many proposed lightweight block ciphers out there, the main focus nowadays is on their simple design specifications. In this paper, we have proposed a new involutive block cipher of 256-bit block size which is a member of the Extended LS-Designs.","PeriodicalId":269682,"journal":{"name":"2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"An involutive lightweight block cipher for 256-bit block size\",\"authors\":\"Sukanya Saha, Krishnendu Rarhi, Abhishek Bhattacharya, Pratyusa Mukherjee\",\"doi\":\"10.1109/ICGCIOT.2018.8753016\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"As the heavily loaded world of information is coming out with rapid growth, the need for securing specific details also have a great significance. Among the many proposed lightweight block ciphers out there, the main focus nowadays is on their simple design specifications. In this paper, we have proposed a new involutive block cipher of 256-bit block size which is a member of the Extended LS-Designs.\",\"PeriodicalId\":269682,\"journal\":{\"name\":\"2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-08-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICGCIOT.2018.8753016\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICGCIOT.2018.8753016","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

随着高负荷的信息世界的快速发展，保护特定细节的需求也具有重要意义。在许多提出的轻量级分组密码中，目前主要关注的是它们的简单设计规范。在本文中，我们提出了一种新的256位块大小的对合分组密码，它是扩展ls设计的成员。

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

查看原文本刊更多论文

An involutive lightweight block cipher for 256-bit block size

As the heavily loaded world of information is coming out with rapid growth, the need for securing specific details also have a great significance. Among the many proposed lightweight block ciphers out there, the main focus nowadays is on their simple design specifications. In this paper, we have proposed a new involutive block cipher of 256-bit block size which is a member of the Extended LS-Designs.

求助全文

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

来源期刊

2018 Second International Conference on Green Computing and Internet of Things (ICGCIoT)

自引率

0.00%

发文量