– 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)
We present MQQ-SIG, a signature scheme based on " Mul-tivariate Quadratic Quasigroups ". The MQQ-SIG signature scheme has a public key consisting of n 2 quadratic polynomials in n variables where n = 160, 192, 224 or 256. Under the assumption that solving systems of n 2 MQQ's equations in n variables is as hard as solving systems of random quadratic… (More)
SMS (Short Message Service) is a widely used service for brief communication. Occasionally the data sent using SMS services is confidential in nature and is desired not to be disclosed to a third party. In this paper an application for sending encrypted SMS messages using cryptographic methods based on theory of quasigroups is proposed. The encryption… (More)
A collision attack on NaSHA-512 was proposed by L. Ji et al. The claimed complexity of the attack is 2 192. The proposed attack is realized by using a suitable differential pattern. In this note we show that the correct result that can be inferred from their differential pattern is in fact a conditional one. It can be stated correctly as follows: A… (More)