发布求助
文献互助 智能选刊 最新文献

Journal of Discrete Mathematical Sciences and Cryptography最新文献

筛选
英文 中文
OCA: An intelligent model for improving security breach of biometric based authentication systems OCA:一种智能模型，用于改进基于生物特征的身份验证系统的安全漏洞
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1765
Sandeep Kumar Sharma, Anil Kumar, Rashmi Ashtagi, Rekha Jain
{"title":"OCA: An intelligent model for improving security breach of biometric based authentication systems","authors":"Sandeep Kumar Sharma, Anil Kumar, Rashmi Ashtagi, Rekha Jain","doi":"10.47974/jdmsc-1765","DOIUrl":"https://doi.org/10.47974/jdmsc-1765","url":null,"abstract":"In the recent era, biometrics is one of the most used authentication systems. Generally, biometric systems are based on imaging technology, which works on scanned images. This system processes the image and compares it with the database and decides authenticity of user. Authentication and faster response are the key objectives of all biometric systems, but they suffered from a serious issue i.e., security breach. In this article, a Cellular Automata based method is introduced, which processes the image and identify possible security breaches. The proposed method analysis all the pixels of the image and maps a rule, which processes the image and generates a gray image by defining all the possible edges of the image objects. The gray image contains only binary values, which may reduce the chance of breach and decrease the comparison time of gray image with database. In this paper, the proposed method is experimented on the open-source dataset and the results are validated using authentication parameters.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Authenticated key exchange protocol security of cloud services management using machine learning 使用机器学习的云服务管理的认证密钥交换协议安全性
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1761
Vani Agrawal, Nilesh Dubey, Virendra Singh, Nepali Singla, Sarvesh Kumar, Dinesh Goyal
{"title":"Authenticated key exchange protocol security of cloud services management using machine learning","authors":"Vani Agrawal, Nilesh Dubey, Virendra Singh, Nepali Singla, Sarvesh Kumar, Dinesh Goyal","doi":"10.47974/jdmsc-1761","DOIUrl":"https://doi.org/10.47974/jdmsc-1761","url":null,"abstract":"The reason for cloud-based confirmation is to shield organizations from programmers attempting to take classified data. Cloud validation permits approved clients across organizations and landmasses to safely get to data put away in the cloud with verification given through cloud-based administrations. Artificial intelligent (AI) permits organizations to empower the information to show the framework how to tackle the central issue with AI calculations and how to get better after some time. The present undertakings are assaulted with information. To drive better business decisions, they need to sort out it. Distributed computing is a huge term for all Data Science and Machine Learning Enthusiasts. It is far-fetched that you probably won’t have run over it, even as a juvenile. The most important issue is that this type of security is needed for the cloud services. A clear explanation for this is that as the dataset develops, i.e., more models and features are added, the AI model ends up being more multifaceted. Internet Key Exchange (IKE) is a standard convention used to set up a safe and confirmed correspondence channel between two gatherings through a virtual private network (VPN). The convention guarantees security for VPN exchange, remote host and organization access.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355945","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Semi-essentially prime modules 半本质素模
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1631
Mohammed Baqer Hashim Al-Hakeem, Nuhad Salim Al-Mothafar
{"title":"Semi-essentially prime modules","authors":"Mohammed Baqer Hashim Al-Hakeem, Nuhad Salim Al-Mothafar","doi":"10.47974/jdmsc-1631","DOIUrl":"https://doi.org/10.47974/jdmsc-1631","url":null,"abstract":"Let R be a commutative ring with 1 and M be a (left) unitary R – module. This essay gives generalizations for the notions prime module and some concepts related to it. We termed an R – module M as semi-essentially prime if annR (M) = annR (N) for every non-zero semi-essential submodules N of M. Given some of their advantages characterizations and examples, and we study the relation between these and some classes of modules.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135845186","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments 面向分布式环境的椭圆曲线秘密共享安全组密钥协商协议
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1825
Raju M. Sairise, Suresh Limkar, Sarika T. Deokate, Shrinivas T. Shirkande, Rupali Atul Mahajan, Anil Kumar
{"title":"Secure group key agreement protocol with elliptic curve secret sharing for authentication in distributed environments","authors":"Raju M. Sairise, Suresh Limkar, Sarika T. Deokate, Shrinivas T. Shirkande, Rupali Atul Mahajan, Anil Kumar","doi":"10.47974/jdmsc-1825","DOIUrl":"https://doi.org/10.47974/jdmsc-1825","url":null,"abstract":"Secure communication is crucial in today’s increasingly interconnected world, especially in distributed contexts where several parties must cooperate while maintaining confidentiality and authenticity. In order to overcome these difficulties, this work introduces a novel Secure Group Key Agreement Protocol (SGKAP) strengthened with Elliptic Curve Secret Sharing (ECSS).The proposed SGKAP uses the strength of elliptic curve cryptography to provide a shared secret key across participants, assuring data transmission confidentiality. Contrary to conventional methods, SGKAP integrates ECSS as a second layer of security to verify participant identity, thus boosting the protocol’s resistance to malevolent adversaries.To create a shared group key, members exchange their elliptic curve public keys at the start of the protocol. During this stage, ECSS is used, and participants create distinctive authentication tokens using their personal secrets. Participants exchange and verify these tokens among themselves, ensuring that only those with the proper permissions have access to the group key.In addition to guaranteeing data confidentiality, SGKAP also verifies the group members’ participation. Furthermore, by mandating secret-sharing-based authentication, ECSS strengthens the protocol’s resistance to insider attacks.We carried out a comprehensive set of simulations and experiments in various distributed contexts to assess the performance and security of SGKAP with ECSS.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135357941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
An examination of the security of the TR-31 and AS 2805 schemes 审查TR-31和AS 2805方案的安全性
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1644
Arthur Van Der Merwe, David Paul, Jelena Schmalz, Timothy M. Schaerf
{"title":"An examination of the security of the TR-31 and AS 2805 schemes","authors":"Arthur Van Der Merwe, David Paul, Jelena Schmalz, Timothy M. Schaerf","doi":"10.47974/jdmsc-1644","DOIUrl":"https://doi.org/10.47974/jdmsc-1644","url":null,"abstract":"In our review of payments cryptography, we analyze the security of the Australian card payment system. In the analysis, we examine existing cryptographic protocols using well-known techniques. We discuss the Australian Triple-DES variant methods (AS 2805) which offer key usage division. We then compare Triple-DES variants with alternative mechanisms to discover a significant weakness in the AS 2805 methods.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135843804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The optimized Diffie-Hellman key exchange using the graphical method 使用图形化方法优化了Diffie-Hellman密钥交换
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1615
Huda Kadhim M. Aljader, Ruma Kareem K. Ajeena
{"title":"The optimized Diffie-Hellman key exchange using the graphical method","authors":"Huda Kadhim M. Aljader, Ruma Kareem K. Ajeena","doi":"10.47974/jdmsc-1615","DOIUrl":"https://doi.org/10.47974/jdmsc-1615","url":null,"abstract":"In this paper, we describe a new contribution that uses the optimization problem to create a new version of the Diffie-Hellman key exchange (DHKE). The proposed version depended on the optimized discrete logarithm functions (ODLFs) that are given as a new definition in this work. A graphical method considers a fundamental tool to compute a shared secret key (SSK) in the proposed optimized Diffie-Hellman key exchange (ODHKE). The ODHKE is a more secure protocol for computing the SSK in comparison with the original DHKE.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135843811","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Construction of S-boxes with LBN and DBN ≥ 4 构建LBN和DBN≥4的s -box
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1572
Sonu Pal, Saibal. K. Pal, Anupama Panigrahi
{"title":"Construction of S-boxes with LBN and DBN ≥ 4","authors":"Sonu Pal, Saibal. K. Pal, Anupama Panigrahi","doi":"10.47974/jdmsc-1572","DOIUrl":"https://doi.org/10.47974/jdmsc-1572","url":null,"abstract":"There is always a need for good and safe S-boxes in block ciphers for secure communication. To improve the security of lightweight block ciphers, S-boxes with high linear and diiferential branch numbers (LBN and DBN) are utilized. Many of these S-boxes have been built in recent years. Sarkar et. al. built S-boxes with LBN and DBN both equal to 3. Kim Hangi et. al. also created 8-bit S-boxes using smaller S-boxes with at least 3 LBN and DBN. In this direction, we narrow the search space of 8 × 8 S-boxes with LBN = DBN = 4. We used the Feistel and Lai-Massey structures to build these S-boxes. We present a detailed explanation of such 8 × 8 S-boxes.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135844183","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A multi-model unified disease diagnosis framework for cyber healthcare using IoMT- cloud computing networks 基于IoMT-云计算网络的多模型统一疾病诊断框架
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1831
Kamal Upreti, Sheng-Lung Peng, Pravin Ramdas Kshirsagar, Prasun Chakrabarti, Halah A. Al-Alshaikh, A. K. Sharma, Ramesh Chandra Poonia
{"title":"A multi-model unified disease diagnosis framework for cyber healthcare using IoMT- cloud computing networks","authors":"Kamal Upreti, Sheng-Lung Peng, Pravin Ramdas Kshirsagar, Prasun Chakrabarti, Halah A. Al-Alshaikh, A. K. Sharma, Ramesh Chandra Poonia","doi":"10.47974/jdmsc-1831","DOIUrl":"https://doi.org/10.47974/jdmsc-1831","url":null,"abstract":"The past several decades of research into machine learning have been of great assistance to humanity in the diagnosis of a variety of ailments using various forms of automated diagnostic procedures. Machine learning, combined with smart health devices, has improved health monitoring, timely diagnoses, and treatment. This paper introduces a unified disease diagnosis framework, integrating cloud computing, machine learning, and IoT. The framework has three layers: physical (collects patient data), fog (intermediate layer with a domain identification unit to determine input and diagnosis type), and transmission (cloud server with a disease detection unit). The performance evaluation shows the robustness and efficiency of the model as compared to state-of-art models.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135845146","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The Huff curve–ElGamal graphic public key cryptosystem Huff曲线- elgamal图形公钥密码系统
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1640
Batool Hatem Akar Alkfari, Ruma Kareem K. Ajeena
{"title":"The Huff curve–ElGamal graphic public key cryptosystem","authors":"Batool Hatem Akar Alkfari, Ruma Kareem K. Ajeena","doi":"10.47974/jdmsc-1640","DOIUrl":"https://doi.org/10.47974/jdmsc-1640","url":null,"abstract":"A new graph for the cryptographic application is presented in this work. This graph is defined using the Huff curve over a prime field. The Huffs curve graph (HCg) considered as an alternative graph of the Edwards curve graph (EdCG).The HCg is used to give another modified Version Public-key cryptosystem ElGamal (EPKC) the proposed HC-ElGamal graphic cryptosystem enhances the secure communication in compare with original EPKC.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135845163","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A mathematical model for secure Cloud-IoT communication: Introducing the revolutionary lightweight key mechanism 云-物联网安全通信的数学模型:引入革命性的轻量级密钥机制
Journal of Discrete Mathematical Sciences and Cryptography Pub Date : 2023-01-01 DOI: 10.47974/jdmsc-1750
Gaikwad Vidya Shrimant, K. Ravindranath, Gudapati Syam Prasad
{"title":"A mathematical model for secure Cloud-IoT communication: Introducing the revolutionary lightweight key mechanism","authors":"Gaikwad Vidya Shrimant, K. Ravindranath, Gudapati Syam Prasad","doi":"10.47974/jdmsc-1750","DOIUrl":"https://doi.org/10.47974/jdmsc-1750","url":null,"abstract":"Internet of Things (IoT) is a new technology in telecommunications that focuses on wireless, remote communication. It involves connecting various smart devices to build a network that can transfer data through the cloud. In this type of environment, challenges such as device life span of battery, space needed for storage, consumption of power, and data security for cloud IoT have been identified. This work presents the design and implementation of a secure lightweight key establishment system for the integration of IoT Cloud. A Symmetric Lightweight Algorithm is utilized to enhance the security of Cloud IoT. To improve the efficiency of key setup time, the Advanced Encryption Standard (AES) is applied. The use of AES algorithm in combination with Cloud and IoT Security ensures efficient and consistent performance across software and hardware platforms in various environments. This integration allows for the connection of various smart devices and sensors to Cloud IoT services, facilitating the sharing of sensor readings while addressing security concerns. Before any data is transferred, we securely authenticate both the cloud server and IoT device and generate unique session keys for each new communication session. We conclude by discussing about how cloud computing helps IoT technology achieve secure connection by overcoming various security challenges.","PeriodicalId":193977,"journal":{"name":"Journal of Discrete Mathematical Sciences and Cryptography","volume":"133 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135355354","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信