Go to:
Logótipo
Você está em: Start > Publications > View > One-Way Functions Using Algorithmic and Classical Information Theories
Map of Premises
Principal
Publication

One-Way Functions Using Algorithmic and Classical Information Theories

Title
One-Way Functions Using Algorithmic and Classical Information Theories
Type
Article in International Scientific Journal
Year
2013
Authors
matos, a
(Author)
Other
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page Without ORCID
pinto, a
(Author)
Other
The person does not belong to the institution. The person does not belong to the institution. The person does not belong to the institution. Without AUTHENTICUS Without ORCID
teixeira, a
(Author)
FCUP
View Personal Page You do not have permissions to view the institutional email. Search for Participant Publications View Authenticus page View ORCID page
Journal
Vol. 52
Pages: 162-178
ISSN: 1432-4350
Publisher: Springer Nature
Other information
Authenticus ID: P-005-3RZ
Abstract (EN): We prove several results relating injective one-way functions, time-bounded conditional Kolmogorov complexity, and time-bounded conditional entropy. First we establish a connection between injective, strong and weak one-way functions and the expected value of the polynomial time-bounded Kolmogorov complexity, denoted here by E(K-t (x vertical bar f (x))). These results are in both directions. More precisely, conditions on E(K-t (x vertical bar f (x))) that imply that f is a weak one-way function, and properties of E(K-t (x vertical bar f (x))) that are implied by the fact that f is a strong one-way function. In particular, we prove a separation result: based on the concept of time-bounded Kolmogorov complexity, we find an interval in which every function f is a necessarily weak but not a strong one-way function. Then we propose an individual approach to injective one-way functions based on Kolmogorov complexity, defining Kolmogorov one-way functions and prove some relationships between the new proposal and the classical definition of one-way functions, showing that a Kolmogorov one-way function is also a deterministic one-way function. A relationship between Kolmogorov one-way functions and the conjecture of polynomial time symmetry of information is also proved. Finally, we relate E(K-t (x vertical bar f (x))) and two forms of time-bounded entropy, the unpredictable entropy H-unp, in which "one-wayness" of a function can be easily expressed, and the Yao(+) entropy, a measure based on compression/decompression schema in which only the decompressor is restricted to be time-bounded.
Language: English
Type (Professor's evaluation): Scientific
Contact: lfa@dcc.fc.up.pt; acm@dcc.fc.up.pt; ampinto@docentes.ismai.pt; asouto@math.ist.utl.pt; andreiasofia@ncc.up.pt
No. of pages: 17
Documents
We could not find any documents associated to the publication.
Related Publications

Of the same journal

Sophistication vs Logical Depth (2017)
Article in International Scientific Journal
antunes, l; Bauwens, B; souto, a; teixeira, a
Sophistication Revisited (2009)
Article in International Scientific Journal
antunes, l; fortnow, l
Hardness of Approximation for Knapsack Problems (2015)
Article in International Scientific Journal
Buhrman, H; Loff, B; Torenvliet, L
Equations Over Free Inverse Monoids with Idempotent Variables (2017)
Article in International Scientific Journal
Pedro V. Silva; Volker Diekert; Florent Martin; Géraud Sénizergues
Equations Over Free Inverse Monoids with Idempotent Variables (2017)
Article in International Scientific Journal
Diekert, V; Martin, F; Senizergues, G; Pedro V. Silva

See all (7)

Recommend this page Top
Copyright 1996-2025 © Faculdade de Medicina Dentária da Universidade do Porto  I Terms and Conditions  I Acessibility  I Index A-Z
Page created on: 2025-07-22 at 01:20:00 | Privacy Policy | Personal Data Protection Policy | Whistleblowing | Electronic Yellow Book