A common key encryption algorithm using N-dimensional Hilbert curves

Sei Ichiro Kamata*

*この研究の対応する著者

研究成果: Conference contribution

1 被引用数 (Scopus)

抄録

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.

本文言語English
ホスト出版物のタイトルProceedings of the 2011 7th International Conference on Information Assurance and Security, IAS 2011
ページ275-279
ページ数5
DOI
出版ステータスPublished - 2011 12 1
イベント2011 7th International Conference on Information Assurance and Security, IAS 2011 - Malacca, Malaysia
継続期間: 2011 12 52011 12 8

出版物シリーズ

名前Proceedings 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
国/地域Malaysia
CityMalacca
Period11/12/511/12/8

ASJC Scopus subject areas

  • 情報システム
  • 安全性、リスク、信頼性、品質管理

フィンガープリント

「A common key encryption algorithm using N-dimensional Hilbert curves」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル