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

International Conference on Informatics and Creative Multimedia (ICICM)

作者： Alkandari, Abdulaziz Ali Al-Shaikhli, Imad Fakhri Alahmad, Mohammad A. PAAET Coll Basic Educ Dept Comp Aladailya Kuwait Int Islamic Univ Malaysia Dept Comp Sci Kuala Lumpur 53100 Malaysia

ISBN: (纸本)9780769551333

cryptographic hash function verifies data integrity and sender identity or source of information. The task is accomplished by taking a variable bit patterns as an input then produces a fixed bit patterns of output. This paper provides a detailed overview to include classification, properties, constructions, attacks, applications and an overview of a selected dedicated cryptographic hash function.

关键词： cryptographic hash function construction attack classification SHA-1 SHA-2 SHA-3

来源：评论

学校读者我要写书评

暂无评论

Finding Bugs in cryptographic hash function Implementations

引用

IEEE TRANSACTIONS ON RELIABILITY 2018年第3期67卷 870-884页

作者： Mouha, Nicky Raunak, Mohammad S. Kuhn, D. Richard Kacker, Raghu NIST Informat Technol Lab Comp Secur Div Gaithersburg MD 20899 USA NIST Comp Secur Div Gaithersburg MD 20899 USA Loyola Univ Maryland Dept Comp Sci Baltimore MD 21210 USA

cryptographic hash functions are security-critical algorithms with many practical applications, notably in digital signatures. Developing an approach to test them can be particularly difficult, and bugs can remain unnoticed for many years. We revisit the National Institute of Standards and Technology hash function competition, which was used to develop the SHA-3 standard, and apply a new testing strategy to all available reference implementations. Motivated by the cryptographic properties that a hash function should satisfy, we develop four tests. The Bit-Contribution Test checks if changes in the message affect the hash value, and the Bit-Exclusion Test checks that changes beyond the last message bit leave the hash value unchanged. We develop the Update Test to verify that messages are processed correctly in chunks, and then use combinatorial testing methods to reduce the test set size by several orders of magnitude while retaining the same fault-detection capability. Our tests detect bugs in 41 of the 86 reference implementations submitted to the SHA-3 competition, including the rediscovery of a bug in all submitted implementations of the SHA-3 finalist BLAKE. This bug remained undiscovered for seven years, and is particularly serious because it provides a simple strategy to modify the message without changing the hash value returned by the implementation. We detect these bugs using a fully automated testing approach.

关键词： Combinatorial testing cryptographic algorithm cryptographic hash function metamorphic testing SHA-3 competition

来源：评论

学校读者我要写书评

暂无评论

A secure and efficient cryptographic hash function based on NewFORK-256

引用

EGYPTIAN INFORMATICS JOURNAL 2012年第3期13卷 199-208页

作者： Tiwari, Harshvardhan Asawa, Krishna JIIT Deemed Univ Dept Comp Sci & Engn Noida UP India

cryptographic hash functions serve as a fundamental building block of information security and are used in numerous security applications and protocols such as digital signature schemes, construction of MAC and random number generation, for ensuring data integrity and data origin authentication. Researchers have noticed serious security flaws and vulnerabilities in most widely used MD and SHA family hash functions. As a result hash functions from FORK family with longer digest value were considered as good alternatives for MD5 and SHA-1, but recent attacks against these hash functions have highlighted their weaknesses. In this paper we propose a dedicated hash function MNF-256 based on the design principle of NewFORK-256. It takes 512 bit message blocks and generates 256 bit hash value. A random sequence is added as an additional input to the compression function of MNF-256. Three branch parallel structure and secure compression function make MNF-256 an efficient, fast and secure hash function. Various simulation results indicate that MNF-256 is immune to common cryptanalytic attacks and faster than NewFORK- 256. (C) 2012 Faculty of Computers and Information, Cairo University. Production and hosting by Elsevier B.V. All rights reserved.

关键词： cryptographic hash function Digital signature MD5 SHA-1 NewFORK-256

来源：评论

学校读者我要写书评

暂无评论

Modeling Spline Curves for Lightweight cryptographic hash function

Modeling Spline Curves for Lightweight Cryptographic Hash Fu...

引用

2023 IEEE Global Conference on Information Technologies and Communications, GCITC 2023

作者： Agarwal, Shalini Amity University Amity School of Engineering and Technology Lucknow India

ISBN: (纸本)9798350308167

Parametric spline curves offer flexibility, smoothness and ability to represent complex shapes in various fields of Computer Graphics and other related fields. These mathematical curves are popularly used for interpolation or approximation purposes only. This paper claims that parametric spline curve representation can be modelled to be used for cryptographic operations or hash function protocols as it satisfies all four desirable properties of a hash function. Traditional hash function algorithms rely on the mathematical properties of certain groups, such as prime fields or elliptic curves, to securely exchange keys between parties. They are difficult to implement and require high computational power. In contrast parametric spline curve-based hash functions are easy to implement and the level of security offered by them can be scaled up or down by manipulating curve parameters. © 2023 IEEE.

关键词： Computer Graphics cryptographic hash function Elliptic Curve Cryptography Security Spline Curve

来源：评论

学校读者我要写书评

暂无评论

Parallelizing cryptographic hash function Using Relaxed Encryption Framework*

引用

Chinese Journal of Electronics 2023年第4期20卷 621-624页

作者： GAN Xinbiao WANG Zhiying SHEN Li LIU Cong LAI Xin School of Computer National University of Defense Technology Changsha China

With embarrass of high complexity of cryptographic hash function (CHF) and difficulty of parallelizing CHF, a relaxed encryption framework for parallelizing CHF is proposed after understanding principle of hash value generation for CHF. In relaxed encryption framework, dependences in chain mode for generating hash value are broken so that it is possible to parallelize CHF fully, and the strength of encryption for relaxed framework is same as or stronger than that of standard CHF. Furthermore, a performance analytical model is presented to validate proposed framework.

关键词： Analytical models cryptographic hash function Encryption Complexity theory Standards

来源：评论

学校读者我要写书评

暂无评论

cryptographic and parallel hash function based on cross coupled map lattices suitable for multimedia communication security

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2019年第13期78卷 17973-17994页

作者： Li, Yantao Ge, Guangfu Chongqing Univ Coll Comp Sci Chongqing 400044 Peoples R China Southwest Univ Coll Comp & Informat Sci Chongqing 400715 Peoples R China

cryptographic hash functions can map data of arbitrary size to data of fixed size (hash values), which can be used in a wide range of multimedia applications for communication security, such as integrity protection, message authentication and digital signature. In this paper, we present a cryptographic and parallel chaotic hash function based on the cross coupled map lattices for multimedia communication security. More specifically, we first utilize the piecewise linear chaotic map with secret keys to generate initial parameter sequence for the cross coupled map lattices and an initial hash value. Then, we extend the original message into a message matrix to enhance the correlation of message characters. Next, we process each of the message blocks in the matrix in parallel as the space domain input of the cross coupled map lattices and the initial parameters as the time domain input to generate intermediate hash values. After all message blocks are processed in parallel, the final h-bit hash value is obtained by logical operations with the initial and intermediate hash values. Finally, we evaluate the performance of the proposed hash function in terms of uniform distribution of hash values, sensitivity of the hash value to subtle changes of the original message, secret keys, and images, confusion and diffusion properties, collision tests, efficiency of computation speed. The cryptanalytic results demonstrate that the proposed hash algorithm has statistical properties with B=64.0022 and P =50.0017%, collision resistance with d =85.3944, average computation speed of 132.0 Mbps, and better statistical performance compared with existing chaotic hash functions, which are suitable for multimedia communication security.

关键词： Multimedia communication security Chaos cryptographic hash function Cross coupled map lattices

来源：评论

学校读者我要写书评

暂无评论

An Approach to Secure Capacity Optimization in Cloud Computing using cryptographic hash function and Data De-duplication

An Approach to Secure Capacity Optimization in Cloud Computi...

引用

International Conference on Intelligent Sustainable Systems (ICISS)

作者： Magesh Kumar S Balasundaram A Kothandaraman D Auxilia Osvin Nancy V P. J. Sathish Kumar Ashokkumar S Saveetha School of Engineering SIMATS Chennai Tamil Nadu India School of Computer Science and Engineering Centre for Cyber Physical Systems Vellore Institute of Technology (VIT) Chennai India School of Computer Science and Artificial Intelligence SR University Warangal TS India S.A. Engineering College Chennai India Panimalar Engineering College Chennai India

ISBN: (数字)9781728170893

ISBN: (纸本)9781728170909

Capacity Optimization in Cloud computing is a common term for innovations used to progress storage use by dwindling stored data. Crucial methodologies used for capacity optimization in cloud computing are data compression and data deduplication. Our paper focuses Capacity Optimization in connection with Deduplication procedures, which stare for redundancy in series of bytes across comparison windows by using cryptographic hash functions as identifiers of unique sequences, then the sequences are matched to the history of other such sequences, and when possible, the first uniquely stored version of a sequence is referenced rather than stored again. Our work shows better results for capacity optimization, which are most frequently found in backup/recovery storage, where storage of iterating versions of backups day to day creates a chance for lessening of space in cloud computing. Hence this study has recognized exploration hole as vast number of capacity of copy records on cloud frameworks from various clients. Consequently, to diminish the amount of work brought about by copied documents, SHA3 calculation has been proposed in this study, which makes the hash esteem for each record and discover the information intelligent compression for capacity streamlining on cloud framework. Our Work also includes Authentication, which is based on cryptographic hash function and Secure Data Deduplication allows cloud storage and optimization of storage to employ data with concealment.

关键词： Cloud computing Optimization cryptographic hash function Cryptography Fingerprint recognition Conferences Capacity planning

来源：评论

学校读者我要写书评

暂无评论

EFFICIENT AUTHENTICATION PROTOCOL USING cryptographic hash function & LSB DYNAMIC HOP IMAGE STEGANOGRAPHIC TECHNIQUE FOR SECURE COMMUNICATION

EFFICIENT AUTHENTICATION PROTOCOL USING CRYPTOGRAPHIC HASH F...

引用

International Conference on Recent Trends in Engineering, Science & Technology

作者： B. Madhuravani D. S. R. Murthy Department of CSE MLR Institute of Technology Department of CSE Geethanjali College of Engineering & Technology

ISBN: (纸本)9781785617850;9781785617867

A novel new verification convention utilizing a cryptographic hash function and a Steganography using a hop variable is displayed in this paper. This convention chooses a cryptographic hash work progressively and creates message digest. As opposed to LSB Steganography, we utilize a hop variable LSB steganography to implant private information into a stego object. This convention sets up a safe correspondence channel between two gatherings and trades information safely over the web.

关键词： Steganography cryptographic hash function Hop variable LSB Diffie-Hellman Steganography cryptographic hash function Humulus Communication system security Convention protocols

来源：评论

学校读者我要写书评

暂无评论

E-Voting and e-Recap Verification and Validation Schemes for Indonesia Utilizing cryptographic hash function Message Authentication Codes (MAC) and Public Key Infrastructure (PKI)

E-Voting and e-Recap Verification and Validation Schemes for...

引用

International Conference on Informatics, Multimedia, Cyber and Information System (ICIMCIS)

作者： Alfonso Brolin Sihite Muhammad Salman University of Indonesia Depok Indonesia

ISBN: (纸本)9781728129310

Conventional elections have many shortcomings, some of them are the calculation of a real count that takes a long time, the big costs of printing ballot papers and distribution costs both from the center to the regions and vice versa, the possibility of ballot paper shortages during the election, the possibility of fraud occurs because one person votes more than once, et cetera. Seeing this, the use of e-voting technology in the general election process is believed to be able to make the election effective and efficient. This paper aims to propose an e-voting verification and validation scheme that can solve these problems that might occur in conventional elections and still fulfill the election principles of Indonesia, namely Direct, General, Free, Confidential, Honest, and Fair. The e-voting system is equipped with an e-recap system which has a function for ballot verification so that all of the people can see, examine, and control the results of this e-voting system. This e-voting and e-recap scheme utilizes the application of cryptographic hash function Message Authentication Codes (MAC) and Public Key Infrastructure (PKI) with the aim is in the recapitulation results, there is not listed who the voters are and the votes given so that they still fulfill the confidential principles in elections, but all votes can be collected and verified. The voters themselves can check the vote that has been given, so that there is no vote modification when entering the e-recap system. Thus, the election can be transparent, accountable, and can be examined by the public. It is expected that with this verification and validation scheme on e-voting and e-recap, conventional elections can be replaced with an e-voting system, but still fulfill the election principles of Indonesia, such as Direct, General, Free, Confidential, Honest, and Fair. In addition, the election can still be transparent, accountable, and can be examined by the public.

关键词： fraud government data processing message authentication public administration public key cryptography Electronic voting public key cryptography message authentication vandalism Fraud Government data processing Civil service MAXIMUM ACCEPTABLE CONTAMINATION Media Access Protocol Vote cryptographic hash function V&V Indonesia forgery

来源：评论

学校读者我要写书评

暂无评论

A heuristic subexponential algorithm to find paths in Markoff graphs over finite fields

引用

RESEARCH IN NUMBER THEORY 2025年第1期11卷 1-24页

作者： Silverman, Joseph H. Brown Univ Math Dept Box 1917 Providence RI 02912 USA

Charles et al (J Cryptol 22(1):93-113, 2009) explained how one can construct hash functions using expander graphs in which it is hard to find paths between specified vertices. The set of solutions to the classical Markoff equation X2+Y2+Z2=3XYZ\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$X<^>2+Y<^>2+Z<^>2=3XYZ$$\end{document} in a finite field Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_q$$\end{document} has a natural structure as a tri-partite graph using three non-commuting polynomial automorphisms to connect the points. These graphs conjecturally form an expander family, and Fuchs et al (Math Cryptol 1(1):103-121, 2022) suggested using this family of Markoff graphs in the CGL construction. In this note we show that in both a theoretical and a practical sense, assuming two randomness hypotheses, one can compute paths in a Markoff graph over Fq\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbb {F}_q$$\end{document} by factoring q-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$q-1$$\end{document} and solving three discrete logarithm problems in Fq & lowast;\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{up

关键词： cryptographic hash function Markoff equation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：