Searching for quasigroups for hash functions with genetic algorithms

Snášel, Václav; Abraham, Ajith; Dvorský, Jiří; Ochodková, Eliška; Platoš, Jan; Krömer, Pavel

doi:10.1109/nabic.2009.5393520

Cited by 9 publications

(14 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…GA was initially applied to the quasigroup optimization in [21] and the technique was further extended in [22]. The artificial evolution was utilized to explore superior quasigroups isotopic to the quasigroup of modular subtraction [19].…”

Section: Proposed Modified Quasi Group Encryptionmentioning

confidence: 99%

“…GA for the identification of analytic quasigroup is done through encoding of the candidate solutions and fitness function to assess chromosomes [21].…”

Section: Proposed Modified Quasi Group Encryptionmentioning

confidence: 99%

“…Fitness functions depending on hashing [21], randomness of generated sequences [22], and the associativity and commutativity [23] were observed to drive the evolutionary optimization of isotopic quasigroups in specific direction.…”

Section: Fitness Function Based On Products Of Sequencesmentioning

confidence: 99%

“…The fitness function assigns large fitness to quasigroups that generate sequences containing all elements of Q with approximately the same frequency. Ultimately, the third fitness function assigns large fitness to quasigroups that generate as different sequences of intermediate results as possible [21]. …”

Section: Consider a Quasigroup Of Modular Subtractionmentioning

confidence: 99%

See 3 more Smart Citations

A Secure Crypto based ECG Data Communication using Modified SPHIT and Modified Quasigroup Encryption

Sujatha¹,

Govindaraju²

2013

IJCA

View full text Add to dashboard Cite

In recent years, wireless body area sensor network is one of the important aspects for the development of the healthcare applications. But, it has several issues based on the security and authentication during the transmission of the data. Because of the influence of the hackers, more importance is been given to security aspect in Wireless Body Area Sensor Networks communication. Cryptographic techniques are observed to provide significant results in protecting data from hackers and attackers. Some of the existing cryptographic algorithms such as selective encryption provide good results. The present research work mainly deals with securing the ECG data in Wireless Body Area Sensor Network (WBASN) before transmission. The existing algorithm is mainly based on the RSA algorithm which is used for data security during the transmission but it has some problems in real time applications and it is more exposure to vulnerable attacks. Therefore, in this paper, improved selective algorithm based on the modified quasigroup encryption is used along with the modified SPHIT compression algorithm. Modified quasi group encryption which uses genetic algorithm for optimization is used in this approach for improving the Quasigroup performance. The optimization based approach provides the optimized Quasigroup for encryption which gives better security for the ECG data. The results obtained are compared with other existing algorithm which is evaluated using the quality measurement parameters.

show abstract

Section: Proposed Modified Quasi Group Encryptionmentioning

confidence: 99%

“…GA for the identification of analytic quasigroup is done through encoding of the candidate solutions and fitness function to assess chromosomes [21].…”

Section: Proposed Modified Quasi Group Encryptionmentioning

confidence: 99%

Section: Fitness Function Based On Products Of Sequencesmentioning

confidence: 99%

Section: Consider a Quasigroup Of Modular Subtractionmentioning

confidence: 99%

See 2 more Smart Citations

A Secure Crypto based ECG Data Communication using Modified SPHIT and Modified Quasigroup Encryption

Sujatha¹,

Govindaraju²

2013

IJCA

View full text Add to dashboard Cite

show abstract

“…The use of large quasigroups can further improve the strength of cryptographic operations. 24,25,32,[42][43][44] Computational experiments demonstrated that the randomness of sequences obtained by quasigroup transformations is influenced by the used quasigroup, 32 and the computation speed of a quasigroup-based hash function depends on the order of the used quasigroup as well. Alternative quasigroup representations that do not store their multiplication tables in computer memory yield increased computational costs.…”

mentioning

confidence: 99%

An acceleration of quasigroup operations by residue arithmetic

Krömer

Platoš

Nowaková

et al. 2017

Concurrency and Computation

View full text Add to dashboard Cite

Quasigroup operations are essential for a wide range of cryptographic procedures that includes cryptographic hash functions, electronic signatures, pseudorandom number generators, and stream and block ciphers. Quasigroup cryptography achieves high levels of security at low memory and computational costs by an iterative application of quasigroup operations to streams and blocks of data. The use of large quasigroups can further improve the strength of cryptographic operations. However, the order of used quasigroups is the main factor affecting the memory requirements of quasigroup cryptographic schemes. Alternative quasigroup representations that do not store their multiplication tables in computer memory yield increased computational costs.In any case, an efficient implementation of quasigroup operations is critical for practical applications of quasigroup cryptography. Residue number systems allow a fast, concurrent realization of addition and multiplication. In this work, residue arithmetic is used to accelerate quasigroup operations, and an efficient computational approach to their implementation, designed with respect to the extended instruction sets of modern processors, is proposed. KEYWORDSacceleration, quasigroup operations, residue arithmetic, residue number systems, security INTRODUCTIONQuasigroups are algebraic structures with a large number of applications in cryptography and computer security. 1-5 A quasigroup consists of a set of elements (carrier) and a binary operation (multiplication) that maps every 2 of its elements onto a third element. Mathematically, they are grupoids closely related to the combinatorial concept of latin squares 2,3,6,7 and the geometric notion of k−nets (3−nets). 2,8 Multiplication (Cayley) tables of finite quasigroups can be expressed as latin squares, and k−nets can be coordinatized by systems of orthogonal quasigroups.In general, quasigroups are noncommutative, nonassociative, nonidempotent, and noninvolutory and do not have neutral elements. 9 These properties make them suitable for applications in cryptography, and they have been used as fundamental elements of a wide range of cryptographic algorithms with success. Their applications in this area include novel high-performance stream 4-6,10-13 and block 4,5,14-22 ciphers, cryptographic hash 4,5,23-27 and trapdoor 4,14,23 functions, fast and secure electronic signatures (eg, message authentication codes), 4,14,23,28 pseudorandom number generators, 5,29-31 error-detecting 2 and error-correcting 2,9,32 codes, and simultaneous encryption and error-correction coding (cryptcoding). 4Quasigroups can be also used to model cryptosystems based on other cryptographic primitives. A quasigroup representation has been devised for block ciphers based on Feistel networks (ie, Feistel and generalized Feistel ciphers). 33The attractiveness of quasigroups for practical cryptographic applications consists in the combination of provably strong security and inexpensive realization of quasigroup-based cryptographic operations. They support la...

show abstract

Automatic Design of Noncryptographic Hash Functions Using Genetic Programming

Estébanez

Sáez

Recio

et al. 2014

Computational Intelligence

View full text Add to dashboard Cite

Noncryptographic hash functions have an immense number of important practical applications owing to their powerful search properties. However, those properties critically depend on good designs: Inappropriately chosen hash functions are a very common source of performance losses. On the other hand, hash functions are difficult to design: They are extremely nonlinear and counterintuitive, and relationships between the variables are often intricate and obscure. In this work, we demonstrate the utility of genetic programming (GP) and avalanche effect to automatically generate noncryptographic hashes that can compete with state-of-the-art hash functions. We describe the design and implementation of our system, called GP-hash, and its fitness function, based on avalanche properties. Also, we experimentally identify good terminal and function sets and parameters for this task, providing interesting information for future research in this topic. Using GP-hash, we were able to generate two different families of noncryptographic hashes. These hashes are able to compete with a selection of the most important functions of the hashing literature, most of them widely used in the industry and created by world-class hashing experts with years of experience.

show abstract

Searching for quasigroups for hash functions with genetic algorithms

Cited by 9 publications

References 9 publications

A Secure Crypto based ECG Data Communication using Modified SPHIT and Modified Quasigroup Encryption

A Secure Crypto based ECG Data Communication using Modified SPHIT and Modified Quasigroup Encryption

An acceleration of quasigroup operations by residue arithmetic

Automatic Design of Noncryptographic Hash Functions Using Genetic Programming

Contact Info

Product

Resources

About