It is well known that threats and attacks to information on the digital network environment are growing rapidly, putting extra pressure on individuals and businesses to protect their privacy and intellectual property. For this reason, many cryptographic security protocols have been developed over the past decades in an attempt to protect the privacy between communicating parties and to reduce the risk of malicious attacks. However, most of the cryptographic algorithms developed so far are based on mathematical models and suffer from many security defects, such as: a brute force attack, factorization problem, and many others. Thus, most of these proposed cryptographic systems are not proven to be completely secure against the main threats of modern networking technologies and computing systems. In this paper, a security framework model for quantum cryptography system which is based on the physical properties of light particles is proposed and all security requirements to assist in ensuring confidentiality between communicating parties are incorporated. The research work in this paper is based on a series of experiments which have been advocated recently by some agencies and researchers who used the quantum technology as a more effective method for solving the key distribution problem. The results of the proposed method is demonstrated and validated by experimental results.

On the power of quantum cryptography and computers

This paper will illustrate a new class of analysis off hash functions. The method will be demonstrated on the algorithm SHA-256. The idea behind the attack is to represent the algorithm as Boolean equations and solve them using tree notation. The new attack will help to speed up the process of finding vulnerabilities in hash functions, which may help to create more secure hash functions in the future. Despite the fact that the article will describe the approbation of the method only on SHA-256, these results can also be extrapolated to other hashing algorithms, since the idea, presented in this method, does not depend on an algorithm specification. 

New Method of Hash Functions Analysis

This paper will illustrate a new class of analysis off hash functions. The method will be demonstrated on the algorithm SHA-256. The idea behind the attack is to represent the algorithm as Boolean equations and solve them using tree notation. The new attack will help to speed up the process of finding vulnerabilities in hash functions, which may help to create more secure hash functions in the future. Despite the fact that the article will describe the approbation of the method only on SHA-256, these results can also be extrapolated to other hashing algorithms, since the idea, presented in this method, does not depend on an algorithm specification.

The one-way hash function plays an important role in digital signatures and message authentication from the viewpoint of security. No effective attacking method has been discovered to the algorithm of hash function standard. In this study, we tried to attack SHA-256 in encryption mode using linear and differential cryptanalysis to solve a private key. We deduced that an estimate of the private key would require huge known and chosen plaintexts in both linear and differential cryptanalysis, and that it would be difficult to decipher SHA-256 in view of the required computation.

/pdf/linear-and-differential-cryptanalysis-of-sha-256-1zz3i4aqjl.pdf

Linear and Differential Cryptanalysis of SHA-256

Popular Tasks used by Researchers

How can I help with your research?

Get more enhanced response by uploading the PDFs you want me to reference.

No relevant PDFs in your library

SciSpace is the AI research assistant for academics. Run systematic literature reviews on 280M+ papers, and write papers with cited sources. Trusted by 1M+ students, PhDs & researchers.

SciSpace | AI for Research

We encountered an error while loading the panel. Please try refreshing the page.

Something went wrong

Analyze PDFs

Code & Manuscripts

Funding & Grants

Literature & Patents

Medical & Clinical Data

Systematic Review

Visualize & Present

Web & Data

Build a Google Scholar-like website for your research.

Build a website

Create charts and images for your research

Create a Chart

Write a paper for submission to a journal

Draft a manuscript

Patent Search

Design eye-catching scientific posters in minutes.

Scientific Poster Generation

Systematic Literature Review

Anyone with the link can view this chat. You can switch it back to private anytime.

One task is running at the moment. Your messages will be shown right after.

Drag and drop or click here to browse

Loved by <highlight>1 million+</highlight> researchers

Extract a list of specific topics and their sources from unstructured text

Topics

Compare and analyze relevant papers that matches with your search

Papers

Get insights from PDFs and bookmarked papers from your library

My library

Recent searches

Try searching for:

Catch AI-generated content in scholarly and non-scholarly content

{ai} Detector

Ai Writer

Get PDF Summaries, highlighted text explanations 

Chat with PDF

Effortlessly create in-text citations and bibliographies in APA and 2,500 other formats

Citation generator

Get explanations, summaries, and answers on academic papers

Ease up your research workflow with {scispace}'s cohort of exciting AI tools

Elevate your academic writing skills and convey your ideas the way you want

Paraphraser

Explore our range of reading and writing tools

Your file is being prepared and should be ready in a few minutes. If it's a large file, it might take a bit longer. You can close this window, and we'll email you the file when it's done.

You have reached a maximum limit of <strong>{limit}</strong> columns in the table. Remove at least <strong>1</strong> column to add or create another one.

Hirofumi Ishikawa

Author Tools

Chat about Author

Papers

Linear and Differential Cryptanalysis of SHA-256