关于$ t $ mod $ N $的因数分解个数和多用户的Diffie-Hellman密钥的概率分布

IF 0.7 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Advances in Mathematics of Communications Pub Date : 2023-01-01 DOI:10.3934/amc.2021029

A. Leibak

{"title":"关于$ t $ mod $ N $的因数分解个数和多用户的Diffie-Hellman密钥的概率分布","authors":"A. Leibak","doi":"10.3934/amc.2021029","DOIUrl":null,"url":null,"abstract":"We study the number <inline-formula><tex-math id=\"M3\">\\begin{document}$ R_n(t,N) $\\end{document}</tex-math></inline-formula> of tuplets <inline-formula><tex-math id=\"M4\">\\begin{document}$ (x_1,\\ldots, x_n) $\\end{document}</tex-math></inline-formula> of congruence classes modulo <inline-formula><tex-math id=\"M5\">\\begin{document}$ N $\\end{document}</tex-math></inline-formula> such that<disp-formula> <label/> <tex-math id=\"FE1\"> \\begin{document}$ \\begin{equation*} x_1\\cdots x_n \\equiv t \\pmod{N}. \\end{equation*} $\\end{document} </tex-math></disp-formula>As a result, we derive a recurrence for <inline-formula><tex-math id=\"M6\">\\begin{document}$ R_n(t,N) $\\end{document}</tex-math></inline-formula> and prove some multiplicative properties of <inline-formula><tex-math id=\"M7\">\\begin{document}$ R_n(t,N) $\\end{document}</tex-math></inline-formula>. Furthermore, we apply the result to study the probability distribution of Diffie-Hellman keys used in multiparty communication. We show that this probability distribution is not uniform.","PeriodicalId":50859,"journal":{"name":"Advances in Mathematics of Communications","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On the number of factorizations of $ t $ mod $ N $ and the probability distribution of Diffie-Hellman secret keys for many users\",\"authors\":\"A. Leibak\",\"doi\":\"10.3934/amc.2021029\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the number <inline-formula><tex-math id=\\\"M3\\\">\\\\begin{document}$ R_n(t,N) $\\\\end{document}</tex-math></inline-formula> of tuplets <inline-formula><tex-math id=\\\"M4\\\">\\\\begin{document}$ (x_1,\\\\ldots, x_n) $\\\\end{document}</tex-math></inline-formula> of congruence classes modulo <inline-formula><tex-math id=\\\"M5\\\">\\\\begin{document}$ N $\\\\end{document}</tex-math></inline-formula> such that<disp-formula> <label/> <tex-math id=\\\"FE1\\\"> \\\\begin{document}$ \\\\begin{equation*} x_1\\\\cdots x_n \\\\equiv t \\\\pmod{N}. \\\\end{equation*} $\\\\end{document} </tex-math></disp-formula>As a result, we derive a recurrence for <inline-formula><tex-math id=\\\"M6\\\">\\\\begin{document}$ R_n(t,N) $\\\\end{document}</tex-math></inline-formula> and prove some multiplicative properties of <inline-formula><tex-math id=\\\"M7\\\">\\\\begin{document}$ R_n(t,N) $\\\\end{document}</tex-math></inline-formula>. Furthermore, we apply the result to study the probability distribution of Diffie-Hellman keys used in multiparty communication. We show that this probability distribution is not uniform.\",\"PeriodicalId\":50859,\"journal\":{\"name\":\"Advances in Mathematics of Communications\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.7000,\"publicationDate\":\"2023-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Advances in Mathematics of Communications\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.3934/amc.2021029\",\"RegionNum\":4,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q3\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Mathematics of Communications","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.3934/amc.2021029","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}

引用次数: 0

摘要

We study the number \begin{document}$ R_n(t,N) $\end{document} of tuplets \begin{document}$ (x_1,\ldots, x_n) $\end{document} of congruence classes modulo \begin{document}$ N $\end{document} such that \begin{document}$ \begin{equation*} x_1\cdots x_n \equiv t \pmod{N}. \end{equation*} $\end{document} As a result, we derive a recurrence for \begin{document}$ R_n(t,N) $\end{document} and prove some multiplicative properties of \begin{document}$ R_n(t,N) $\end{document}. Furthermore, we apply the result to study the probability distribution of Diffie-Hellman keys used in multiparty communication. We show that this probability distribution is not uniform.

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

查看原文本刊更多论文

On the number of factorizations of $ t $ mod $ N $ and the probability distribution of Diffie-Hellman secret keys for many users

\begin{document}$ \begin{equation*} x_1\cdots x_n \equiv t \pmod{N}. \end{equation*} $\end{document}

As a result, we derive a recurrence for \begin{document}$ R_n(t,N) $\end{document} and prove some multiplicative properties of \begin{document}$ R_n(t,N) $\end{document}. Furthermore, we apply the result to study the probability distribution of Diffie-Hellman keys used in multiparty communication. We show that this probability distribution is not uniform.

求助全文

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

来源期刊

Advances in Mathematics of Communications 工程技术-计算机：理论方法

CiteScore

2.20

自引率

22.20%

发文量

审稿时长

>12 weeks

期刊介绍： Advances in Mathematics of Communications (AMC) publishes original research papers of the highest quality in all areas of mathematics and computer science which are relevant to applications in communications technology. For this reason, submissions from many areas of mathematics are invited, provided these show a high level of originality, new techniques, an innovative approach, novel methodologies, or otherwise a high level of depth and sophistication. Any work that does not conform to these standards will be rejected. Areas covered include coding theory, cryptology, combinatorics, finite geometry, algebra and number theory, but are not restricted to these. This journal also aims to cover the algorithmic and computational aspects of these disciplines. Hence, all mathematics and computer science contributions of appropriate depth and relevance to the above mentioned applications in communications technology are welcome. More detailed indication of the journal''s scope is given by the subject interests of the members of the board of editors.