#### Filter Results:

#### Publication Year

1997

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

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)

Given a nite set A we consider quasigroup operations 1 2 : : : n on A and we use them to deene transformations E (n) D (n) : A + ! A + , w h e r e A + is the set of all nite strings with members from A. W e show that the mappings E (n) and D (n) have s e v eral useful properties, suitable for many purposes in cryptography, coding theory, deening and… (More)

- Svein Johan Knapskog, Danilo Gligoroski, Mohamed El-Hadedy, Stig Frode Mjølsnes
- 2009

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)

- BLUE MIDNIGHT WISH, Danilo Gligoroski, Vlastimil Klima, Svein Johan Knapskog, Mohamed El-Hadedy, Jørn Amundsen +1 other
- 2008

This is the supporting documentation that describes in details the cryptographic hash function BLUE MIDNIGHT WISH which is submitted as a candidate for SHA-3 hash competition organized by National Institute of Standards and Technology (NIST), according to the public call [1]. BLUE MIDNIGHT WISH is a cryptographic hash function with output size of n bits… (More)

- D. Gligoroski
- 2003

In this paper we describe several programming modules which perform string transformations with quasigroups. The modules use one or two quasigroups of order 16, thus, taking only 128 bytes for storage per quasigroup. Using those modules as cryptographic primitives we develop a block cipher, a stream cipher, a hash function with variable length of output… (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)