A common key encryption algorithm using N-dimensional Hilbert curves

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

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
Event2011 7th International Conference on Information Assurance and Security, IAS 2011 - Malacca
Duration: 2011 Dec 52011 Dec 8

Other

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

Fingerprint

Cryptography

Keywords

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

ASJC Scopus subject areas

  • Information Systems
  • Safety, Risk, Reliability and Quality

Cite this

Kamata, S. (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] https://doi.org/10.1109/ISIAS.2011.6122832

A common key encryption algorithm using N-dimensional Hilbert curves. / Kamata, Seiichiro.

Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011. 2011. p. 275-279 6122832.

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

Kamata, S 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., 6122832, pp. 275-279, 2011 7th International Conference on Information Assurance and Security, IAS 2011, Malacca, 11/12/5. https://doi.org/10.1109/ISIAS.2011.6122832
Kamata S. 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. 2011. p. 275-279. 6122832 https://doi.org/10.1109/ISIAS.2011.6122832
Kamata, Seiichiro. / A common key encryption algorithm using N-dimensional Hilbert curves. Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011. 2011. pp. 275-279
@inproceedings{3b23f49d82b74223b8c838b1fec11826,
title = "A common key encryption algorithm using N-dimensional Hilbert curves",
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.",
keywords = "Common Key Encryption, Hilbert curve, Space-filling curve, Symmetric Key Cipher",
author = "Seiichiro Kamata",
year = "2011",
doi = "10.1109/ISIAS.2011.6122832",
language = "English",
isbn = "9781457721533",
pages = "275--279",
booktitle = "Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011",

}

TY - GEN

T1 - A common key encryption algorithm using N-dimensional Hilbert curves

AU - Kamata, Seiichiro

PY - 2011

Y1 - 2011

N2 - 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.

AB - 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.

KW - Common Key Encryption

KW - Hilbert curve

KW - Space-filling curve

KW - Symmetric Key Cipher

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

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

U2 - 10.1109/ISIAS.2011.6122832

DO - 10.1109/ISIAS.2011.6122832

M3 - Conference contribution

AN - SCOPUS:84856643508

SN - 9781457721533

SP - 275

EP - 279

BT - Proceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011

ER -