More efficient DDH pseudorandom generators

DOI10.1007/S10623-009-9329-4MaRDI QIDQ2380399zbMATH OpenOpenAlexFDO

Authors Hongsong Shi, Shaoquan Jiang, Zhiguang Qin

Publication date 26 March 2010

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-009-9329-4

zbMATH Keywords

pseudorandom generatorsdecisional Diffie-Hellman problem

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71)

Recommendations

• Efficient Pseudorandom Generators Based on the DDH Assumption
• scientific article; zbMATH DE number 1759796
• scientific article; zbMATH DE number 176069
• Efficient Primitives from Exponentiation in ℤ p
• scientific article; zbMATH DE number 1302855

Cites work

• scientific article; zbMATH DE number 1820017 (Why is no real title available?)
• scientific article; zbMATH DE number 5009203 (Why is no real title available?)
• scientific article; zbMATH DE number 3960854 (Why is no real title available?)
• scientific article; zbMATH DE number 1186931 (Why is no real title available?)
• scientific article; zbMATH DE number 1302855 (Why is no real title available?)
• scientific article; zbMATH DE number 2081057 (Why is no real title available?)
• scientific article; zbMATH DE number 1406771 (Why is no real title available?)
• A Pseudorandom Generator from any One-way Function
• A Simple Unpredictable Pseudo-Random Number Generator
• An improved pseudo-random generator based on the discrete logarithm problem
• Bit commitment using pseudorandomness
• Cryptography and Coding
• Efficient Pseudorandom Generators Based on the DDH Assumption
• Efficient cryptographic schemes provably as secure as subset sum
• How to Construct Pseudorandom Permutations from Pseudorandom Functions
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• How to turn loaded dice into fair coins
• Multirecipient Encryption Schemes: How to Save on Bandwidth and Computation Without Sacrificing Security
• New directions in cryptography
• Oblivious Transfer Is Symmetric
• On the Provable Security of an Efficient RSA-Based Pseudorandom Generator
• On the security of modular exponentiation with application to the construction of pseudorandom generators
• Probabilistic encryption
• Public Key Cryptography – PKC 2004
• QUAD: A Practical Stream Cipher with Provable Security
• RSA and Rabin Functions: Certain Parts are as Hard as the Whole
• Selecting cryptographic key sizes
• Simultaneous Security of Bits in the Discrete Log
• Stronger security proofs for RSA and Rabin bits.
• Tiny families of functions with random properties: a quality-size trade-off for hashing (preliminary version)

Cited in

(3)

• The distinction between fixed and random generators in group-based assumptions
• Distribution of exponential functions modulo a prime power
• Efficient Pseudorandom Generators Based on the DDH Assumption

Describes a project that uses

Uses Software

• QUAD

This page was built for publication: More efficient DDH pseudorandom generators

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380399)