- Full text PDF available (26)
- This year (1)
- Last 5 years (4)
- Last 10 years (15)
Journals and Conferences
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 setA we consider quasigroup operations n on A and we use them to de ne transformations E n D n A A where A is the set of all nite strings with members from A We show that the mappings E n and D n have several useful properties suitable for many purposes in cryptography coding theory de ning and improving pseudo random generators
We present MQQ-SIG, a signature scheme based on “Multivariate 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 equations,… (More)
In this article we apply a method for encrypting messages based on the properties of the quasigroups According to the analysis given in the article the method is extremely secure Beside that the plain text and its cipher text are of the same length and the encoding is of stream nature guarantying a very fast implementation AMS Mathematics Subject Classi… (More)
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 the… (More)
In this paper we consider two quasigroup transformations QM1 : A → A and QM2 : A → A, where A is the carrier of a quasigroup. Based on these transformations we show that different kinds of hash functions can be designed with suitable security.
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.
1 Department of Telematics, Faculty of Information Technology, Mathematics and Electrical Engineering, The Norwegian University of Science and Technology (NTNU), O.S.Bragstads plass 2E, N-7491 Trondheim, NORWAY, firstname.lastname@example.org 2 Norwegian University of Science and Technology Centre for Quantifiable Quality of Service in Communication Systems. O.S.… (More)