A common key encryption algorithm using N-dimensional Hilbert curves

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

There are a lot of previous works on common key encryptions such as DES, AES, etc, In this paper, a new common key encryption algorithm is proposed using Hilbert curves which are a one-to-one mapping between N-dimensional (N-D) spaces and 1-D space (a line). This is based on a property having a sharp rise in the number of Hilbert curve patterns in N-D spaces. In the case of N = 2, there are only four patterns, while if N is 5, the number of the patterns is more than 1 billions. Operations of addition and multiplication are denned on a curve, based on a mapping of a point in N-D spaces to a point on a line. In order to realize a cryptosystem, the algorithm utilizes Hilbert ordered point addresses, which is expressed as the coordinates of the points in N-dimensional space.

Original languageEnglish
Title of host publicationProceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011
Pages275-279
Number of pages5
DOIs
Publication statusPublished - 2011 Dec 1
Event2011 7th International Conference on Information Assurance and Security, IAS 2011 - Malacca, Malaysia
Duration: 2011 Dec 52011 Dec 8

Publication series

NameProceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011

Conference

Conference2011 7th International Conference on Information Assurance and Security, IAS 2011
CountryMalaysia
CityMalacca
Period11/12/511/12/8

Keywords

  • Common Key Encryption
  • Hilbert curve
  • Space-filling curve
  • Symmetric Key Cipher

ASJC Scopus subject areas

  • Information Systems
  • Safety, Risk, Reliability and Quality

Fingerprint Dive into the research topics of 'A common key encryption algorithm using N-dimensional Hilbert curves'. Together they form a unique fingerprint.

  • Cite this

    Kamata, S. I. (2011). A common key encryption algorithm using N-dimensional Hilbert curves. In Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011 (pp. 275-279). [6122832] (Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011). https://doi.org/10.1109/ISIAS.2011.6122832