Högskolan i Skövde

his.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
sboxgates: A program for finding low gate count implementations of S-boxes
University of Skövde, School of Informatics. University of Skövde, Informatics Research Environment. Swedish Defence University, Stockholm, Sweden. (Information Systems)ORCID iD: 0000-0001-9246-0263
2021 (English)In: Journal of Open Source Software, E-ISSN 2475-9066, Vol. 6, no 62, p. 1-3, article id 2946Article in journal (Refereed) Published
Abstract [en]

S-boxes are often the only nonlinear components in modern block ciphers. They are commonly selected to comply with very specific criteria in order to make a cipher secure against, for example, linear and differential attacks. An M x N S-box can be thought of as a lookup table that relates an M-bit input value to an N-bit output value, or as a set of N boolean functions of M variables (Schneier, 1996).

Although cipher specifications generally describe S-boxes using their lookup tables, they can also be described as boolean functions or logic gate circuits. sboxgates, which is presented here, finds equivalent logic gate circuits for S-boxes, given their lookup table specification. Generated circuits are output in a human-readable XML format. The software can convert the output files into C or CUDA (a parallel computing platform for Nvidia GPUs) source code. The generated circuits can also be converted to the DOT graph description language for visualization with Graphviz (Ellson et al., 2002).

Place, publisher, year, edition, pages
Open Journals , 2021. Vol. 6, no 62, p. 1-3, article id 2946
National Category
Computational Mathematics
Research subject
Information Systems
Identifiers
URN: urn:nbn:se:his:diva-19851DOI: 10.21105/joss.02946OAI: oai:DiVA.org:his-19851DiVA, id: diva2:1567837
Note

CC BY 4.0

Available from: 2021-06-16 Created: 2021-06-16 Last updated: 2022-09-15Bibliographically approved

Open Access in DiVA

fulltext(128 kB)98 downloads
File information
File name FULLTEXT01.pdfFile size 128 kBChecksum SHA-512
0fb591a1d53e37070bca45b29b5e978f4f9c1cfc2967b2353abb11476af8f049ce7ed14aa103b67598a44cf67c7044742dd90246ead58fa979d7b79a60ec0ec0
Type fulltextMimetype application/pdf

Other links

Publisher's full text

Authority records

Dansarie, Marcus

Search in DiVA

By author/editor
Dansarie, Marcus
By organisation
School of InformaticsInformatics Research Environment
In the same journal
Journal of Open Source Software
Computational Mathematics

Search outside of DiVA

GoogleGoogle Scholar
Total: 98 downloads
The number of downloads is the sum of all downloads of full texts. It may include eg previous versions that are now no longer available

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 169 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • apa-cv
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf