Andere Kunden interessierten sich auch für
![Management and Analysis of Bitstreams Generators for Xilinx FPGAs]( "Management and Analysis of Bitstreams Generators for Xilinx FPGAs")
Management and Analysis of Bitstreams Generators for Xilinx FPGAs44,99 €![Analysis And Design Of Secure Sealed-Bid Auction]( "Analysis And Design Of Secure Sealed-Bid Auction")
Analysis And Design Of Secure Sealed-Bid Auction51,99 €![Image Encryption Systems Design Using Chaotic & Non-Chaotic Generators]( "Image Encryption Systems Design Using Chaotic & Non-Chaotic Generators")
Image Encryption Systems Design Using Chaotic & Non-Chaotic Generators42,99 €![Some New Encryption Techniques Using Firewalls and Random Generators]( "Some New Encryption Techniques Using Firewalls and Random Generators")
Some New Encryption Techniques Using Firewalls and Random Generators44,99 €![Pseudorandom Number Generator]( "Pseudorandom Number Generator")
Pseudorandom Number Generator25,99 €![Secure Content Access and Replication in Peer-to-Peer Networks]( "Secure Content Access and Replication in Peer-to-Peer Networks")
Secure Content Access and Replication in Peer-to-Peer Networks51,99 €![Secure Biometrics]( "Secure Biometrics")
Secure Biometrics32,99 €
Random numbers are used in a lot of applications. In
particular, they are essential for most of
the cryptographic systems.
Pseudorandom generator is a mechanism for producing
random numbers on a deterministic computer. A
pseudorandom generator is said to be
cryptographically secure if its output cannot be
distinguished from uniformly random in a reasonable
time. In some cases, it is possible to prove that a
pseudorandom generator is cryptographically secure
under an assumption that a mathematical problem is
hard to solve. Such pseudorandom generators are
called provably secure.
This book accomplishes several goals. First, it
presents the security analysis of several existing
pseudorandom generators such as the classical RSA
generator and the recently developed Dual Elliptic
Curve generator. Second, it describes a new family of
provably secure pseudorandom generators. Third, the
security of complex cryptographic systems that use
pseudorandom generators is analyzed. Finally, the
book revisits the problem of converting random bits
into random numbers.
The book is intended for both mathematicians and
engineers.
particular, they are essential for most of
the cryptographic systems.
Pseudorandom generator is a mechanism for producing
random numbers on a deterministic computer. A
pseudorandom generator is said to be
cryptographically secure if its output cannot be
distinguished from uniformly random in a reasonable
time. In some cases, it is possible to prove that a
pseudorandom generator is cryptographically secure
under an assumption that a mathematical problem is
hard to solve. Such pseudorandom generators are
called provably secure.
This book accomplishes several goals. First, it
presents the security analysis of several existing
pseudorandom generators such as the classical RSA
generator and the recently developed Dual Elliptic
Curve generator. Second, it describes a new family of
provably secure pseudorandom generators. Third, the
security of complex cryptographic systems that use
pseudorandom generators is analyzed. Finally, the
book revisits the problem of converting random bits
into random numbers.
The book is intended for both mathematicians and
engineers.