Cryptanalysis of the Quasigroup Block Cipher

Battey, Matthew; Parakh, Abhishek

doi:10.1145/2638404.2737600

Cited by 3 publications

(5 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The quasigroup block cipher proposed in the previous section was cryptanalyzed in [4]. Cryptanalysis revealed shortcomings of the cipher as first developed, and fixes were proposed.…”

Section: Results Of Algorithm Cryptanalysismentioning

confidence: 99%

Towards a New Quasigroup Block Cipher for a Single-Chip FPGA Implementation

Mahoney

Parakh

2015

2015 24th International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

In earlier work the authors reported on methods they investigated to implement quasigroup block encryption in hardware, with an emphasis on low cost. The aim was to design and deliver a hardware design solution that was inexpensive but did not sacrifice encryption security; the desired target for the design is low-bandwidth, low-cost areas such as Supervisory Control And Data Acquisition (SCADA) systems. Here the authors report on further refinements of this design with the aim of making a singlechip solution.

show abstract

“…The quasigroup block cipher proposed in the previous section was cryptanalyzed in [4]. Cryptanalysis revealed shortcomings of the cipher as first developed, and fixes were proposed.…”

Section: Results Of Algorithm Cryptanalysismentioning

confidence: 99%

Towards a New Quasigroup Block Cipher for a Single-Chip FPGA Implementation

Mahoney

Parakh

2015

2015 24th International Conference on Computer Communication and Networks (ICCCN)

Self Cite

View full text Add to dashboard Cite

show abstract

“…The cipher was further analyzed by linear and algebraic cryptanalysis. 38 It discovered that the original scheme is vulnerable to the odd-bit correlation and identical word problems and possibly prone to plaintext attacks. However, a revised design using larger portions of the key in the encryption and decryption process successfully eliminated the vulnerability.…”

Section: Block Ciphersmentioning

confidence: 99%

“…The algorithm combines block encryption with cipher block chaining and delivers for the NIST‐STS statistical test suite better ciphertext randomness than AES256 with the same key size. The cipher was further analyzed by linear and algebraic cryptanalysis . It discovered that the original scheme is vulnerable to the odd‐bit correlation and identical word problems and possibly prone to plaintext attacks.…”

Section: Quasigroups In Computer Security and Cryptographymentioning

confidence: 99%

“…The underlying mathematical principles are sound and can be used for symbolic computations . The operations of quasigroup‐based cryptographic algorithms are simple and concurrent in nature . They can be easily implemented on highly parallel and resource constrained (embedded) platforms.…”

Section: Introductionmentioning

confidence: 99%

“…5 The operations of quasigroup-based cryptographic algorithms are simple and concurrent in nature. 11,16,17,34,38 They can be easily implemented on highly parallel 11,14,[21][22][23]39 and resource constrained (embedded) 5,13,[17][18][19][20]34,37,38,40 platforms. That is useful for addressing certain weak spots of traditional cryptosystems based on integer factorization and the discrete logarithm problem.…”

mentioning

confidence: 99%

See 2 more Smart Citations

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

Linear Cryptanalysis of Quasigroup Block Cipher

Gerlock

Parakh

2016

Proceedings of the 11th Annual Cyber and Information Security Research Conference

View full text Add to dashboard Cite

Cryptanalysis of the Quasigroup Block Cipher

Cited by 3 publications

References 6 publications

Towards a New Quasigroup Block Cipher for a Single-Chip FPGA Implementation

Towards a New Quasigroup Block Cipher for a Single-Chip FPGA Implementation

An acceleration of quasigroup operations by residue arithmetic

Linear Cryptanalysis of Quasigroup Block Cipher

Contact Info

Product

Resources

About