多字母欧几里得密码

2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT) Pub Date : 2014-10-01 DOI:10.1109/ICAICT.2014.7035909

V. D. Ten, Aizhan B. Dyussenbina

{"title":"多字母欧几里得密码","authors":"V. D. Ten, Aizhan B. Dyussenbina","doi":"10.1109/ICAICT.2014.7035909","DOIUrl":null,"url":null,"abstract":"First, we prove a fundamental theorem which describes some properties of elements of Euclidean rings. This theorem allows us to construct an infinite family of cryptosystems, among which there are cryptosystems without repetitions. This means that the encryption algorithm can encrypt any text so that all symbols after encryption are different. Therefore, methods of statistic analysis cannot be used against our cryptosystems even theoretically.","PeriodicalId":103329,"journal":{"name":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Polyalphabetic Euclidean ciphers\",\"authors\":\"V. D. Ten, Aizhan B. Dyussenbina\",\"doi\":\"10.1109/ICAICT.2014.7035909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"First, we prove a fundamental theorem which describes some properties of elements of Euclidean rings. This theorem allows us to construct an infinite family of cryptosystems, among which there are cryptosystems without repetitions. This means that the encryption algorithm can encrypt any text so that all symbols after encryption are different. Therefore, methods of statistic analysis cannot be used against our cryptosystems even theoretically.\",\"PeriodicalId\":103329,\"journal\":{\"name\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICAICT.2014.7035909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICAICT.2014.7035909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

首先，我们证明了描述欧几里得环元素的一些性质的一个基本定理。这个定理允许我们构造一个无限族的密码系统，其中存在没有重复的密码系统。这意味着加密算法可以加密任何文本，使得加密后的所有符号都不一样。因此，即使从理论上讲，统计分析方法也不能用于我们的密码系统。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Polyalphabetic Euclidean ciphers

First, we prove a fundamental theorem which describes some properties of elements of Euclidean rings. This theorem allows us to construct an infinite family of cryptosystems, among which there are cryptosystems without repetitions. This means that the encryption algorithm can encrypt any text so that all symbols after encryption are different. Therefore, methods of statistic analysis cannot be used against our cryptosystems even theoretically.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

2014 IEEE 8th International Conference on Application of Information and Communication Technologies (AICT)

自引率

0.00%

发文量