Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences最新文献

Post-Quantum Anonymous One-Sided Authenticated Key Exchange without Random Oracles 无随机预言机的后量子匿名单边认证密钥交换

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-09-01 DOI: 10.1587/transfun.2022dmp0001

Ren ISHIBASHI, Kazuki YONEYAMA

引用次数: 0

Detection of False Data Injection Attacks in Distributed State Estimation of Power Networks 分布式电网状态估计中假数据注入攻击的检测

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-05-01 DOI: 10.1587/transfun.2022map0010

Sho OBATA, Koichi KOBAYASHI, Yuh YAMASHITA

引用次数: 1

An Accuracy Reconfigurable Vector Accelerator based on Approximate Logarithmic Multipliers for Energy-Efficient Computing 一种基于近似对数乘法器的节能计算精度可重构矢量加速器

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-03-01 DOI: 10.1587/transfun.2022vlp0005

Lingxiao HOU, Yutaka MASUDA, Tohru ISHIHARA

{"title":"An Accuracy Reconfigurable Vector Accelerator based on Approximate Logarithmic Multipliers for Energy-Efficient Computing","authors":"Lingxiao HOU, Yutaka MASUDA, Tohru ISHIHARA","doi":"10.1587/transfun.2022vlp0005","DOIUrl":"https://doi.org/10.1587/transfun.2022vlp0005","url":null,"abstract":"The approximate logarithmic multiplier proposed by Mitchell provides an efficient alternative for processing dense multiplication or multiply-accumulate operations in applications such as image processing and real-time robotics. It offers the advantages of small area, high energy efficiency and is suitable for applications that do not necessarily achieve high accuracy. However, its maximum error of 11.1% makes it challenging to deploy in applications requiring relatively high accuracy. This paper proposes a novel operand decomposition method (OD) that decomposes one multiplication into the sum of multiple approximate logarithmic multiplications to widely reduce Mitchell multiplier errors while taking full advantage of its area savings. Based on the proposed OD method, this paper also proposes an accuracy reconfigurable multiply-accumulate (MAC) unit that provides multiple reconfigurable accuracies with high parallelism. Compared to a MAC unit consisting of accurate multipliers, the area is significantly reduced to less than half, improving the hardware parallelism while satisfying the required accuracy for various scenarios. The experimental results show the excellent applicability of our proposed MAC unit in image smoothing and robot localization and mapping application. We have also designed a prototype processor that integrates the minimum functionality of this MAC unit as a vector accelerator and have implemented a software-level accuracy reconfiguration in the form of an instruction set extension. We experimentally confirmed the correct operation of the proposed vector accelerator, which provides the different degrees of accuracy and parallelism at the software level.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"52 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135907374","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 1

Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices 用循环矩阵求解多项式的块同构问题

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-03-01 DOI: 10.1587/transfun.2022cip0002

Yasufumi Hashimoto

{"title":"Solving the Problem of Blockwise Isomorphism of Polynomials with Circulant Matrices","authors":"Yasufumi Hashimoto","doi":"10.1587/transfun.2022cip0002","DOIUrl":"https://doi.org/10.1587/transfun.2022cip0002","url":null,"abstract":"The problem of Isomorphism of Polynomials (IP problem) is known to be important to study the security of multivariate public key cryptosystems, one of the major candidates of post-quantum cryptography, against key recovery attacks. In these years, several schemes based on the IP problem itself or its generalization have been proposed. At PQCrypto 2020, Santoso introduced a generalization of the problem of Isomorphism of Polynomials, called the problem of Blockwise Isomorphism of Polynomials (BIP problem), and proposed a new Diffie-Hellman type encryption scheme based on this problem with Circulant matrices (BIPC problem). Quite recently, Ikematsu et al. proposed an attack called the linear stack attack to recover an equivalent key of Santoso's encryption scheme. While this attack reduced the security of the scheme, it does not contribute to solving the BIPC problem itself. In the present paper, we describe how to solve the BIPC problem directly by simplifying the BIPC problem due to the conjugation property of circulant matrices. In fact, we experimentally solved the BIPC problem with the parameter, which has 256 bit security by Santoso's security analysis and has 72.7bit security against the linear stack attack, by about 10 minutes.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136131356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Four classes of bivariate permutation polynomials over finite fields of even characteristic 偶特征有限域上的四类二元置换多项式

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eal2084

Changhui CHEN, Haibin KAN, Jie PENG, Li WANG

引用次数: 0

Efficient Realization of an SC Circuit with Feedback and Its Applications 带反馈的SC电路的高效实现及其应用

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1019

Yuto ARIMURA, Shigeru YAMASHITA

引用次数: 0

Joint AP Selection and Grey Wolf Optimization Based Pilot Design for Cell-Free Massive MIMO Systems 基于联合AP选择和灰狼优化的无小区大规模MIMO系统先导设计

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1085

Zelin LIU, Fangmin XU

引用次数: 0

Constructions of Boolean functions with five-valued Walsh spectra and their applications 五值Walsh谱布尔函数的构造及其应用

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023eap1064

Yingzhong ZHANG, Xiaoni DU, Wengang JIN, Xingbin QIAO

引用次数: 0

Hilbert series for systems of UOV polynomials UOV多项式系统的Hilbert级数

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023cip0019

Yasuhiko IKEMATSU, Tsunekazu SAITO

引用次数: 1

Input Data Format for Sparse Matrix in Quantum Annealing Emulator 量子退火仿真器中稀疏矩阵的输入数据格式

4区计算机科学

Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences Pub Date : 2023-01-01 DOI: 10.1587/transfun.2023vlp0002

Sohei SHIMOMAI, Kei UEDA, Shinji KIMURA

{"title":"Input Data Format for Sparse Matrix in Quantum Annealing Emulator","authors":"Sohei SHIMOMAI, Kei UEDA, Shinji KIMURA","doi":"10.1587/transfun.2023vlp0002","DOIUrl":"https://doi.org/10.1587/transfun.2023vlp0002","url":null,"abstract":"Recently, Quantum Annealing (QA) has attracted attention as an efficient algorithm for combinatorial optimization problems. In QA, the input data size becomes large and its reduction is important for accelerating by the hardware emulation since the usable memory size and its bandwidth are limited. The paper proposes the compression method of input sparse matrices for QA emulator. The proposed method uses the sparseness of the coefficient matrix and the reappearance of the same values. An independent table is introduced and data are compressed by the search and registration method of two consecutive data in the value table. The proposed method is applied to Traveling Salesman Problem (TSP) with 32, 64 and 96 cities and Nurse Scheduling Problem (NSP). The proposed method could reduce the amount of data by 1/40 for 96 city TSP and could manage 96 city TSP on the hardware emulator. When applied to NSP, we confirmed the effectiveness of the proposed method by the compression ratio ranging from 1/4 to 1/11.8. The data reduction is also useful for the simulation/emulation performance when using the compressed data directly and 1.9 times faster speed can be found on 96 city TSP than the CSR-based method.","PeriodicalId":55003,"journal":{"name":"Ieice Transactions on Fundamentals of Electronics Communications and Computer Sciences","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135699270","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0