Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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
On Constructing Secure and Hardware-Efficient Invertible Mappings
KTH, School of Information and Communication Technology (ICT), Electronics and Embedded Systems.ORCID iD: 0000-0001-7382-9408
2016 (English)In: Proceedings of IEEE International Symposium on Multiple-Valued Logic, IEEE Computer Society, 2016Conference paper, Published paper (Refereed)
Abstract [en]

Our society becomes increasingly dependent on wireless communications. The tremendous growth in the number and type of wirelessly connected devices in a combination with the dropping cost for performing cyberattacks create new challenges for assuring security of services and applications provided by the next generation of wireless communication networks. The situation is complicated even further by the fact that many end-point Internet of Things (IoT) devices have very limited resources for implementing security functionality. This paper addresses one of the aspects of this important, many-faceted problem - the design of hardware-efficient cryptographic primitives suitable for the protection of resource-constrained IoT devices. We focus on cryptographic primitives based on the invertible mappings of type {0,1,…,2n−1}→{0,1,…,2n−1}. In order to check if a given mapping is invertible or not, we generally need an exponential in n number of steps. In this paper, we derive a sufficient condition for invertibility which can be checked in O(n2N) time, where N is the size of representation of the largest function in the mapping. Our results can be used for constructing cryptographically secure invertible mappings which can be efficiently implemented in hardware.

Place, publisher, year, edition, pages
IEEE Computer Society, 2016.
Keyword [en]
invertible mapping, cryptographic primitive, security
National Category
Computer Science
Identifiers
URN: urn:nbn:se:kth:diva-183978DOI: 10.1109/ISMVL.2016.15ISI: 000386537300038Scopus ID: 2-s2.0-84981350388ISBN: 978-1-4673-9488-8 (print)OAI: oai:DiVA.org:kth-183978DiVA: diva2:913286
Conference
IEEE International Symposium on Multiple-Valued Logic
Funder
Swedish Foundation for Strategic Research , SM14-0016
Note

QC 20161129

Available from: 2016-03-21 Created: 2016-03-21 Last updated: 2016-11-29Bibliographically approved

Open Access in DiVA

No full text

Other links

Publisher's full textScopusarXiv

Search in DiVA

By author/editor
Dubrova, Elena
By organisation
Electronics and Embedded Systems
Computer Science

Search outside of DiVA

GoogleGoogle Scholar

Altmetric score

Total: 36 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • harvard1
  • 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