0
Your cart

Your cart is empty

Books > Computing & IT > Applications of computing > Databases > Data security & data encryption

Buy Now

Advances in Cryptology - Proceedings of Crypto '84 (Paperback, 1985) Loot Price: R1,428 Discovery Miles 14 280
Advances in Cryptology - Proceedings of Crypto '84 (Paperback, 1985): G. R Blakely, David Chaum
Advances in Cryptology - Proceedings of Crypto '84 (Paperback, 1985): G. R Blakely, David Chaum

Share your images

Advances in Cryptology - Proceedings of Crypto '84 (Paperback, 1985)

G. R Blakely, David Chaum

Series: Lecture Notes in Computer Science, No. 196

 (sign in to rate)
Loot Price R1,428 Discovery Miles 14 280

Bookmark and Share

Usually dispatched within 7 - 15 working days.

Recently, there has been a lot of interest in provably "good" pseudo-random number generators [lo, 4, 14, 31. These cryptographically secure generators are "good" in the sense that they pass all probabilistic polynomial time statistical tests. However, despite these nice properties, the secure generators known so far suffer from the han- cap of being inefiicient; the most efiicient of these take n2 steps (one modular multip- cation, n being the length of the seed) to generate one bit. Pseudc-random number g- erators that are currently used in practice output n bits per multiplication (n2 steps). An important open problem was to output even two bits on each multiplication in a cryptographically secure way. This problem was stated by Blum, Blum & Shub [3] in the context of their z2 mod N generator. They further ask: how many bits can be o- put per multiplication, maintaining cryptographic security? In this paper we state a simple condition, the XOR-Condition and show that any generator satisfying this condition can output logn bits on each multiplication. We show that the XOR-Condition is satisfied by the lop least significant bits of the z2-mod N generator. The security of the z2 mod N generator was based on Quadratic Residu- ity [3]. This generator is an example of a Trapdoor Generator [13], and its trapdoor properties have been used in protocol design. We strengthen the security of this gene- tor by proving it as hard as factoring.

General

Imprint: Springer-Verlag
Country of origin: Germany
Series: Lecture Notes in Computer Science, No. 196
Release date: July 1985
First published: 1985
Editors: G. R Blakely • David Chaum
Dimensions: 234 x 156 x 25mm (L x W x T)
Format: Paperback - Trade
Pages: 508
Edition: 1985
ISBN-13: 978-3-540-15658-1
Barcode: 9783540156581
Categories: Promotions
Books > Computing & IT > Applications of computing > Databases > Data security & data encryption
Books > Computing & IT > General theory of computing
Books > Computing & IT > General theory of computing > General
LSN: 3-540-15658-5

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Loyalty partners