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

IEEE EUROCON-International Conference on Computer As A Tool

作者： Lin, Chu-Hsing Yeh, Yi-Shiung Chien, Shih-Pei Lee, Chen-Yu Chien, Hung-Sheng Department of Computer Science Tunghai University Taichung Taiwan

ISBN: (纸本)9781424474868

This paper defines a generalized SHA algorithm based on the SHA family rules. The proposed algorithm accepts arbitrary length message as input to generate message digest with the required length. It contains the initial values, constant values, padding, parsing, as well as the generalized main body. Further, the proposed algorithm solves the Length-of-the-hash-Value (LHV) problem that occurs when SHA-r cannot be expressed as r mn uniquely. © 2011 IEEE.

关键词： Complexity theory Cryptography Information processing Manganese NIST SHA family rules SHA-X secure hash algorithm Standards publication arbitrary length message cryptography cryptography file organisation generalized SHA algorithm generalized secure hash algorithm length-of-the-hash-value message digest one-way hash function security standard

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT FAULT DETECTION SCHEME FOR THE secure hash algorithm SHA-512

AN EFFICIENT FAULT DETECTION SCHEME FOR THE SECURE HASH ALGO...

引用

International Conference on Green Energy and Conversion Systems (GECS)

作者： Kahri, Fatma Mestiri, Hassen Bouallegue, Belgacem Machhout, Mohsen Univ Monastir Fac Sci Monastir Elect & Microelect Lab Monastir Tunisia

ISBN: (纸本)9781509062874

To protect the implementation of the standard secure hash algorithm (SHA) against attacks. We have proposed a number of countermeasures. This paper present a proposed new fault detection scheme. It is based on the hybrid redundancy. The simulation results prove that the fault coverage achieves 99.999% for our scheme proposed. Also, our proposed detection scheme has been implemented on Xilinx Virtex-II Pro FPGA. It is fault coverage, area degradation, frequency, throughput and efficiency overhead have been compared and it is shown that the proposed scheme allows a trade-off between the security and the implementation cost of the SHA implementation.

关键词： Security Fault Attacks secure hash algorithm Hardware FPGA

来源：评论

学校读者我要写书评

暂无评论

Research of hash-based secure key expansion algorithm for practical QKD

引用

OPTIK 2013年第15期124卷 2273-2276页

作者： Wang, Jian Luo, Chun-li Lin, Sheng-zhao Zhang, Hong-fei Cui, Ke Liang, Hao Jin, Ge Zhou, Lei Chen, Teng-yun Univ Sci & Technol China Dept Modern Phys Anhui Key Lab Phys Elect State Key Lab Particle Detect & Elect Hefei 230026 Anhui Peoples R China Hefei Natl Lab Phys Sci Microscale Hefei 230026 Anhui Peoples R China

The quantum key distribution (QKD) system has been developed rapidly, but its key generation rate is limited for kinds of reason such as detector efficiency and not fitted for high speed application such as video conferences. For promotion of key generation rate, an algorithm based secure hash algorithm (SHA) is introduced to process QKD keys which could be expanded to be about tens times and implemented in field programmable gate array (FPGA) device in this paper. The expanded key is tested by NIST test program to verify its randomness and security. In our tests, the expanded keys less than 32 times QKD keys are all passed NIST test program and shows its good security. (C) 2012 Elsevier GmbH. All rights reserved.

关键词： Quantum key distribution Key expansion secure hash algorithm Field programmable gate array

来源：评论

学校读者我要写书评

暂无评论

Securing the edge: privacy-preserving federated learning for insider threats in IoT networks

引用

JOURNAL OF SUPERCOMPUTING 2025年第1期81卷 1-49页

作者： Kamatchi, K. Uma, E. Anna Univ Coll Engn Guindy Dept Informat Sci & Technol Chennai 600025 India

Insider threats in Internet of Things (IoT) networks pose significant risks, as compromised devices can misuse their privileges to cause substantial harm. Centralized methods for insider threat detection in IoT devices are critical for identifying and mitigating insider risks. User behavior, such as access patterns, login times and data transmission, is profiled using machine learning algorithms to detect deviations that may indicate insider risks. However, training a model that generalizes across different data sources is challenging due to data heterogeneity, which can lead to a drift in performance. This paper introduces a decentralized approach called federated learning (FL) to address these challenges. An advanced privacy-preserving method is proposed for detecting and reducing insider threats in IoT devices. The process begins with a trust authority generating a random digital certificate using the hybrid Rivest-Shamir-Adleman and elliptic curve digital signature algorithm for IoT user registration. Node clustering is performed using the ordering points to identify the clustering structure with centroid refinement algorithm, ensuring data privacy by transmitting only cluster heads to local models. Additionally, the federated automatic weight optimization hash-based message authentication code with secure hash algorithm is introduced to further strengthen protection. The experimental results show accuracy rates of 98.85% on the simulated dataset and 83.74% on the X-IIoTID test dataset. These finding facilitates the effectiveness of the proposed solution in terms of accuracy, time, throughput, node scalability and overall performance. The results indicate that the proposed model outperforms other prominent approaches in the field.

关键词： Federated learning Rivest-Shamir-Adleman Elliptic curve digital signature algorithm Ordering points to identify the clustering structure (OPTICS) Federated automatic weight optimization hash-based message authentication code secure hash algorithm Insider threat detection

来源：评论

学校读者我要写书评

暂无评论

Modified Elliptic Curve Cryptography Multi-Signature Scheme to Enhance Security in Cryptocurrency

引用

Computer Systems Science & Engineering 2023年第4期45卷 641-658页

作者： G.Uganya Radhika Baskar Department of Electronics and Communication Engineering Saveetha School of EngineeringSIMATSChennaiTamil NaduIndia

Internet of Things(IoT)is an emerging technology that moves the world in the direction of smart ***,IoT security is the complex problem due to its centralized architecture,and limited ***,blockchain technology has great attention due to its features of decentralized architecture,transparency,immutable records and cryptography hash functions when combining with *** hash algorithms are very important in blockchain technology for secure *** converts the variable size inputs to a fixed size hash output which is *** cryptography hash algorithms with digital signature have issues of single node accessibility and accessed up to 128 bytes of key size *** well as,if the attacker tries to hack the key,it cancels the *** paper presents the Modified Elliptic Curve Cryptography Multi Signature Scheme(MECC-MSS)for multiple node accessibility by finding nearest path for secure *** this work,the input key size can be extended up to 512 bytes to enhance the *** performance of the proposed algorithm is analyzed with other cryptography hash algorithms like secure hashing algorithms(SHAs)such as SHA224,SHA256,SHA384,SHA512,SHA3-224,SHA3-256,SHA3-384,SHA3-512 and Message Digest5 by one-way analysis of variance test in terms of accuracy and time *** show that the MECC-MSS achieves 90.85%of accuracy and time complexity of 1.4 nano seconds with significance less than *** the statistical analysis,it is observed that the proposed algorithm is significantly better than other cryptography hash algorithms and also having less time complexity.

关键词： Internet of things blockchain technology secure hash algorithm accuracy time complexity

来源：评论

学校读者我要写书评

暂无评论

Implementation of high-speed SHA-1 architecture

引用

IEICE ELECTRONICS EXPRESS 2009年第16期6卷 1174-1179页

作者： Lee, Eun-Hee Lee, Je-Hoon Park, Il-Hwan Cho, Kyoung-Rok Chungbuk Natl Univ Chungbuk Informat Tech Ctr BK21 Cheongju 361763 South Korea Natl Secur Res Inst Taejon South Korea

This paper proposes a new SHA-1 architecture to exploit higher parallelism and to shorten the critical path for hash operations. It enhances a performance without significant area penalty. We implemented the proposed SHA-1 architecture on FPGA that showed the maximum clock frequency of 118 MHz allows a data throughput rate of 5.9 Gbps. The throughput is about 26% higher, compared to other counterparts. It supports cryptography of high-speed multimedia data.

关键词： cryptography secure hash algorithm hardware design

来源：评论

学校读者我要写书评

暂无评论

Revised elliptic curve cryptography multi-signature scheme (RECC-MSS) for enhancing security in electronic health record (EHR) system

引用

JOURNAL OF INTELLIGENT & FUZZY SYSTEMS 2023年第6期45卷 11993-12012页

作者： Uganya, G. Bommi, R. M. Krishnammal, P. Muthu Vijayaraj, N. Vel Tech Rangarajan Dr Sagunthal R&D Inst Sci & T Dept Elect & Commun Engn Chennai Tamil Nadu India Chennai Inst Technol Dept Elect & Commun Engn Chennai Tamil Nadu India VIT AP Univ Sch Elect Engn Amaravati Andhra Pradesh India Vel Tech Rangarajan Dr Sagunthal R&D Inst Sci & T Dept Comp Sci & Engn Chennai Tamil Nadu India

Internet of things (IoT) is a recent developing technology in the field of smart healthcare. But it is difficult to transfer the patient's health record as a centralized network. So, "blockchain technology" has excellent consideration due to its unique qualities such as decentralized network, openness, irreversible data, and cryptography functions. Blockchain technology depends on cryptography hash techniques for safe transmission. For increased security, it transforms the variable size inputs into a constant length hash result. Current cryptographic hash algorithms with digital signatures are only able to access keys up to a size of 256 bytes and have concerns with single node accessibility. It just uses the bits that serve as the key to access the data. This paper proposes the "Revised Elliptic Curve Cryptography Multi-Signature Scheme" (RECC-MSS) for multinode availability to find the nearest path for secure communications with the medical image as keys. Here, the input image key can be converted into an array of data that can be extended up to 512 bytes of size. The performance of the proposed algorithm is analyzed with other cryptography hash functions like secure hashing algorithms (SHAs) such as "SHA224", "SHA256", "SHA384", "SHA512", "SHA3-224", "SHA3-256", "SHA3-384", "SHA3-512", and "Message Digest5" (MD5) by "One-way ANOVA" test in terms of "accuracy", "throughput" and "time complexity". The proposed scheme with ECC achieved the throughput of 17.07 kilobytes per 200 nano seconds, 93.25% of accuracy, 1.5 nanoseconds latency of signature generation, 1.48 nanoseconds latency of signature verification, 1.5 nanoseconds of time complexity with 128 bytes of hash signature. The RECC-MSS achieved the significance of 0.001 for accuracy and 0.002 for time complexity which are less than 0.05. From the statistical analysis, the proposed algorithm has significantly high accuracy, high throughput and less time complexity than other cryptography hash algorithms.

关键词： Internet of Things blockchain technology multi-signature secure hash algorithm Revised Elliptic Curve Cryptography medical image

来源：评论

学校读者我要写书评

暂无评论

Homogenized Chebyshev-Arnold Map and Its Application to Color Image Encryption

引用

IEEE ACCESS 2019年 7卷 114459-114471页

作者： Kang, Xuejing Luo, Xuanshu Zhang, Xuesong Jiang, Jing Beijing Univ Posts & Telecommun Sch Comp Sci Beijing 100876 Peoples R China Beijing Union Univ Dept Commun Engn Beijing 100101 Peoples R China

In this paper, we propose a homogenized Chebyshev-Arnold map (HCAM) by homogenizing the linear coupling of Chebyshev map and Arnold map. The proposed HCAM has complex dynamical behaviors and can avoid the problems of the original Chebyshev map when used in image encryption. Based on the HCAM, we present a color image encryption algorithm that contains confusion and diffusion processes. In the confusion stage, we use the random chaotic matrix transform (RCMT) to randomize the shifting steps, which can eliminate the regular pattern of the original CMT and enhance the security level. In the diffusion stage, we use a SHA-512- and SHA-384-based fast pixel substitution scheme to perform the bit-level exclusive-or operation, which can obtain outstanding self-adaptiveness and high efficiency. The experimental results and security analysis demonstrate that the proposed algorithm has high level of security and robust to the potential attacks.

关键词： Color image encryption Chebyshev map Arnold Map chaotic matrix transform secure hash algorithm

来源：评论

学校读者我要写书评

暂无评论

A Fault Detection Scheme for the FPGA Implementation of SHA-1 and SHA-512 Round Computations

引用

JOURNAL OF ELECTRONIC TESTING-THEORY AND APPLICATIONS 2011年第4期27卷 517-530页

作者： Bahramali, Mohsen Jiang, Jin Reyhani-Masoleh, Arash Univ Western Ontario Dept Elect & Comp Engn London ON Canada

The secure hash algorithm is the most popular hash function currently used in many security protocols such as SSL and IPSec. Like other cryptographic algorithms, the hardware implementation of hash functions is of great importance for high speed applications. Because of the iterative structure of hash functions, a single error in their hardware implementation could result in a large number of errors in the final hash value. In this paper, we propose a novel time-redundancy-based fault diagnostic scheme for the implementation of SHA-1 and SHA-512 round computations. This scheme can detect permanent as well as transient faults as opposed to the traditional time redundancy technique which is only capable of detecting transient errors. The proposed design does not impose significant timing overhead to the original implementation of SHA-1 and SHA-512 round computation. We have implemented the proposed design for SHA-1 and SHA-512 on Xilinx xc2p7 FPGA. It is shown that for the proposed fault detection SHA-1 and SHA-512 round computations, there are, respectively, 3% and 10% reduction in the throughput with 58% and 30% area overhead as compared to the original schemes. The fault simulation of the implementation shows that almost 100% fault coverage can be achieved using the proposed scheme for transient and permanent faults.

关键词： hash function secure hash algorithm Fault detection Time redundancy FPGA

来源：评论

学校读者我要写书评

暂无评论

Finding Near-Optimum Message Scheduling Settings for SHA-256 Variants Using Genetic algorithms

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2013年第5期29卷 889-905页

作者： Lin, Chu-Hsing Lee, Chen-Yu Kavi, Krishna M. Chen, Deng-Jyi Yeh, Yi-Shiung Tunghai Univ Dept Comp Sci Taichung 407 Taiwan Natl Chiao Tung Univ Dept Comp Sci Hsinchu 300 Taiwan Univ N Texas Dept Comp Sci & Engn Denton TX 76203 USA

One-way hash functions play an important role in modem cryptography. Matusiewicz et al. proved that the message scheduling is essential for the security of SHA-256 by showing that it is possible to find collisions with complexity 2(64) hash operations for a variant without it. In this article, we first proposed the conjecture that message scheduling of SHA algorithm has higher security complexity (or fitness value in Genetic algorithm) if each message word (W-t) involves more message blocks (M-i) in each round. We found some evidence supports the conjecture. Consider the security of SHA-0 and SHA-1. Since Chabaud and Joux shown that SHA-1 is more secure than SHA-0. Further, Wang found collisions in full SHA-0 and SHA-1 hash operations with complexities less than 2(39) and 2(69), respectively. We found it is consistent from the viewpoint of message blocks (terms) involved in each message word. It clearly shown that the number of terms involved in SHA-1 is more than that in SHA-0, taking W-27 as an example, 14 and 6, respectively. Based on the conjecture we proposed a new view of complexity for SHA-256-XOR functions, a variant of SHA-256, by counting the terms involved in each equation, instead of analyzing the probability of finding collisions within SHA-256-XOR hash function. Our experiments shown that the parameter set in each equation of message schedule is crucial to security fitness. We applied genetic algorithms to find the near-optimal message schedule parameter sets that enhance the complexity 4 times for SHA-1 and 1.5 times for SHA-256-XOR, respectively, when compared to original SHA-1 and SHA-256-XOR functions. The analysis would be interesting for designers on the security of modular-addition-free hash function which is good for hardware implementation with lower gate count. And the found message schedule parameter sets would be a good reference for further improvement of SHA functions.

关键词： genetic algorithms cryptography secure hash algorithm message scheduling optimisation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：