Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 10,000 papers for “One-way function”

One-way ANOVA function.

Matthew G. R. Courtney (11548124), Kevin C. T. Chang (11548127), Bing Mei (140691) et al. · Figshare · 2021

Cited by 0Open access

A Transfinite Complete One-Way Function

Beelen, K.I. · Utrecht University Repository (Utrecht University) · 2021

Infinite time Turing machines and ordinal Turing machines are used to perform transfinite computational tasks. In order to further explore the capabilities of these models, this research looks into one-way functions and the possibility to generalize them to work in a transfinitary context. One of the greatest problems in (finitary) computer science is determining whether these functions exist or not. Crucially, it bears mentioning that the notion of one-way function is probabilistic in nature. In 2003, Levin presented a complete one-way function—a function guaranteed to be one-way if any one-way functions exist—based on the tiling problem. His findings were further developed in research by Kozhevnikov and Nikolenko in 2009. Following their research, we define a notion of transfinite one-way function, for any suitable generalized system of probability. Such a notion has not been defined before, and the present paper provides the groundwork needed to do so. To this end, we consider one possible candidate example of a generalized system of probability sufficient to ground the notion of transfinite one-way function—namely, Benci’s theory of non-Archimedean probability—together with the theory of surreal numbers. Our main result proves that every ordinal polynomial-time computation on an ordinal Turing machine can be simulated by a transfinite tiling problem, and that transfinite tiling is therefore a transfinite complete one-way function.

Cited by 0Open access

Creating Strong Total Commutative Associative One-Way Functions from Any One-Way Function

Lane A. Hemaspaandra, J org Rothe · 1998

Rabi and Sherman [RS97] presented novel digital signature and unauthenticated secret-key agreement protocols, developed by themselves and by Rivest and Sherman. These protocols use "strong," total, commutative (in the case of multi-party secret-key agreement), associative one-way functions as their key building blocks. Though Rabi and Sherman did prove that associative one-way functions exist if P 6= NP, they left as an open question whether any natural complexity-theoretic assumption is sufficient to ensure the existence of "strong," total, commutative, associative one-way functions. In this paper, we prove that if P 6= NP then "strong," total, commutative, associative one-way functions exist.

Cited by 2

Generalized one-way function and its application

Hua-Lei Yin · arXiv (Cornell University) · 2024

One-way functions are fundamental to classical cryptography and their existence remains a longstanding problem in computational complexity theory. Recently, a provable quantum one-way function has been identified, which maintains its one-wayness even with unlimited computational resources. Here, we extend the mathematical definition of functions to construct a generalized one-way function by virtually measuring the qubit of provable quantum one-way function and randomly assigning the corresponding measurement outcomes with identical probability. Remarkably, using this generalized one-way function, we have developed an unconditionally secure key distribution protocol based solely on classical data processing, which can then utilized for secure encryption and signature. Our work highlights the importance of information in characterizing quantum systems and the physical significance of the density matrix. We demonstrate that probability theory and randomness are effective tools for countering adversaries with unlimited computational capabilities.

Cited by 0Open access

Inversion of a One-Way Function via Derivative

יהוה, Kaoru Aguilera Katayama · Zenodo (CERN European Organization for Nuclear Research) · 2026

It can have many applications, from destroying ALL CRYPTOGRAPHY to creating neural networks based on derivatives.

Cited by 0Open access

One-way Hash Function Based on Neural Network

Shiguo Lian, Jinsheng Sun, Zhiquan Wang · ArXiv.org · 2007

A hash function is constructed based on a three-layer neural network. The three neuron-layers are used to realize data confusion, diffusion and compression respectively, and the multi-block hash mode is presented to support the plaintext with variable length. Theoretical analysis and experimental results show that this hash function is one-way, with high key sensitivity and plaintext sensitivity, and secure against birthday attacks or meet-in-the-middle attacks. Additionally, the neural network's property makes it practical to realize in a parallel way. These properties make it a suitable choice for data signature or authentication.

Cited by 16Open access

The MD2 Hash Function Is Not One-Way

2014

Abstract. MD2 is an early hash function developed by Ron Rivest for RSA Security, that produces message digests of 128 bits. In this paper, we show that MD2 does not reach the ideal security level of 2128. We describe preimage attacks against the underlying compression function, the best of which has complexity of 273. As a result, the full MD2 hash can be attacked in preimage with complexity of 2104. 1

Cited by 0

One-Way Hash Function based on Cascade Chaos

Xiang Fei, Changwei Zhao, Jian Wang et al. · The Open Cybernetics & Systemics Journal · 2015

This paper proposes a novel hash function construction based on cascade chaos. Firstly, the L-length original message is divided into a number of blocks according to every character, which are transformed into corresponding ASCII values. Then the ASCII values are normalized into the interval of (0, 1), which compose a big array with the L-length. Regarding the first normalized ASCII value with the algorithm parameter H as the initial input of the cascade chaos, a series of sequences are obtained, where the CBC mode is adopted. The 128-bit hash value is generated by transforming the sequences into binary sequence according to a rule. Simulation results and performance analysis show that the proposed hash function has high sensitivity to the original message and system parameters, strong confusion and diffusion, excellent statistical properties, strong collision resistance and flexible to generated 160, 256, 512-bit hash value after modifying the algorithm slightly.

Cited by 4Open access