### Abstract

This paper presents the results of a linear cryptanalysis of quasigroup block cipher. The quasigroup block cipher is being developed for resource constrained environments, especially SCADA systems. Here we determine if any key material can be found by conducting a linear cryptanalysis on a simplified quasigroup block cipher. Using Matsu''s algorithm we seek to determine a suitable linear approximation of the quasigroup block cipher, the number of plaintext-ciphertext pairs to test, and the amount of time and space required to mount a known-plaintext attack on the quasi-group block cipher. Since the quasigroup does not use a Feistel network, the focus of the linear cryptanalysis is on the keyed transformation during table lookup operations of the quasigroup in order to 1) determine how the key bits used during encryption impact the ciphertext and from this 2) find a linear approximation that is non-negligible. Our results showed that no key material is recovered using linear cryptanalysis and consequently quasigroup cipher is resistant to such an attack.

Original language | English (US) |
---|---|

Title of host publication | Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016 |

Publisher | Association for Computing Machinery, Inc |

ISBN (Electronic) | 9781450337526 |

DOIs | |

State | Published - Apr 5 2016 |

Event | 11th Annual Cyber and Information Security Research Conference, CISRC 2016 - Oak Ridge, United States Duration: Apr 5 2016 → Apr 7 2016 |

### Publication series

Name | Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016 |
---|

### Other

Other | 11th Annual Cyber and Information Security Research Conference, CISRC 2016 |
---|---|

Country | United States |

City | Oak Ridge |

Period | 4/5/16 → 4/7/16 |

### Fingerprint

### Keywords

- Linear cryptanalysis
- Low-powered cryptosystems
- Quasigroup encryption

### ASJC Scopus subject areas

- Information Systems
- Computer Networks and Communications

### Cite this

*Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016*[2897818] (Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016). Association for Computing Machinery, Inc. https://doi.org/10.1145/2897795.2897818

**Linear cryptanalysis of quasigroup block cipher.** / Gerlock, Leonora; Parakh, Abhishek.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016.*, 2897818, Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016, Association for Computing Machinery, Inc, 11th Annual Cyber and Information Security Research Conference, CISRC 2016, Oak Ridge, United States, 4/5/16. https://doi.org/10.1145/2897795.2897818

}

TY - GEN

T1 - Linear cryptanalysis of quasigroup block cipher

AU - Gerlock, Leonora

AU - Parakh, Abhishek

PY - 2016/4/5

Y1 - 2016/4/5

N2 - This paper presents the results of a linear cryptanalysis of quasigroup block cipher. The quasigroup block cipher is being developed for resource constrained environments, especially SCADA systems. Here we determine if any key material can be found by conducting a linear cryptanalysis on a simplified quasigroup block cipher. Using Matsu''s algorithm we seek to determine a suitable linear approximation of the quasigroup block cipher, the number of plaintext-ciphertext pairs to test, and the amount of time and space required to mount a known-plaintext attack on the quasi-group block cipher. Since the quasigroup does not use a Feistel network, the focus of the linear cryptanalysis is on the keyed transformation during table lookup operations of the quasigroup in order to 1) determine how the key bits used during encryption impact the ciphertext and from this 2) find a linear approximation that is non-negligible. Our results showed that no key material is recovered using linear cryptanalysis and consequently quasigroup cipher is resistant to such an attack.

AB - This paper presents the results of a linear cryptanalysis of quasigroup block cipher. The quasigroup block cipher is being developed for resource constrained environments, especially SCADA systems. Here we determine if any key material can be found by conducting a linear cryptanalysis on a simplified quasigroup block cipher. Using Matsu''s algorithm we seek to determine a suitable linear approximation of the quasigroup block cipher, the number of plaintext-ciphertext pairs to test, and the amount of time and space required to mount a known-plaintext attack on the quasi-group block cipher. Since the quasigroup does not use a Feistel network, the focus of the linear cryptanalysis is on the keyed transformation during table lookup operations of the quasigroup in order to 1) determine how the key bits used during encryption impact the ciphertext and from this 2) find a linear approximation that is non-negligible. Our results showed that no key material is recovered using linear cryptanalysis and consequently quasigroup cipher is resistant to such an attack.

KW - Linear cryptanalysis

KW - Low-powered cryptosystems

KW - Quasigroup encryption

UR - http://www.scopus.com/inward/record.url?scp=84968547015&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84968547015&partnerID=8YFLogxK

U2 - 10.1145/2897795.2897818

DO - 10.1145/2897795.2897818

M3 - Conference contribution

AN - SCOPUS:84968547015

T3 - Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016

BT - Proceedings of the 11th Annual Cyber and Information Security Research Conference, CISRC 2016

PB - Association for Computing Machinery, Inc

ER -