利用一种新的加密算法增强数据安全性

Deep Chhowala
{"title":"利用一种新的加密算法增强数据安全性","authors":"Deep Chhowala","doi":"10.1109/ICOEI.2019.8862523","DOIUrl":null,"url":null,"abstract":"Cryptography is a very good area for R&D today. With each and every new cryptographic algorithm being developed, ways to crack those algorithms are also being developed at a very fast pace. In this paper, I have developed a new cryptographic algorithm, in which a matrix based on the length of words is generated, few operations are performed on this matrix and the resultant matrix obtained, is used for encryption and decryption. Everything in the plain text, including full stops, apostrophe, comma and all the special symbols which have ASCII value from 33 to 126 will be encrypted.","PeriodicalId":212501,"journal":{"name":"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","volume":"42 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhanced Data Security Using a Novel Cryptographic Algorithm\",\"authors\":\"Deep Chhowala\",\"doi\":\"10.1109/ICOEI.2019.8862523\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cryptography is a very good area for R&D today. With each and every new cryptographic algorithm being developed, ways to crack those algorithms are also being developed at a very fast pace. In this paper, I have developed a new cryptographic algorithm, in which a matrix based on the length of words is generated, few operations are performed on this matrix and the resultant matrix obtained, is used for encryption and decryption. Everything in the plain text, including full stops, apostrophe, comma and all the special symbols which have ASCII value from 33 to 126 will be encrypted.\",\"PeriodicalId\":212501,\"journal\":{\"name\":\"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)\",\"volume\":\"42 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICOEI.2019.8862523\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 3rd International Conference on Trends in Electronics and Informatics (ICOEI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICOEI.2019.8862523","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

如今,密码学是一个非常适合研发的领域。随着每一种新的加密算法的发展,破解这些算法的方法也在以非常快的速度发展。在本文中,我开发了一种新的加密算法,该算法生成一个基于单词长度的矩阵,对该矩阵进行少量的操作,得到的结果矩阵用于加密和解密。纯文本中的所有内容,包括句号,撇号,逗号和所有ASCII值从33到126的特殊符号都将被加密。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhanced Data Security Using a Novel Cryptographic Algorithm
Cryptography is a very good area for R&D today. With each and every new cryptographic algorithm being developed, ways to crack those algorithms are also being developed at a very fast pace. In this paper, I have developed a new cryptographic algorithm, in which a matrix based on the length of words is generated, few operations are performed on this matrix and the resultant matrix obtained, is used for encryption and decryption. Everything in the plain text, including full stops, apostrophe, comma and all the special symbols which have ASCII value from 33 to 126 will be encrypted.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信