By Topic

Uniform random number generation by using sparse matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Jun Muramatsu ; NTT Commun. Sci. Labs., NTT Corp., Kyoto, Japan ; Shigeki Miyake

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.

Published in:

Information Theory Workshop (ITW), 2012 IEEE

Date of Conference:

3-7 Sept. 2012