利用稀疏矩阵生成均匀随机数

2012 IEEE Information Theory Workshop Pub Date : 2012-09-01 DOI:10.1109/ITW.2012.6404748

J. Muramatsu, S. Miyake

{"title":"利用稀疏矩阵生成均匀随机数","authors":"J. Muramatsu, S. Miyake","doi":"10.1109/ITW.2012.6404748","DOIUrl":null,"url":null,"abstract":"We investigate the problem of (independent) uniform random number generation and secret key agreement. A generator for the (independent) uniform random numbers is constructed by using a sparse matrix and it is applied to a secret key agreement protocol with strong secrecy. It is proved that the rate of the proposed codes can achieve the fundamental limits.","PeriodicalId":325771,"journal":{"name":"2012 IEEE Information Theory Workshop","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Uniform random number generation by using sparse matrix\",\"authors\":\"J. Muramatsu, S. Miyake\",\"doi\":\"10.1109/ITW.2012.6404748\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We investigate the problem of (independent) uniform random number generation and secret key agreement. A generator for the (independent) uniform random numbers is constructed by using a sparse matrix and it is applied to a secret key agreement protocol with strong secrecy. It is proved that the rate of the proposed codes can achieve the fundamental limits.\",\"PeriodicalId\":325771,\"journal\":{\"name\":\"2012 IEEE Information Theory Workshop\",\"volume\":\"52 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 IEEE Information Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITW.2012.6404748\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 IEEE Information Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITW.2012.6404748","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 5

摘要

研究了(独立的)一致随机数生成和密钥协议问题。利用稀疏矩阵构造了(独立)一致随机数生成器，并将其应用于具有强保密性的密钥协议中。实验证明，所提出的码率可以达到基本极限。

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

查看原文本刊更多论文

Uniform random number generation by using sparse matrix

We investigate the problem of (independent) uniform random number generation and secret key agreement. A generator for the (independent) uniform random numbers is constructed by using a sparse matrix and it is applied to a secret key agreement protocol with strong secrecy. It is proved that the rate of the proposed codes can achieve the fundamental limits.

求助全文

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

来源期刊

2012 IEEE Information Theory Workshop

自引率

0.00%

发文量