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

Weak fault detection based on amplification-compression function and sparse spike deconvolution

JOURNAL OF LOW FREQUENCY NOISE VIBRATION AND ACTIVE CONTROL 2024年第1期43卷 272-288页

作者： Zhang, Shuai Hou, Yue Li, Yanfei Liu, Shuyong Li, Jing Naval Univ Engn Power Engn Coll Wuhan Hubei Peoples R China Naval Univ Engn Jiefang Rd 717 Wuhan 430033 Hubei Peoples R China

Weak fault detection is still a hotspot in these years. The key of this work is to enhance the ratio of signal to noise (SNR). Then a new extraction method of weak fault impact based on amplification algorithm is proposed. Since the fault impact is related to bigger derivative, the amplification function combined with the derivative of the vibration signal is used to amplify the amplitude of the impact. Then Sparse Spike Deconvolution (SSD) which has been widely used in earthquake for impact detection is able to extract small impact from the signal processed by amplification function. Then, in order to enhance the periodicity of fault impacts, the compression function is used to compress the amplitude of bigger impacts according to different scales. At last, the experiment result shows that the proposed method is more effective than the common envelope analysis.

关键词： Weak fault impact derivative compression function

来源：评论

学校读者我要写书评

暂无评论

Construction and Analysis of SHA-256 compression function Based on Chaos S-Box

引用

IEEE ACCESS 2021年 9卷 61768-61777页

作者： Wang, Juan Liu, Ge Chen, Yongqi Wang, Shu Harbin Engn Univ Coll Informat & Commun Engn Harbin 150001 Peoples R China Heilongjiang Univ Sci & Technol Coll Elect & Informat Engn Harbin 150027 Peoples R China Harbin Engn Univ Natl Sci Pk Harbin 150001 Peoples R China State Grid Anshan Elect Power Supply Co Anshan 114000 Peoples R China

To further improve the security of SHA-256, a compression function construction scheme based on chaotic S-box is proposed. Through the reasonable design of the iteration mode and using the nonlinearity, confusion, and anti-difference of chaotic S-box, the relationship between the plaintext and the hash value becomes more complicated and unpredictable, by the diffusion of the linear transformation P-box, the dependence between the plaintext and the hash value is further improved. The compression function is applied to the SHA-256 Hash Algorithm to test and analyze the distribution, sensitivity, confusion, diffusion, and collision resistance, and compared with the original SHA-256 and the mainstream Hash Algorithms. The results show that the proposed scheme can effectively improve the collision resistance of the SHA-256 Hash Algorithm and enhance the stability of confusion and diffusion with fewer cryptographic components and lower operational consumption to provide more reliable security guarantee for its application.

关键词： Security Cryptography Resistance Chaotic communication Sensitivity NIST Two dimensional displays Hash function compression function chaotic S-box P-box

来源：评论

学校读者我要写书评

暂无评论

The PRF Security of compression-function-Based MAC functions in the Multi-User Setting

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2019年第1期E102A卷 270-277页

作者： Hirose, Shoichi Univ Fukui Fac Engn Fukui 9108507 Japan

A compression-function-based MAC function called FMAC was presented as well as a vector-input PRF called vFMAC in 2016. They were proven to be secure PRFs on the assumption that their compression function is a secure PRF against related-key attacks with respect to their non-cryptographic permutations in the single user setting. In this paper, it is shown that both FMAC and vFMAC are also secure PRFs in the multi-user setting on the same assumption as in the single user setting. These results imply that their security in the multi-user setting does not degrade with the number of the users and is as good as in the single user setting.

关键词： compression function MAC pseudorandom function multi-user security vector-input PRF

来源：评论

学校读者我要写书评

暂无评论

A Tweak for a PRF Mode of a compression function and Its Applications 1

引用

9th International Conference on Security for Information Technology and Communications (SECITC)

作者： Hirose, Shoichi Yabumoto, Atsushi Univ Fukui Fac Engn Fukui Japan Univ Fukui Grad Sch Engn Fukui Japan

ISBN: (数字)9783319472386

ISBN: (纸本)9783319472386;9783319472379

We discuss a tweak for the domain extension called Merkle-Damgard with Permutation (MDP), which was presented at ASI-ACRYPT 2007. We first show that MDP may produce multiple independent pseudorandom functions (PRFs) using a single secret key and multiple permutations if the underlying compression function is a PRF against related key attacks with respect to the permutations. Using this result, we then construct a hash-function-based MAC function, which we call FMAC, using a compression function as its underlying primitive. We also present a scheme to extend FMAC so as to take as input a vector of strings.

关键词： compression function MAC Provable security Pseudorandom function Vector-input PRF

来源：评论

学校读者我要写书评

暂无评论

Quantum Collision Resistance of Double-Block-Length Hashing

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2024年第9期E107A卷 1478-1487页

作者： Hirose, Shoichi Kuwakado, Hidenori Univ Fukui Fac Engn Fukui 9108507 Japan Kansai Univ Fac Informat Takatsuki 5691095 Japan

In 2005, Nandi introduced a class of double-block-length compression functions h pi(x) pi ( x ) := = ( h ( x ) , h("(x))), ( " ( x ))) , where h is a random oracle with an n-bit output and " is a non-cryptographic public permutation. Nandi demonstrated that the collision resistance of h pi is optimal if " has no fixed point in the classical setting. Our study explores the collision resistance of h pi and the Merkle-Damg & aring;rd hash function using h pi in the quantum random oracle model. Firstly, we reveal that the quantum collision resistance of h pi may not be optimal even if " has no fixed point. If " is an involution, then a colliding pair of inputs can be found for h pi with only O(2n/2) ( 2 n / 2 ) queries by the Grover search. Secondly, we present a sufficient condition on " for the optimal quantum collision resistance of h pi. pi . This condition states that any collision attack needs Q ( 2 2n / 3 ) queries to find a colliding pair of inputs. The proof uses the recent technique of Zhandry's compressed oracle. Thirdly, we show that the quantum collision resistance of the Merkle-Damg & aring;rd hash function using h pi can be optimal even if " is an involution. Finally, we discuss the quantum collision resistance of double-block-length compression functions using a block cipher.

关键词： hash function compression function Grover's search Zhandry's compressed oracle

来源：评论

学校读者我要写书评

暂无评论

Novel cryptographic hash function based on multiple compressive parallel structures

引用

SOFT COMPUTING 2022年第24期26卷 13233-13248页

作者： Yang, Yijun Tian, Xi Pei, Pei He, Xianhong Zhang, Xiayan Shenzhen Polytech Sch Artificial Intelligence Shenzhen 518060 Guangdong Peoples R China Shenzhen Univ Coll Comp & Software Engn Shenzhen 518060 Guangdong Peoples R China

As a fundamental cryptographic primitive, hash function is used in various cryptographic applications, such as cloud storage, digital signature, block chain and random number generation. Although hash function has made great achievements in recent years, most of the existing schemes are designed by serial architectures which suffer from huge time consumption. From an efficiency perspective, this paper discusses different forms of optimality that can be constructed by designing parallel structure in hash scheme. Moreover, without affecting the optimal efficiency, in order to accelerate message diffusion and avalanche effect, the corresponding iterative structure and compressive function are slightly optimized. The simulation results show the proposed hash scheme has great performance on both efficiency and security, comparing to other benchmark parallel hash functions, the proposed structure is increased 15% in efficiency, which can be used in substitution of classic hash functions.

关键词： Hash function Parallel structure compression function Collision-resistance Avalanche effect

来源：评论

学校读者我要写书评

暂无评论

Preimage Awareness in Linicrypt 36

Preimage Awareness in Linicrypt

引用

IEEE 36th Computer Security Foundations Symposium (CSF)

作者： Javar, Zahra Kapron, Bruce M. Univ Victoria Dept Comp Sci Victoria BC Canada

ISBN: (纸本)9798350321920

We extend the analysis of collision-resistant hash functions in the Linicrypt model presented by McQuoid, Swope & Rosulek (TCC 2019) in order to characterize preimage awareness, a security property defined by Dodis, Ristenpart & Shrimpton (Eurocrypt 2009), who also demonstrate its utility in the construction of indifferentiable hash functions. We present a simple and efficiently-checkable property of Linicrypt programs which characterizes preimage awareness. Finally, we show that this characterization may be efficiently automated and as an example, use it to enumerate all preimage-aware compression functions which use two calls to the random oracle. This includes several functions shown to be preimage aware by Dodis et. al. using hand-crafted proofs.

关键词： hash function compression function preimage awareness Linicrypt indifferentiability

来源：评论

学校读者我要写书评

暂无评论

A secure hash function based on feedback iterative structure

引用

ENTERPRISE INFORMATION SYSTEMS 2019年第3期13卷 281-302页

作者： Yang, Yijun Chen, Fei Chen, Jianyong Zhang, Yong Yung, Kai Leung Shenzhen Univ Coll Comp & Software Engn Shenzhen Guangdong Peoples R China Shenzhen Univ Coll Optoelect Engn Minist Educ & Guangdong Prov Key Lab Optoelect Devices & Syst Shenzhen Guangdong Peoples R China Shenzhen Polytech Coll Comp & Software Engn Shenzhen Guangdong Peoples R China Shenzhen Univ ATR Key Lab Natl Def Technol Shenzhen 518060 Guangdong Peoples R China Hong Kong Polytech Univ Dept Ind & Syst Engn Hong Kong Peoples R China

Rapid growth of internet data has created enormous security challenges on authenticity, availability and integrity protection of these outsourced data. Hash function is one of the main solutions to face these challenges. This paper proposes a feedback iterative structure of hash function which utilises the variable feedback to resist attacks. Furthermore, to accelerate message diffusion, two novel modules are designed, one for iteration and the other for truncation. Experimental results show that the proposed hash function can effectively resist existing attacks. Moreover, comparing with other existing hash functions, it displays better on statistical performance, collision resistance and avalanche.

关键词： Hash function feedback iterative structure compression function collision resistance avalanche

来源：评论

学校读者我要写书评

暂无评论

compression function DESIGN OF SECURE HASH ALGORITHM BASED ON BLOCK CIPHER

COMPRESSION FUNCTION DESIGN OF SECURE HASH ALGORITHM BASED O...

引用

IET International Conference on Information Science and Control Engineering

作者： Jia Yu Bo Ren The School of Computer Science Northwestern Polytechnical University The Department of Computer Science Luoyang Institute of Science and Techonology

ISBN: (纸本)9781629939254

The basic criteria of a secure hash algorithm were analyzed for resisting the brute-force and cryptanalysis attacks. The finite field operations and the structures of the strong symmetric block cipher were studied. The applications for compression function in secure hash algorithm were also explored and a secure hash algorithm based on it was designed. According to the structure of strong symmetric block cipher, the irreversible iterated compression function based on the operations of finite fields and bit was designed, and the hash value of 256 bits was used in the algorithm.

关键词： Secure hash function compression function Symmetric block cipher Finite fields

来源：评论

学校读者我要写书评

暂无评论

Provably Secure Authenticated Encryption

Provably Secure Authenticated Encryption

引用

作者： Damian VIZAR ECOLE POLYTECHNIQUE FEDERALE DE LAUSANNE

学位级别：博士

Authenticated Encryption (AE) is a symmetric key cryptographic primitive that ensures confidentiality and authenticity of processed messages at the same time. The research of AE as a primitive in its own right started in 2000. The security goals of AE (such as NAE, MRAE, OAE, RAE or the RUP) were captured in formal definitions in the tradition provable security, where the security of a scheme is formally proven assuming the security of an underlying building block. The prevailing syntax moved to nonce-based AE with associated data (which is an additional input that gets authenticated, but not encrypted). Other types of AE schemes appeared as well, e. g. ones that supported stateful sessions. Numerous AE schemes were designed; in the early years, these were almost exclusively blockcipher modes of operation, most notably OCB in 2001, CCM in 2003 and GCM in 2004. At the same time, issues were discovered both with the security and applicability of the most popular AE schemes, and other applications of symmetric key cryptography. As a response, the Competition for Authenticated Encryption: Security, Applicability, and Robustness (CAESAR) was started in 2013. Its goals were to identify a portfolio of new, secure and reliable AE schemes that would satisfy the needs of practical applic- ations, and also to boost the research in the area of AE. Prompted by CAESAR, 57 new schemes were designed, new types of constructions that gained popularity appeared (such as the Sponge-based AE schemes), and new notions of security were proposed (such as RAE). The final portfolio of the CAESAR competition should be announced in 2018. In this thesis, we push the state of the art in the field of AE in several directions. All of them are related to provable security in one way or another. We propose OMD, the first provably secure dedicated AE scheme that is based on a compression function. We further modify OMD to achieve nonce misuse-resistant security (MRAE). We also propose another provabl

关键词： Authenticated Encryption Provable Security Misuse Resistance CAE-SAR competition compression function Sponge Construction Full-state Absorption Online Authenticated Encryption Variable Tag Length Cryptanalysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：