Abstract
We propose a characterization for the roots of power residues modulo powers of two. By this characterization, the remainder of dividing a root by a power of two is uniformly distributed in a set with two odd integers, while the quotient is uniformly distributed in an initial segment of positive integers. This property allows us to generate roots of power residues modulo powers of two efficiently.
Subject
General Mathematics,Engineering (miscellaneous),Computer Science (miscellaneous)
Reference22 articles.
1. Digitalized Signatures and Public-Key Functions as Intractable as Factorization;Rabin,1979
2. Probabilistic Encryption and How to Play Mental Poker Keeping Secret All Partial Information;Goldwasser,1982
3. Probabilistic encryption
4. A Simple Unpredictable Pseudo-Random Number Generator
5. An Identity Based Encryption Scheme Based on Quadratic Residues;Cocks,2001