Computer Science – Cryptography and Security
Scientific paper
2005-10-07
Computer Science
Cryptography and Security
Submitetd to conference
Scientific paper
In this paper we propose a definition and construction of a new family of one-way candidate functions ${\cal R}_N:Q^N \to Q^N$, where $Q=\{0,1,...,s-1\}$ is an alphabet with $s$ elements. Special instances of these functions can have the additional property to be permutations (i.e. one-way permutations). These one-way functions have the property that for achieving the security level of $2^n$ computations in order to invert them, only $n$ bits of input are needed. The construction is based on quasigroup string transformations. Since quasigroups in general do not have algebraic properties such as associativity, commutativity, neutral elements, inverting these functions seems to require exponentially many readings from the lookup table that defines them (a Latin Square) in order to check the satisfiability for the initial conditions, thus making them natural candidates for one-way functions.
No associations
LandOfFree
Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-560960