Design of a mix network with elliptic curve cryptography and XOR shuffling for secure communication with 5-node

IF 0.9 Q4 TELECOMMUNICATIONS
Fayaz Ahmad Naikoo, Khaleel Ahmad, Khairol Amali Bin Ahmad
{"title":"Design of a mix network with elliptic curve cryptography and XOR shuffling for secure communication with 5-node","authors":"Fayaz Ahmad Naikoo,&nbsp;Khaleel Ahmad,&nbsp;Khairol Amali Bin Ahmad","doi":"10.1002/itl2.578","DOIUrl":null,"url":null,"abstract":"<p>This research paper proposes a novel 5-node mix network, an anonymous communication network to boost privacy within the network. Within the proposed framework the crypto-operations like encryption, decryption, and shuffling are held with the help of the Elliptic Curve Cryptography (ECC) and XOR algorithm. This unique combination helps to exchange the message within the communication network with enhanced security and privacy. To analyze the processing time and load factor at each intermediate node of mix network, an exhaustive experimental analysis is carried out for key sizes of 256, 384, and 512 bits respectively. These crypto-operations like encryption, decryption, and XOR shuffling need varying time slots to perform at each intermediate node thereby having a varying load factor associated with them. The objective of this research is to analyze the processing time and load factor at each node within the 5-node mix network thereby helping to analyze the strengths and weaknesses of each intermediate node. Through our analysis, these percentages are computed, shedding light on the allocation of computational load and resource utilization among the nodes.</p>","PeriodicalId":100725,"journal":{"name":"Internet Technology Letters","volume":"8 3","pages":""},"PeriodicalIF":0.9000,"publicationDate":"2024-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Internet Technology Letters","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/itl2.578","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"TELECOMMUNICATIONS","Score":null,"Total":0}
引用次数: 0

Abstract

This research paper proposes a novel 5-node mix network, an anonymous communication network to boost privacy within the network. Within the proposed framework the crypto-operations like encryption, decryption, and shuffling are held with the help of the Elliptic Curve Cryptography (ECC) and XOR algorithm. This unique combination helps to exchange the message within the communication network with enhanced security and privacy. To analyze the processing time and load factor at each intermediate node of mix network, an exhaustive experimental analysis is carried out for key sizes of 256, 384, and 512 bits respectively. These crypto-operations like encryption, decryption, and XOR shuffling need varying time slots to perform at each intermediate node thereby having a varying load factor associated with them. The objective of this research is to analyze the processing time and load factor at each node within the 5-node mix network thereby helping to analyze the strengths and weaknesses of each intermediate node. Through our analysis, these percentages are computed, shedding light on the allocation of computational load and resource utilization among the nodes.

基于椭圆曲线加密和异或变换的5节点安全通信混合网络设计
本文提出了一种新型的5节点混合网络,一种匿名通信网络,以提高网络内的隐私性。在提出的框架中,加密、解密和洗牌等加密操作是在椭圆曲线加密(ECC)和异或算法的帮助下进行的。这种独特的组合有助于在通信网络中交换消息,并增强了安全性和隐私性。为了分析混合网络各中间节点的处理时间和负载因子,分别对256位、384位和512位的密钥大小进行了详尽的实验分析。这些加密操作(如加密、解密和异或变换)需要在每个中间节点上执行不同的时隙,从而具有与之相关的不同负载因子。本研究的目的是分析5节点混合网络中每个节点的处理时间和负载因子,从而帮助分析每个中间节点的优缺点。通过我们的分析,计算了这些百分比,从而揭示了节点之间的计算负载分配和资源利用率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
3.10
自引率
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学术官方微信