首页 > 最新文献

AUTOMATIC CONTROL AND COMPUTER SCIENCES最新文献

英文 中文
Decimation of M Sequences As a Way of Obtaining Primitive Polynomials 作为获取原始多项式的一种方法对 M 序列进行十进制处理
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080138
D. V. Kushnir, S. N. Shemyakin

One approach to obtain a cryptographically strong encryption gamma is to use linear-feedback shift registers defined by primitive polynomials. The ability to quickly select the appropriate polynomial can provide the required degree of security of the stream cipher. Currently, primitive polynomials for sufficiently large degrees are known, but usually these are so-called sparse polynomials. To increase the correlational stability, it is necessary to be able to quickly generate new primitive polynomials of the given degrees, which is the focus of this study.

摘要--获得加密强度高的加密伽马的一种方法是使用由原始多项式定义的线性反馈移位寄存器。快速选择适当多项式的能力可以提供流密码所需的安全等级。目前,人们已经知道足够大度的基元多项式,但这些多项式通常是所谓的稀疏多项式。为了提高相关稳定性,必须能够快速生成给定度数的新原始多项式,这正是本研究的重点。
{"title":"Decimation of M Sequences As a Way of Obtaining Primitive Polynomials","authors":"D. V. Kushnir,&nbsp;S. N. Shemyakin","doi":"10.3103/S0146411623080138","DOIUrl":"10.3103/S0146411623080138","url":null,"abstract":"<p>One approach to obtain a cryptographically strong encryption gamma is to use linear-feedback shift registers defined by primitive polynomials. The ability to quickly select the appropriate polynomial can provide the required degree of security of the stream cipher. Currently, primitive polynomials for sufficiently large degrees are known, but usually these are so-called sparse polynomials. To increase the correlational stability, it is necessary to be able to quickly generate new primitive polynomials of the given degrees, which is the focus of this study.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"928 - 932"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001692","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Method for Detecting Manipulation Attacks on Recommender Systems with Collaborative Filtering 检测对协同过滤推荐系统的操纵攻击的方法
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080047
A. D. Dakhnovich, D. S. Zagalsky, R. S. Solovey

The security of recommendation systems with collaborative filtering from manipulation attacks is considered. The most common types of attacks are analyzed and identified. A modified method for detecting manipulation attacks on recommendation systems with collaborative filtering is proposed. Experimental testing and a comparison of the effectiveness of the modified method with other current methods are carried out.

本文探讨了协同过滤推荐系统免受操纵攻击的安全性问题。分析并确定了最常见的攻击类型。提出了一种检测协同过滤推荐系统操纵攻击的改进方法。还进行了实验测试,并比较了改进方法与其他现有方法的有效性。
{"title":"Method for Detecting Manipulation Attacks on Recommender Systems with Collaborative Filtering","authors":"A. D. Dakhnovich,&nbsp;D. S. Zagalsky,&nbsp;R. S. Solovey","doi":"10.3103/S0146411623080047","DOIUrl":"10.3103/S0146411623080047","url":null,"abstract":"<p>The security of recommendation systems with collaborative filtering from manipulation attacks is considered. The most common types of attacks are analyzed and identified. A modified method for detecting manipulation attacks on recommendation systems with collaborative filtering is proposed. Experimental testing and a comparison of the effectiveness of the modified method with other current methods are carried out.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"868 - 874"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142414910","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Analysis of Cryptographic Protection of the Bitcoin Core Cryptographic Wallet 比特币核心加密钱包的加密保护分析
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080278
P. V. Semyanov, S. V. Grezina

This article discusses the security of implementing encryption for the Bitcoin Core cryptocurrency wallet. Particular attention is paid to aspects of the practical use of cryptographic algorithms when encrypting the wallet.dat file with a password. Practical resistance to brute-force attacks using parallel computing on GPUs is also considered. It is discovered that Bitcoin Core does not implement changing the encryption key for the user’s private keys. This implementation makes it possible to carry out a second attack on the wallet without knowing the new password, if it has already been compromised previously. Changes to encryption algorithms are also been proposed to make brute-force attacks more difficult on the GPU.

摘要-- 本文讨论了为比特币核心加密货币钱包实施加密的安全性。在用密码加密 wallet.dat 文件时,特别关注加密算法的实际使用方面。此外,还考虑了利用 GPU 上的并行计算抵御暴力破解攻击的实用方法。研究发现,Bitcoin Core 没有实现更改用户私钥的加密密钥。这种实现方式使得在不知道新密码的情况下对钱包进行第二次攻击成为可能,如果钱包之前已经被攻破的话。还有人建议修改加密算法,以增加 GPU 上暴力破解攻击的难度。
{"title":"Analysis of Cryptographic Protection of the Bitcoin Core Cryptographic Wallet","authors":"P. V. Semyanov,&nbsp;S. V. Grezina","doi":"10.3103/S0146411623080278","DOIUrl":"10.3103/S0146411623080278","url":null,"abstract":"<p>This article discusses the security of implementing encryption for the Bitcoin Core cryptocurrency wallet. Particular attention is paid to aspects of the practical use of cryptographic algorithms when encrypting the wallet.dat file with a password. Practical resistance to brute-force attacks using parallel computing on GPUs is also considered. It is discovered that Bitcoin Core does not implement changing the encryption key for the user’s private keys. This implementation makes it possible to carry out a second attack on the wallet without knowing the new password, if it has already been compromised previously. Changes to encryption algorithms are also been proposed to make brute-force attacks more difficult on the GPU.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"914 - 921"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001683","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph-Based Self-Regulation for Different Types of Networks with Adaptive Topology 针对具有自适应拓扑的不同类型网络的基于图的自调节功能
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080217
E. Yu. Pavlenko, M. A. Pakhomov

This article presents graph theory-based approaches to self-regulation of networks with adaptive network topology. These approaches are limited to networks with no node mobility—peer-to-peer and heterogeneous sensor networks, as well as industrial networks on the example of Smart Grid smart energy consumption networks. For each network type, a generalized target function is described, conditions for self-regulation are formulated, and a formal description of the process of self-regulation is provided.

摘要-本文介绍了基于图论的自适应网络拓扑网络自我调节方法。这些方法仅限于无节点移动性的网络--点对点网络和异构传感器网络,以及以智能电网智能能耗网络为例的工业网络。针对每种网络类型,都描述了广义的目标函数,提出了自我调节的条件,并对自我调节过程进行了正式描述。
{"title":"Graph-Based Self-Regulation for Different Types of Networks with Adaptive Topology","authors":"E. Yu. Pavlenko,&nbsp;M. A. Pakhomov","doi":"10.3103/S0146411623080217","DOIUrl":"10.3103/S0146411623080217","url":null,"abstract":"<p>This article presents graph theory-based approaches to self-regulation of networks with adaptive network topology. These approaches are limited to networks with no node mobility—peer-to-peer and heterogeneous sensor networks, as well as industrial networks on the example of Smart Grid smart energy consumption networks. For each network type, a generalized target function is described, conditions for self-regulation are formulated, and a formal description of the process of self-regulation is provided.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"1055 - 1062"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888804","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Features of Detecting Malicious Installation Files Using Machine Learning Algorithms 使用机器学习算法检测恶意安装文件的特点
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080333
P. E. Yugai, E. V. Zhukovskii, P. O. Semenov

This paper presents a study of the possibility of using machine learning methods to detect malicious installation files related to the type of Trojan installers and downloaders. A comparative analysis of machine learning algorithms applicable for the solution of this problem is provided: the naive Bayes classifier (NBC), random forest, and C4.5 algorithm. Machine learning models are developed using the Weka software. The most significant attributes of installation files of legitimate and Trojan programs are highlighted.

摘要 本文研究了使用机器学习方法检测与木马安装程序和下载程序类型有关的恶意安装文件的可能性。本文对适用于解决这一问题的机器学习算法进行了比较分析:奈夫贝叶斯分类器(NBC)、随机森林和 C4.5 算法。机器学习模型使用 Weka 软件开发。突出了合法程序和木马程序安装文件的最重要属性。
{"title":"Features of Detecting Malicious Installation Files Using Machine Learning Algorithms","authors":"P. E. Yugai,&nbsp;E. V. Zhukovskii,&nbsp;P. O. Semenov","doi":"10.3103/S0146411623080333","DOIUrl":"10.3103/S0146411623080333","url":null,"abstract":"<p>This paper presents a study of the possibility of using machine learning methods to detect malicious installation files related to the type of Trojan installers and downloaders. A comparative analysis of machine learning algorithms applicable for the solution of this problem is provided: the naive Bayes classifier (NBC), random forest, and C4.5 algorithm. Machine learning models are developed using the Weka software. The most significant attributes of installation files of legitimate and Trojan programs are highlighted.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"968 - 974"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888816","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A Method of Network Access Control for Ensuring Network Infrastructure Security Based on Severing Superfluous Network Connectivity 一种基于切断多余网络连接确保网络基础设施安全的网络访问控制方法
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080308
A. D. Shilova, A. A. Vorob’eva

This paper discusses problems of improving network infrastructure security. A network infrastructure is developed; an access control method based on severing superfluous network connectivity between subjects and objects is proposed and assessed; and potential directions of its development are outlined. This method can be used for network segmentation.

摘要--本文讨论了提高网络基础设施安全性的问题。本文开发了一种网络基础设施,提出并评估了一种基于切断主体和客体之间多余网络连接的访问控制方法,并概述了其潜在的发展方向。该方法可用于网络分割。
{"title":"A Method of Network Access Control for Ensuring Network Infrastructure Security Based on Severing Superfluous Network Connectivity","authors":"A. D. Shilova,&nbsp;A. A. Vorob’eva","doi":"10.3103/S0146411623080308","DOIUrl":"10.3103/S0146411623080308","url":null,"abstract":"<p>This paper discusses problems of improving network infrastructure security. A network infrastructure is developed; an access control method based on severing superfluous network connectivity between subjects and objects is proposed and assessed; and potential directions of its development are outlined. This method can be used for network segmentation.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"1116 - 1125"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140889943","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Protection of Computational Machine Learning Models against Extraction Threat 保护计算机器学习模型免受提取威胁
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080084
M. O. Kalinin, M. D. Soshnev, A. S. Konoplev

The extraction threat to machine learning models is considered. Most contemporary methods of defense against the extraction of computational machine learning models are based on the use of a protective noise mechanism. The main disadvantage inherent in the noise mechanism is that it reduces the precision of the model’s output. The requirements for the efficient methods of protecting the machine learning models from extraction are formulated, and a new method of defense against this threat, supplementing the noise with a distillation mechanism, is presented. It is experimentally shown that the developed method provides the resistance of machine learning models to extraction threat while maintaining the quality their operating results due to the transformation of protected models into the other simplified models equivalent to the original ones.

摘要 本文探讨了机器学习模型的提取威胁。当代大多数防御机器学习模型抽取的方法都是基于保护性噪声机制的使用。噪声机制固有的主要缺点是降低了模型输出的精度。本文提出了保护机器学习模型不被提取的有效方法的要求,并介绍了一种防御这种威胁的新方法,即用蒸馏机制来补充噪声。实验表明,所开发的方法可使机器学习模型免受提取威胁,同时由于受保护模型会转化为与原始模型等效的其他简化模型,因此可保持其运行结果的质量。
{"title":"Protection of Computational Machine Learning Models against Extraction Threat","authors":"M. O. Kalinin,&nbsp;M. D. Soshnev,&nbsp;A. S. Konoplev","doi":"10.3103/S0146411623080084","DOIUrl":"10.3103/S0146411623080084","url":null,"abstract":"<p>The extraction threat to machine learning models is considered. Most contemporary methods of defense against the extraction of computational machine learning models are based on the use of a protective noise mechanism. The main disadvantage inherent in the noise mechanism is that it reduces the precision of the model’s output. The requirements for the efficient methods of protecting the machine learning models from extraction are formulated, and a new method of defense against this threat, supplementing the noise with a distillation mechanism, is presented. It is experimentally shown that the developed method provides the resistance of machine learning models to extraction threat while maintaining the quality their operating results due to the transformation of protected models into the other simplified models equivalent to the original ones.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"996 - 1004"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888814","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Stability Analysis of the Architecture of Messaging Systems with a Decentralized Node Structure 具有分散节点结构的信息传递系统架构的稳定性分析
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080205
E. M. Orel, D. A. Moskvin, I. A. Anoshkin

The results of an architecture stability analysis of messaging systems with a decentralized node structure Briar and Bridgefy are presented. Mathematical models of target systems are developed and protocols for generating keys, establishing connections, and transferring data between the systems’ users are described. The key features of the architecture of messaging systems with a decentralized nodal structure are highlighted. The main classes of threats to target systems are given.

摘要 介绍了对具有分散节点结构 Briar 和 Bridgefy 的消息传递系统的结构稳定性分析结果。本文建立了目标系统的数学模型,并描述了系统用户之间生成密钥、建立连接和传输数据的协议。重点介绍了具有分散节点结构的消息传递系统架构的主要特点。给出了目标系统面临的主要威胁类别。
{"title":"Stability Analysis of the Architecture of Messaging Systems with a Decentralized Node Structure","authors":"E. M. Orel,&nbsp;D. A. Moskvin,&nbsp;I. A. Anoshkin","doi":"10.3103/S0146411623080205","DOIUrl":"10.3103/S0146411623080205","url":null,"abstract":"<p>The results of an architecture stability analysis of messaging systems with a decentralized node structure Briar and Bridgefy are presented. Mathematical models of target systems are developed and protocols for generating keys, establishing connections, and transferring data between the systems’ users are described. The key features of the architecture of messaging systems with a decentralized nodal structure are highlighted. The main classes of threats to target systems are given.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"1033 - 1039"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140888885","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Improving the Quality of the Identification of the Information Security State Based on Sample Segmentation 基于样本细分提高信息安全状态识别质量
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080321
M. E. Sukhoparov, I. S. Lebedev

Increasing the quality indicators for identifying the information security (IS) state of individual segments of cyber-physical systems is related to processing large information arrays. A method for improving quality indicators when solving problems of identifying the IS state is proposed. Its implementation is based on the formation of individual sample segments. Analysis of the properties of these segments makes it possible to select and assign algorithms that have the best quality indicators in the current segment. Segmentation of a data sample is considered. Using real dataset data as an example, experimental values of the quality indicator for the proposed method are given for various classifiers on individual segments and the entire sample.

摘要 提高识别网络物理系统各部分信息安全(IS)状态的质量指标与处理大型信息阵列有关。本文提出了一种在解决信息安全状态识别问题时提高质量指标的方法。该方法的实施基于单个样本段的形成。通过分析这些片段的属性,可以选择和分配当前片段中质量指标最好的算法。考虑了数据样本的分段。以真实数据集数据为例,给出了各种分类器在单个片段和整个样本上的质量指标实验值。
{"title":"Improving the Quality of the Identification of the Information Security State Based on Sample Segmentation","authors":"M. E. Sukhoparov,&nbsp;I. S. Lebedev","doi":"10.3103/S0146411623080321","DOIUrl":"10.3103/S0146411623080321","url":null,"abstract":"<p>Increasing the quality indicators for identifying the information security (IS) state of individual segments of cyber-physical systems is related to processing large information arrays. A method for improving quality indicators when solving problems of identifying the IS state is proposed. Its implementation is based on the formation of individual sample segments. Analysis of the properties of these segments makes it possible to select and assign algorithms that have the best quality indicators in the current segment. Segmentation of a data sample is considered. Using real dataset data as an example, experimental values of the quality indicator for the proposed method are given for various classifiers on individual segments and the entire sample.</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"1071 - 1075"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001448","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Investigation of the Structure of the Isogeny Graph for Postquantum Cryptography Protocols 后量子密码学协议同源图结构研究
IF 0.6 Q4 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-02-29 DOI: 10.3103/S0146411623080102
S. O. Kostin, E. B. Aleksandrova

The isogeny graphs of supersingular curves are one of the promising mathematical structures in postquantum cryptography algorithms. However, the recently reported attack on the SIDH protocol [1] demonstrates that the isogeny graphs require a more detailed investigation when applied to real protocols. In this study, we analyze the structure of the graphs of isogenies of degree (ell > 2) and consider the set of vertices of a special type to which an attack on reconstruction of the path in the graph is applicable [7].

摘要超星曲线的同源图是后量子加密算法中很有前途的数学结构之一。然而,最近报道的对 SIDH 协议的攻击[1]表明,在应用于实际协议时,需要对等值图进行更详细的研究。在本研究中,我们分析了度数为 (ell > 2) 的同源图的结构,并考虑了一种特殊类型的顶点集,对该顶点集的攻击适用于重建图中的路径[7]。
{"title":"Investigation of the Structure of the Isogeny Graph for Postquantum Cryptography Protocols","authors":"S. O. Kostin,&nbsp;E. B. Aleksandrova","doi":"10.3103/S0146411623080102","DOIUrl":"10.3103/S0146411623080102","url":null,"abstract":"<p>The isogeny graphs of supersingular curves are one of the promising mathematical structures in postquantum cryptography algorithms. However, the recently reported attack on the SIDH protocol [1] demonstrates that the isogeny graphs require a more detailed investigation when applied to real protocols. In this study, we analyze the structure of the graphs of isogenies of degree <span>(ell &gt; 2)</span> and consider the set of vertices of a special type to which an attack on reconstruction of the path in the graph is applicable [7].</p>","PeriodicalId":46238,"journal":{"name":"AUTOMATIC CONTROL AND COMPUTER SCIENCES","volume":"57 8","pages":"904 - 913"},"PeriodicalIF":0.6,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140001597","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
AUTOMATIC CONTROL AND COMPUTER SCIENCES
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1