Repository logo
Communities & Collections
Research Outputs
Fundings & Projects
People
Statistics
User Manual
Have you forgotten your password?
  1. Home
  2. Faculty of Computer Science and Engineering
  3. Faculty of Computer Science and Engineering: Conference papers
  4. How lightweight is the Hardware Implementation of Quasigroup S-boxes
Details

How lightweight is the Hardware Implementation of Quasigroup S-boxes

Date Issued
2012-09-12
Author(s)
Mihajloska Trpcheska, Hristina
Yalcin, Tolga
Gligoroski, Danilo
Abstract
In this paper, we present a novel method for realizing S-boxes
using non-associative algebraic structures - quasigroups, which - in certain cases - leads to more optimized hardware implementations. We aim
to give cryptographers an iterative tool for designing cryptographically
strong S-boxes (which we denote as Q-S-boxes) with additional flexibility
for hardware implementation. Existence of the set of cryptographically
strong 4-bit Q-S-boxes depends on the non-linear quasigroups of order 4
and quasigroup string transformations. The Q-S-boxes offer the option
to not only iteratively reuse the same circuit to implement several different strong 4-bit S-boxes, but they can also be serialized down to bit
level, leading to S-box implementations below 10 GEs. With Q-S-boxes
we can achieve over 40% area reduction with respect to a lookup table
based implementation, and also over 16% area reduction in a parallel implementation of Present. We plan to generalize our approach to S-boxes
of any size in the future.
Subjects

lightweight cryptogra...

File(s)
Loading...
Thumbnail Image
Name

ICTI_2012_submission_140.pdf

Size

592.6 KB

Format

Adobe PDF

Checksum

(MD5):48df4a08359a05a5990b2cba41f723fb

⠀

Built with DSpace-CRIS software - Extension maintained and optimized by 4Science

  • Accessibility settings
  • Privacy policy
  • End User Agreement
  • Send Feedback
Repository logo COAR Notify