AI Chat AI Image Generator AI Video Text to Speech

One Way Function Candidate based on the Collatz Problem

01/16/2018

∙

by Rade Vuckovac, et al.

∙

∙

The one way function based on Collatz problem is proposed. While Colatz (3x+1) problem is well known and undecided, the proposal is actually based on the problem's underlying conditional branching structure. The analysis shows why the 3x+1 problem is so difficult and how the algorithm conditional branching structure can be used to construct an one way function.

page 1

page 2

page 3

page 4

research

∙ 04/10/2023

Über die Anwendung des Tschebyschew-Verfahrens zum Ausbau des Weierstraß-Kerner-Verfahrens

We extend the Weierstrass-Kerner method by applying the Chebychev method...

0 Uwe Schäfer, et al. ∙

research

∙ 12/26/2000

The Tale of One-way Functions

The existence of one-way functions is arguably the most important proble...

0 Leonid A. Levin, et al. ∙

research

∙ 12/13/2019

Conditional Super Learner

In this article we consider the Conditional Super Learner (CSL), an algo...

0 Gilmer Valdes, et al. ∙

research

∙ 10/18/2019

Functional Epsilon Entropy

We consider the problem of coding for computing with maximal distortion,...

0 Sourya Basu, et al. ∙

research

∙ 08/27/2018

A Limitation of V-Matrix based Methods

To estimate the conditional probability functions based on the direct pr...

0 Niharika Gauraha, et al. ∙

research

∙ 02/05/2022

A proof of P != NP (New symmetric encryption algorithm against any linear attacks and differential attacks)

P vs NP problem is the most important unresolved problem in the field of...

0 Gao Ming, et al. ∙

research

∙ 01/23/2013

Assessing the value of a candidate. Comparing belief function and possibility theories

The problem of assessing the value of a candidate is viewed here as a mu...

0 Didier Dubois, et al. ∙