发布求助
文献互助 智能选刊 最新文献

2020 International Symposium on Information Theory and Its Applications (ISITA)最新文献

筛选
英文 中文
Information leakage through passive timing attacks on RSA decryption system 通过被动定时攻击对RSA解密系统进行信息泄露
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.1587/transfun.2022tap0006
Tomonori Hirata, Y. Kaji
{"title":"Information leakage through passive timing attacks on RSA decryption system","authors":"Tomonori Hirata, Y. Kaji","doi":"10.1587/transfun.2022tap0006","DOIUrl":"https://doi.org/10.1587/transfun.2022tap0006","url":null,"abstract":"The threat of timing attacks is especially serious when an attacker actively controls the input to a target program. Countermeasures are studied to deter such active attacks, but the attacker still has the chance to learn something about the concealed information by passively watching the running time of the target program. The risk of passive timing attacks can be measured by the mutual information between the concealed information and the running time. However, the computation of the mutual information is hardly possible except for toy examples. This study focuses on three algorithms for RSA decryption, derives formulas of the mutual information under several assumptions and approximations, and calculates the mutual information numerically for practical security parameters.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"430 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115993376","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
Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding 解码不匹配的线性分组码集成错误概率的上界
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.1587/transfun.2021tap0001
T. Niinomi, H. Yagi, S. Hirasawa
{"title":"Upper Bounds on the Error Probability for the Ensemble of Linear Block Codes with Mismatched Decoding","authors":"T. Niinomi, H. Yagi, S. Hirasawa","doi":"10.1587/transfun.2021tap0001","DOIUrl":"https://doi.org/10.1587/transfun.2021tap0001","url":null,"abstract":"In this paper, applying the technique of the DS2 bound, we derive an upper bound on the error probability of mismatched decoding with the ensemble of linear block codes, which was defined by Hof, Sason and Shamai. Assuming the ensemble of random linear block codes defined by Gallager, we show that the obtained bound is not looser than the conventional bound.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116836436","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
An Equivalent Expression for the Wyner-Ziv Source Coding Problem Wyner-Ziv源编码问题的等价表达式
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.1587/transfun.2021tap0005
Tetsunao Matsuta, T. Uyematsu
{"title":"An Equivalent Expression for the Wyner-Ziv Source Coding Problem","authors":"Tetsunao Matsuta, T. Uyematsu","doi":"10.1587/transfun.2021tap0005","DOIUrl":"https://doi.org/10.1587/transfun.2021tap0005","url":null,"abstract":"We consider the coding problem for lossy source coding with side information at the decoder, which is known as the Wyner-Ziv source coding problem. The goal of the coding problem is to find the minimum rate such that the probability of exceeding a given distortion threshold is less than the desired level. We give an equivalent expression of the minimum rate by using the chromatic number and a notion of covering of a set. This allows us to analyze the coding problem in terms of graph coloring and covering.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121397304","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
The relation between Proportion test and Uniformity test in NIST SP800-22 NIST SP800-22中比例试验与均匀性试验的关系
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.34385/PROC.65.C01-8
Atsushi Iwasaki
{"title":"The relation between Proportion test and Uniformity test in NIST SP800-22","authors":"Atsushi Iwasaki","doi":"10.34385/PROC.65.C01-8","DOIUrl":"https://doi.org/10.34385/PROC.65.C01-8","url":null,"abstract":"NIST SP800-22 statistical test tool is one of the randomness test suites. It consists of 15 kinds of tests, and each test outputs the p-value for a sequence. Each test outputs multiple p-values when we test plural sequences. SP800-22 suggests to perform additional hypothesis tests for the multiple p-values, called the proportion test and the uniformity test, and judge the randomness of the tested sequences. To make a rational criterion for the two tests, the relation between the proportion test and the uniformity test is essential. In this paper, we derive the probability that both the proportion and uniformity tests simultaneously reject the null hypothesis. In the derivation process, we use a numerical method, but it is not a stochastic algorithm. Thus, we can ensure the properness of the derived value of the probability.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133111122","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
Decoding LDPC Codes with Probabilistic Local Maximum Likelihood Bit Flipping 基于概率局部最大似然位翻转的LDPC码译码
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.26076/4CC6-05E6
R. Mathews, C. Winstead
{"title":"Decoding LDPC Codes with Probabilistic Local Maximum Likelihood Bit Flipping","authors":"R. Mathews, C. Winstead","doi":"10.26076/4CC6-05E6","DOIUrl":"https://doi.org/10.26076/4CC6-05E6","url":null,"abstract":"Low-density parity-check (LDPC) codes are high-performance linear error correcting codes with application to communication channels and digital storage media. LDPC codes are decoded using graph algorithms wherein a channel message sample is decoded with the aid of information from its adjacent graph neighborhood, called the syndrome. This work studies the conditional probability of a channel error given syndrome information at a particular decoding iteration to formulate a new algorithm called Probabilistic Local Maximum Likelihood Bit Flipping (PLMLBF). The PLMLBF algorithm uses a three dimensional Multi-iteration Probability Flip Matrix (MIPFM) to quantify the frequency of errors in a noise corrupted message frame being decoded using a specific LDPC code. The matrix is used to probabilistically decode noise corrupted message frames. The motivation for this work is to provide a theoretical framework for constructing probabilistic and noisy bit-flipping algorithms, such as the Noisy Gradient Descent Bit Flipping (NGDBF) algorithm, which up to now have been mainly heuristic in nature.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130713611","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}
引用次数: 1
Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security 具有有意义共享的视觉密码方案的最优基矩阵及其安全性分析
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.1587/TRANSFUN.2020DMP0010
Kyohei Sekine, H. Koga
{"title":"Optimal Basis Matrices of a Visual Cryptography Scheme with Meaningful Shares and Analysis of Its Security","authors":"Kyohei Sekine, H. Koga","doi":"10.1587/TRANSFUN.2020DMP0010","DOIUrl":"https://doi.org/10.1587/TRANSFUN.2020DMP0010","url":null,"abstract":"The extended visual cryptography scheme (EVCS) proposed by Ateniese et al. is one variation of the visual cryptography scheme such that a secret image is recovered from certain qualified collections of meaningful shares that are distributed to respective participants. In this paper, we give a new definition of the EVCS for improving visibility of the recovered secret image as well as the shares. We construct optimal basis matrices with the minimum number of pixel expansion by solving a certain integer programming problem. We also analyze security of the EVCS meeting the new definition from information-theoretic viewpoint.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121543507","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
Multi-Carrier Differential Trellis-Coded Modulation/Demodulation Employing Multiple Differential Detection with Channel Prediction 采用多差分检测和信道预测的多载波差分栅格编码调制/解调
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.2299/JSP.25.163
Tetsuro Kubo, H. Kubo
{"title":"Multi-Carrier Differential Trellis-Coded Modulation/Demodulation Employing Multiple Differential Detection with Channel Prediction","authors":"Tetsuro Kubo, H. Kubo","doi":"10.2299/JSP.25.163","DOIUrl":"https://doi.org/10.2299/JSP.25.163","url":null,"abstract":"This paper proposes a multi-carrier (MC) modulation scheme employing differential trellis-coded modulation (DTCM) and multiple differential detection with channel prediction in order to cope with doubly-selective fading at the good required signal-to-noise power ratio (SNR), where doubly-selective channels correspond to severe time/frequency-selective channels. For frequency-selective fading, MC modulation schemes are effective. For time-selective fading, multiple differential detection employing per-survivor processing (PSP-MDD) with channel prediction is effective. However, channel prediction degrades the required SNR for PSP-MDD. In order to cope with doubly-selective fading and improve the required SNR, this paper proposes MC-DTCM employing PSP-MDD with channel prediction. Finally, computer simulation results show that the proposed scheme can improve both the performance for doubly-selective fading and the required SNR compared with the conventional PSP-MDD with channel prediction.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"12 1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131301331","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 Construction of Binary Punctured Linear Codes and A Supporting Method for Best Code Search 二进制穿孔线性码的构造及最优码搜索的支持方法
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-10-24 DOI: 10.1587/transfun.2021tap0007
Takuya Ohara, Makoto Takita, M. Morii
{"title":"A Construction of Binary Punctured Linear Codes and A Supporting Method for Best Code Search","authors":"Takuya Ohara, Makoto Takita, M. Morii","doi":"10.1587/transfun.2021tap0007","DOIUrl":"https://doi.org/10.1587/transfun.2021tap0007","url":null,"abstract":"Reduction of redundancy and improvement of error-correcting capability are essential research themes in the coding theory. The best codes constructed in various ways are recorded in a database maintained by Markus Grassl. In this paper, we propose an algorithm to construct the best code using punctured codes and a supporting method for constructing the best codes. First, we define a new evaluation function to determine deletion bits and propose an algorithm for constructing punctured linear codes. 36 best codes were constructed in the proposed algorithm, and 131 best codes were constructed by further modifying those best codes. Secondly, we evaluate the possibility of increasing the minimum distance based on the relationship between code length, information length, and minimum distance. We narrowed down the target (n,k) code to try the best code search based on the evaluation and found 30 other best codes.","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124604192","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
Decoding Algorithms of Monotone Codes and Azinv Codes and Their Unified View 单调码和Azinv码的译码算法及其统一观点
2020 International Symposium on Information Theory and Its Applications (ISITA) Pub Date : 2020-04-15 DOI: 10.1007/s10623-021-01004-0
Hokuto Takahashi, M. Hagiwara
{"title":"Decoding Algorithms of Monotone Codes and Azinv Codes and Their Unified View","authors":"Hokuto Takahashi, M. Hagiwara","doi":"10.1007/s10623-021-01004-0","DOIUrl":"https://doi.org/10.1007/s10623-021-01004-0","url":null,"abstract":"","PeriodicalId":347402,"journal":{"name":"2020 International Symposium on Information Theory and Its Applications (ISITA)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130066404","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}
引用次数: 2
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信