Strong, efficient and reliable personal messaging peer to peer architecture based on Hybrid RSA

A. Bhattacharjya, Xiaofeng Zhong, Jing Wang
{"title":"Strong, efficient and reliable personal messaging peer to peer architecture based on Hybrid RSA","authors":"A. Bhattacharjya, Xiaofeng Zhong, Jing Wang","doi":"10.1145/2896387.2896431","DOIUrl":null,"url":null,"abstract":"Rivest- Shamir-Adleman (RSA) algorithm is the widespread encryption scheme that promises confidentiality and authenticity over an insecure communication channel. The RSA has drawbacks of various attacks like Brute force key search, Mathematical attacks, Timing attacks and Chosen Ciphertext attacks etc. So here a Strong, efficient and reliable personal messaging peer to peer architecture based on Hybrid RSA for an active networked environment is proposed. The main peer to peer personal messaging architecture will be strong, efficient and reliable, and communication protocol will allow only one authenticated person to converse with the person who is in the server end, multiple chat clients can be connected to the server but has to wait for authenticated connection with secure server one by one. Also multiple servers with multiple clients can run for distributed strong, efficient and reliable messaging. As at the key exchange level, the Miller-Rabin test is done with pseudo random numbers generated and changing the keys synchronously with predefined time frames, these mechanisms make the keys absolutely strong and main RSA integration with shared RSA gives more statistical complexity here. In the decryption process, The Chinese Remainder Theorem (CRT) is used with shadows along with the strong prime of RSA criterion extended into domain of Gaussian Integer for very high efficiency. The Shared RSA adds more complexity in decryption. Public Key Cryptography Standards (PKCS) version 5 is used to tackle the Chosen cipher text attack when messaging is going on. The Efficient RSA with Rabin-Miller strong Primality test integration and pohligHellmanEncipher with salt and padding integration makes it strong and reliable.","PeriodicalId":342210,"journal":{"name":"Proceedings of the International Conference on Internet of things and Cloud Computing","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the International Conference on Internet of things and Cloud Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2896387.2896431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Rivest- Shamir-Adleman (RSA) algorithm is the widespread encryption scheme that promises confidentiality and authenticity over an insecure communication channel. The RSA has drawbacks of various attacks like Brute force key search, Mathematical attacks, Timing attacks and Chosen Ciphertext attacks etc. So here a Strong, efficient and reliable personal messaging peer to peer architecture based on Hybrid RSA for an active networked environment is proposed. The main peer to peer personal messaging architecture will be strong, efficient and reliable, and communication protocol will allow only one authenticated person to converse with the person who is in the server end, multiple chat clients can be connected to the server but has to wait for authenticated connection with secure server one by one. Also multiple servers with multiple clients can run for distributed strong, efficient and reliable messaging. As at the key exchange level, the Miller-Rabin test is done with pseudo random numbers generated and changing the keys synchronously with predefined time frames, these mechanisms make the keys absolutely strong and main RSA integration with shared RSA gives more statistical complexity here. In the decryption process, The Chinese Remainder Theorem (CRT) is used with shadows along with the strong prime of RSA criterion extended into domain of Gaussian Integer for very high efficiency. The Shared RSA adds more complexity in decryption. Public Key Cryptography Standards (PKCS) version 5 is used to tackle the Chosen cipher text attack when messaging is going on. The Efficient RSA with Rabin-Miller strong Primality test integration and pohligHellmanEncipher with salt and padding integration makes it strong and reliable.
基于混合RSA的强大、高效、可靠的个人信息对等体系结构
RSA (Rivest- Shamir-Adleman)算法是一种广泛使用的加密方案,它在不安全的通信通道上保证机密性和真实性。RSA具有各种攻击的缺点,如蛮力密钥搜索,数学攻击,定时攻击和选择的密文攻击等。为此,本文提出了一种适用于主动网络环境的基于混合RSA的强大、高效、可靠的个人消息对等体系结构。主要的点对点个人消息传递体系结构将是强大、高效和可靠的,通信协议将只允许一个经过身份验证的人与服务器端的人进行通信,多个聊天客户端可以连接到服务器,但必须等待与安全服务器的身份验证连接。此外,可以运行具有多个客户机的多个服务器,以实现分布式的强、高效和可靠的消息传递。在密钥交换级别,Miller-Rabin测试使用生成的伪随机数完成,并与预定义的时间框架同步更改密钥,这些机制使密钥绝对强大,并且与共享RSA的主要RSA集成在这里提供了更多的统计复杂性。在解密过程中,利用中国剩余定理(CRT),将阴影与RSA准则的强素数扩展到高斯整数域,提高了解密效率。共享RSA增加了解密的复杂性。公钥加密标准(PKCS)版本5用于在进行消息传递时处理所选密文攻击。采用Rabin-Miller强质数测试集成的高效RSA和采用盐和填充集成的pohlighellmanencryption使其强而可靠。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信