#### Filter Results:

#### Publication Year

2004

2016

#### Co-author

#### Key Phrase

#### Publication Venue

Learn More

– We have designed a new class of public key algorithms based on quasigroup string transformations using a specific class of quasigroups called multivariate quadratic quasigroups (MQQ). Our public key algorithm is a bijective mapping, it does not perform message expansions and can be used both for encryption and signatures. The public key consist of n… (More)

We propose a new infinite family of cryptographic hash functions, Edon–R, based on a recently defined candidate one-way function. Edon–R is a class of hash functions with variable output lengths. It is de fined using quasigroups and quasigroup string trans formations.

The need of true random number generators for many purposes (ranging from applications in cryptography and stochastic simulation , to search heuristics and game playing) is increasing every day. Many sources of randomness possess the property of stationarity. However , while a biased die may be a good source of entropy, many applications require input in… (More)

This document contains the Intellectual Property Statement and the technical description of the MQQ-SIG-a new public key digital signature scheme. The complete scientific publication covering the design rationale and the security analysis will be given in a separate publication. MQQ-SIG consists of n − n 4 quadratic polynomials with n Boolean variables… (More)

In this note we show a consequence of the recent observation that narrow-pipe hash designs manifest an abberation from ideal random functions for finding collisions for those functions with complexities much lower than the so called generic birthday paradox lower bound. The problem is generic for narrow-pipe designs including classic Merkle-Damgård designs… (More)

In this paper we design a stream cipher that uses the algebraic structure of the multiplicative group Z Z * p (where p is a big prime number used in ElGamal algorithm), by defining a quasigroup of order p − 1 and by doing quasigroup string transformations. The cryptograph-ical strength of the proposed stream cipher is based on the fact that breaking it… (More)

In this paper we propose a definition and construction of a new family of one-way candidate functions RN : Q N → 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… (More)

In this paper we reopen a 25 years old question of joint encryption and error-correction coding, named here as Cryptcoding. Cryptcoding is a procedure in which encryption/decryption and error-correction coding/decoding are performed in a single step. We discuss the advantages of this approach over the traditional First-Encrypt-Then-Encode approach. To our… (More)