### 抜粋

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 5 → 2011 12 8 |

### 出版物シリーズ

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

### Conference

Conference | 2011 7th International Conference on Information Assurance and Security, IAS 2011 |
---|---|

国 | Malaysia |

市 | Malacca |

期間 | 11/12/5 → 11/12/8 |

### ASJC Scopus subject areas

- Information Systems
- Safety, Risk, Reliability and Quality

## フィンガープリント A common key encryption algorithm using N-dimensional Hilbert curves' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

## これを引用

*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