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

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设计的成员。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
A Holistic Approach For Patient Health Care Monitoring System Through IoT Pomegranate Diseases and Detection using Sensors: A Review Energy Efficient Optimal Path based coded transmission for multi-sink and multi-hop WSN Iot Based Smart Shopping Mall Visual screens in Canteens providing Real Time information of Food Wastage
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1