检索结果-内蒙古大学图书馆

5th International Conference on Data Science, Machine Learning and Applications, ICDSMLA 2023

作者： Agarwal, Trapty Jebakumari, S. Adlin Hemlata Ayesha, Amreen Maharishi School of Engineering & Technology Maharishi University of Information Technology Uttar Pradesh Lucknow India Department of Computer Science and Information Technology Jain University Karnataka Bangalore India Department of Computer Science & Engineering School of Engineering and Computing Dev Bhoomi Uttarakhand University Manduwala Dehradun Navgaon India School of Computer Science and Engineering Presidency University Karnataka Bengaluru India

ISBN: (纸本)9789819780426

This paper describes the implementation of a at ease communication device the usage of an implemented cryptography algorithm. The gadget is designed to provide comfy statistics and voice communique between endpoints using techniques consisting of encryption and digital signature. The applied cryptography set of rules includes primary components, the symmetric and the uneven algorithms. The symmetric algorithms, along with AES and DES, are used for statistics encryption, even as the uneven algorithms, which include RSA and DSA, are used for virtual signature. The proposed gadget additionally focuses on security of physical places to defend the important thing exchange by means of the use of physical access control measures which include biometric identification. The system additionally employs advanced safety strategies together with message authentication codes and protection protocols like SSL/TLS. The device is examined for robustness and safety using real communique experiments. The results confirm that the proposed machine is cozy and green in supplying comfortable communication among endpoints. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Implementing Cryptographic algorithms for Securing Online Transactions 5th

Implementing Cryptographic Algorithms for Securing Online Tr...

引用

5th International Conference on Data Science, Machine Learning and Applications, ICDSMLA 2023

作者： Bhuvana, J. Bhatt, Rahul Metre, Prakash B. Mishra, Awakash Karnataka Bangalore India Department of Computer Science and Engineering School of Engineering and Computing Dev Bhoomi Uttarakhand University Navgaon Manduwala Dehradun India School of Computer Science and Engineering Presidency University Karnataka Bengaluru India Maharishi School of Engineering and Technology Maharishi University of Information Technology Uttar Pradesh Lucknow India

ISBN: (纸本)9789819780426

Cryptographic algorithms are critical in securing online transactions. They provide relaxed verbal exchange channels for fairly touchy statistics that wishes to be reliably transmitted among a couple of remote events. Cryptographic algorithms permit for at ease authentication, confidentiality, non-repudiation, and integrity amongst events for their virtual activities. Implementing those algorithms is a complex procedure, however, due to the ever-changing nature of security threats, acquiring an expertise of the way to properly implement cryptographic algorithms becomes critical. This paper makes a speciality of how to correctly enforce cryptographic algorithms for securing on-line transactions. Precise topics consist of excellent practices for deciding on an appropriate algorithms, fine techniques for key distribution, necessary gadget necessities for cozy on line communications, the process for implementing them, and the importance of securely storing encryption keys. Via expertise the specified procedures and strategies, developers and users might be capable of correctly and securely make on-line transactions. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Performance Comparison: Software vs. Hardware Implementation of Novel S-Box Designed to Resist Power Analysis Attack

Performance Comparison: Software vs. Hardware Implementation...

引用

International Conference on Applications in Electronics Pervading Industry, Environment and Society, APPLEPIES 2024

作者： Mirigaldi, Mattia Martina, Maurizio Masera, Guido Politecnico di Torino Turin Italy

ISBN: (纸本)9783031840999

The Advanced encryption Standard (AES) is the only approved symmetric encryption algorithm by security agencies such as the National Institute of Standards and Technology (NIST). The algorithm is designed to be fast and robust against cryptanalysis attacks. However, the original design lacks of any countermeasure against a novel class of attacks: side-channel attacks. This vulnerability necessitates the implementation of supplementary security measures to guarantee AES security in a deployment scenario. This paper explores a solution that targets the AES Substitution Box (S-Box) structure. The original S-Box is replaced with novel structures inherently more resistant to power-based side channel attacks. This concept is demonstrated by testing six different novel S-Box implementations. Each is subjected to real experiments via a correlation power analysis attack on an AES hardware implementation. A complete comprehension of their effectiveness is gained by comparing the results found to those derived from the AES SW implementation. The solution investigated leverages the inherent mathematical properties of the S-Box to provide a lightweight countermeasure against power analysis side-channel attacks with zero implementation cost. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Research on identification of domestic commercial block cipher algorithms based on deep learning 4

Research on identification of domestic commercial block ciph...

引用

4th International Conference on Computer Vision, Application, and Algorithm, CVAA 2024

作者： Li, Li Chen, Jun School of Computer Science Chengdu University of Information Technology 24 Block 1 Xuefu Road Chengdu610225 China

ISBN: (数字)9781510687622

ISBN: (纸本)9781510687615

With the widespread application of domestic commercial cryptographic algorithms and the advancement of commercial cryptographic application evaluation, the compliance of these algorithms has garnered significant attention. Various security agencies and research institutions in China have initiated studies on the identification of commercial block cipher algorithms and have explored their application in cryptographic evaluation work. This paper focuses on extracting features from ciphertext using the NIST randomness test method, followed by training and testing these features through various machine learning and deep learning methods. The paper consolidates relevant domestic research on this topic. In the final part of the study, encrypted data from the COCO2014 dataset using the domestic commercial cryptographic algorithm SM4 and the AES128 (CBC, ECB) algorithms are used for algorithm identification, employing MLP, CNN, LSTM, and Attention mechanisms. The experimental results demonstrate that CNN exhibits higher accuracy and stability compared to existing solutions, while the Attention mechanism shows advantages in subsequent AES128-ECB identification, albeit with highly sensitive to variations in the key-dimension selection. © 2025 SPIE.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

AESHA3: Efficient and Secure Sub-Key Generation for AES Using SHA-3 14th

AESHA3: Efficient and Secure Sub-Key Generation for AES Us...

引用

14th EAI International Conference on Broadband Communications, Networks, and Systems, BROADNETS 2024

作者： Soni, Ankush Sahay, Sanjay K. Mehta, Parit Department of Computer Science and Information Systems BITS Pilani K. K. Birla Goa Campus Zuarinagar India

ISBN: (纸本)9783031811678

Advanced encryption Standard (AES) is one of the most widely used symmetric cipher for the confidentiality of data. Also it is used for other security services, viz. integrity, authentication and key establishment. However, recently, authors have shown some weakness in the generation of sub-keys in AES, e.g. bit leakage attack, etc. Also, AES sub-keys are generated sequentially, which is an overhead, especially for resource-constrained devices. Therefore, we propose and investigate a novel encryption AESHA3, which uses sub-keys generated by Secure Hash Algorithm-3 (SHA3). The output of SHA3 is one-way and highly non-linear, and random. The experimental analysis shows that the average time taken for generating the sub-keys to be used for encrypting the data using our approach i.e. AESHA3 is ∼1300 times faster than the sub-key generated by the standard AES. Accordingly, we find that AESHA3 will be very relevant not only in terms of security but also it will save the resources in IoT devices. We investigated AESHA3 in Intel Core i7, 6th Generation processor and Raspberry Pi 4B and found that up to two MB data encryption is very significant, and lesser the data size, more the resource saving compared to AES. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Bit-Security Preserving Hardness Amplification 22nd

Bit-Security Preserving Hardness Amplification

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Watanabe, Shun Yasunaga, Kenji Tokyo University of Agriculture and Technology Tokyo Japan Institute of Science Tokyo Tokyo Japan

ISBN: (纸本)9783031780165

Hardness amplification is one of the important reduction techniques in cryptography, and it has been extensively studied in the literature. The standard XOR lemma known in the literature evaluates the hardness in terms of the probability of correct prediction;the hardness is amplified from mildly hard (close to 1) to very hard 1/2+Ε by inducing Ε2 multiplicative decrease of the circuit size. Translating such a statement in terms of the bit-security framework introduced by Micciancio-Walter (EUROCRYPT 2018) and Watanabe-Yasunaga (ASIACRYPT 2021), it may cause a bit-security loss of log(1/Ε). To resolve this issue, we derive a new variant of the XOR lemma in terms of the Rényi advantage, which directly characterizes the bit security. In the course of proving this result, we prove a new variant of the hardcore lemma in terms of the conditional squared advantage;our proof uses a boosting algorithm that may output the ⊥ symbol in addition to 0 and 1, which may be of independent interest. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Bit Security: Optimal Adversaries, Equivalence Results, and a Toolbox for Computational-Statistical Security Analysis 22nd

Bit Security: Optimal Adversaries, Equivalence Results, and...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Micciancio, Daniele Schultz-Wu, Mark University of California San Diego United States

ISBN: (纸本)9783031780165

We investigate the notion of bit-security for decisional cryptographic properties, as originally proposed in (Micciancio & Walter, Eurocrypt 2018), and its main variants and extensions, with the goal clarifying the relation between different definitions, and facilitating their use. Specific contributions of this paper include: (1) identifying the optimal adversaries achieving the highest possible MW advantage, showing that they are deterministic and have a very simple threshold structure;(2) giving a simple proof that a competing definition proposed by (Watanabe & Yasunaga, Asiacrypt 2021) is actually equivalent to the original MW definition;and (3) developing tools for the use of the extended notion of computational-statistical bit-security introduced in (Li, Micciancio, Schultz & Sorrell, Crypto 2022), showing that it fully supports common cryptographic proof techniques like hybrid arguments and probability replacement theorems. On the technical side, our results are obtained by introducing a new notion of "fuzzy" distinguisher (which we prove equivalent to the "aborting" distinguishers of Micciancio and Walter), and a tight connection between the MW advantage and the Le Cam metric, a standard quantity used in statistics. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Detection of Unknown Darknet Traffic with Random Forest 16th

Detection of Unknown Darknet Traffic with Random Forest

引用

16th International Conference on Genetic and Evolutionary Computing, ICGEC 2024

作者： Lee, Dong-Yu Nguyen, Thanh-Lam Shieh, Chin-Shiuh Horng, Mong-Fong Tsai, Casper Miu, Denis National Kaohsiung University of Science and Technology Kaohsiung Taiwan Auray Technology Corp. Taoyuan Taiwan Genie Networks Ltd. Taipei Taiwan

ISBN: (纸本)9789819615308

Darknet refers to an overlay network that requires the use of special software to access. Tor (The Onion Router) is one of the software used to access the darknet. Tor uses unique routing methods and encryption algorithms to hide users’ IP addresses and encrypt traffic to protect users’ privacy. However, some criminals use Tor's anonymity to conduct criminal activities. According to a survey report by network security service provider CloudFlare, 94% of network traffic from Tor is classified as malicious traffic. Therefore, if darknet traffic can be identified and further analyzed, it will help to combat these illegal activities. This study uses the Random Forest algorithm to analyze darknet traffic's communication content to identify services embedded within encrypted traffic. In addition to classifying known darknet communications, it also employs the Open-Set Recognition method proposed in this study to identify service types not included in the model, thus achieving detection of unknown darknet communications. Experimental results demonstrate that the classification of known darknet services has achieved an F1-Score of 0.99. Furthermore, after incorporating samples of unknown darknet activities, an overall accuracy of 0.95 can also be attained. These findings validate the effectiveness of the study in analyzing darknet traffic, thereby assisting enterprises and organizations in implementing appropriate countermeasures. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Secure Composition of Quantum Key Distribution and Symmetric Key encryption

arXiv

引用

arXiv 2025年

作者： Dey, Kunal Safavi-Naini, Reihaneh University of Calgary AB Canada

Quantum key distribution (QKD) allows Alice and Bob to share a secret key over an insecure channel with proven information-theoretic security against an adversary whose strategy is bounded only by the laws of physics. Composability-based security proofs of QKD ensure that using the established key with a one-time-pad encryption scheme provides information theoretic secrecy for the message. In this paper, we consider the problem of using the QKD established key with a secure symmetric key-based encryption algorithm and use an approach based on hybrid encryption to provide a proof of security for the composition. Hybrid encryption was first proposed as a public key cryptographic algorithm with proven security for messages of unrestricted length. We use an extension of this framework to correlated randomness setting (Sharifian et al. in ISIT 2021) to propose a quantum-enabled Key Encapsulation Mechanism (qKEM) and quantum-enabled hybrid encryption (qHE), and prove a composition theorem for the security of the qHE. We construct a qKEM with proven security using an existing QKD (Portmann et al. in Rev. of Mod. Physics 2022). Using this qKEM with a secure Data Encapsulation Mechanism (DEM), that can be constructed using a one-time symmetric key encryption scheme, results in an efficient encryption system for unrestricted length messages with proved security against an adversary with access to efficient computations on a quantum computer (i.e. post-quantum secure encryption without using any computational assumptions.) © 2025, CC BY.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

Reducing the Share Size of Weighted Threshold Secret Sharing Schemes via Chow Parameters Approximation 22nd

Reducing the Share Size of Weighted Threshold Secret Shari...

引用

22nd Theory of Cryptography Conference, TCC 2024

作者： Farràs, Oriol Guiot, Miquel Universitat Rovira i Virgili Tarragona Spain

ISBN: (纸本)9783031780226

A secret sharing scheme is a cryptographic primitive that allows a dealer to share a secret among a set of parties, so that only authorized subsets of them can recover it. The access structure of the scheme is the family of authorized subsets. In a weighted threshold access structure, each party is assigned a weight according to its importance, and the authorized subsets are those in which the sum of their weights is at least the threshold value. For these access structures, the share size of the best known secret sharing schemes is either linear on the weights or quasipolynomial on the number of parties, which leads to long shares, in general. In certain settings, a way to circumvent this efficiency problem is to approximate the access structure by another one that admits more efficient schemes. This work is dedicated to the open problem posed by this strategy: Finding secret sharing schemes with a good tradeoff between the efficiency and the accuracy of the approximation. We present a method to approximate weighted threshold access structures by others that admit schemes with small shares. This method is based on the techniques for the approximation of the Chow parameters developed by De et al. [Journal of the ACM, 2014]. Our method provides secret sharing schemes with share size n1+o(1), where n is the number of parties, and whose access structure is close to the original one. Namely, in this approximation the condition of being authorized or not is preserved for almost all subsets of parties. In addition, we apply the recent results on computational secret sharing schemes by Applebaum et al. [STOC, 2023] to construct computational secret sharing schemes whose share size is polylogarithmic in the number of parties. © International Association for Cryptologic Research 2025.

关键词： encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：