Pseudorandomness and Cryptographic Applications

Pseudorandomness and Cryptographic Applications

The book stresses rigorous definitions and proofs.

Author: Michael Luby

Publisher: Princeton University Press

ISBN: 9780691206844

Category: Mathematics

Page: 248

View: 585

A pseudorandom generator is an easy-to-compute function that stretches a short random string into a much longer string that "looks" just like a random string to any efficient adversary. One immediate application of a pseudorandom generator is the construction of a private key cryptosystem that is secure against chosen plaintext attack. There do not seem to be natural examples of functions that are pseudorandom generators. On the other hand, there do seem to be a variety of natural examples of another basic primitive: the one-way function. A function is one-way if it is easy to compute but hard for any efficient adversary to invert on average. The first half of the book shows how to construct a pseudorandom generator from any one-way function. Building on this, the second half of the book shows how to construct other useful cryptographic primitives, such as private key cryptosystems, pseudorandom function generators, pseudorandom permutation generators, digital signature schemes, bit commitment protocols, and zero-knowledge interactive proof systems. The book stresses rigorous definitions and proofs.
Categories: Mathematics

Cryptographic Applications of Analytic Number Theory

Cryptographic Applications of Analytic Number Theory

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems.

Author: Igor Shparlinski

Publisher: Birkhäuser

ISBN: 9783034880374

Category: Mathematics

Page: 414

View: 223

The book introduces new techniques that imply rigorous lower bounds on the com plexity of some number-theoretic and cryptographic problems. It also establishes certain attractive pseudorandom properties of various cryptographic primitives. These methods and techniques are based on bounds of character sums and num bers of solutions of some polynomial equations over finite fields and residue rings. Other number theoretic techniques such as sieve methods and lattice reduction algorithms are used as well. The book also contains a number of open problems and proposals for further research. The emphasis is on obtaining unconditional rigorously proved statements. The bright side of this approach is that the results do not depend on any assumptions or conjectures. On the downside, the results are much weaker than those which are widely believed to be true. We obtain several lower bounds, exponential in terms of logp, on the degrees and orders of o polynomials; o algebraic functions; o Boolean functions; o linear recurrence sequences; coinciding with values of the discrete logarithm modulo a prime p at sufficiently many points (the number of points can be as small as pI/2+O:). These functions are considered over the residue ring modulo p and over the residue ring modulo an arbitrary divisor d of p - 1. The case of d = 2 is of special interest since it corresponds to the representation of the rightmost bit of the discrete logarithm and defines whether the argument is a quadratic residue.
Categories: Mathematics

Cryptographic Applications of Analytic Number Theory

Cryptographic Applications of Analytic Number Theory

The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will find this book useful.

Author: Igor E. Shparlinski

Publisher:

ISBN: 0817666540

Category: Mathematics

Page: 411

View: 476

The book introduces new ways of using analytic number theory in cryptography and related areas, such as complexity theory and pseudorandom number generation. Cryptographers and number theorists will find this book useful. The former can learn about new number theoretic techniques which have proved to be invaluable cryptographic tools, the latter about new challenging areas of applications of their skills.
Categories: Mathematics

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

This paper discusses some aspects of selecting and testingrandom and pseudorandom number generators.

Author: nist

Publisher:

ISBN: 1494461072

Category:

Page: 134

View: 531

This paper discusses some aspects of selecting and testingrandom and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographicapplications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject ofstatistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e.,statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.
Categories:

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

This paper discusses some aspects of selecting and testing random and pseudorandom number generators.

Author:

Publisher:

ISBN: OCLC:927735513

Category:

Page:

View: 991

This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject of statistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e., statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.
Categories:

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications

This paper discusses some aspects of selecting and testing random and pseudorandom number generators.

Author: Andrew Rukhin

Publisher:

ISBN: OCLC:227969011

Category:

Page: 163

View: 846

This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject of statistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e., statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.
Categories:

Nist Special Publication 800 122 Revision 1a

Nist Special Publication 800 122 Revision 1a

This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material.

Author: U.s. Department of Commerce

Publisher: CreateSpace

ISBN: 1496009908

Category: Reference

Page: 130

View: 334

This paper discusses some aspects of selecting and testing random and pseudorandom number generators. The outputs of such generators may be used in many cryptographic applications, such as the generation of key material. Generators suitable for use in cryptographic applications may need to meet stronger requirements than for other applications. In particular, their outputs must be unpredictable in the absence of knowledge of the inputs. Some criteria for characterizing and selecting appropriate generators are discussed in this document. The subject of statistical testing and its relation to cryptanalysis is also discussed, and some recommended statistical tests are provided. These tests may be useful as a first step in determining whether or not a generator is suitable for a particular cryptographic application. However, no set of statistical tests can absolutely certify a generator as appropriate for usage in a particular application, i.e., statistical testing cannot serve as a substitute for cryptanalysis. The design and cryptanalysis of generators is outside the scope of this paper.
Categories: Reference

Foundations of Cryptography Volume 2 Basic Applications

Foundations of Cryptography  Volume 2  Basic Applications

This second volume contains a thorough treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols.

Author: Oded Goldreich

Publisher: Cambridge University Press

ISBN: 9781107393974

Category: Computers

Page:

View: 962

Cryptography is concerned with the conceptualization, definition and construction of computing systems that address security concerns. The design of cryptographic systems must be based on firm foundations. Foundations of Cryptography presents a rigorous and systematic treatment of foundational issues, defining cryptographic tasks and solving cryptographic problems. The emphasis is on the clarification of fundamental concepts and on demonstrating the feasibility of solving several central cryptographic problems, as opposed to describing ad-hoc approaches. This second volume contains a thorough treatment of three basic applications: Encryption, Signatures, and General Cryptographic Protocols. It builds on the previous volume, which provided a treatment of one-way functions, pseudorandomness, and zero-knowledge proofs. It is suitable for use in a graduate course on cryptography and as a reference book for experts. The author assumes basic familiarity with the design and analysis of algorithms; some knowledge of complexity theory and probability is also useful.
Categories: Computers

SIAM Journal on Computing

SIAM Journal on Computing

( 7 ) M . BLUM AND S . GOLDWASSER , An efficient probabilistic encryption
scheme which hides all partial information , in ... ( 20 ) O . GOLDREICH , S .
GOLDWASSER , AND S . MICALI , On the cryptographic applications of random
functions ... ( 27 ) J . HÅSTAD , R . IMPAGLIAZZO , L . A . LEVIN , AND M . LUBY ,
A pseudorandom generator from any one - way function , SIAM J . Comput . , 28 (
1999 ) , pp .

Author: Society for Industrial and Applied Mathematics

Publisher:

ISBN: UOM:39015065057666

Category: Electronic data processing

Page:

View: 195

Categories: Electronic data processing

Proceedings of the Thirty first Annual ACM Symposium on Theory of Computing

Proceedings of the Thirty first Annual ACM Symposium on Theory of Computing

( 18 ) L. Levin , One - way Functions and PseudoRandom Generators , in
Combinatorica , vol . 7 , n . 4 , 1987 . ( 19 ) M. Luby , Pseudo - Randomness and
Cryptographic Applications , Princeton University Press , Princeton , NJ , 1996 .

Author:

Publisher:

ISBN: UCSC:32106015047209

Category: Atlanta, GA

Page: 790

View: 419

Categories: Atlanta, GA

Encryption Schemes

Encryption Schemes

[ 45 ] J. KATZ AND M. YUNG , “ Unforgeable Encryption and Adaptively Secure
Modes of Operation , ” Fast Software Encryption 7 , Springer Verlag ( 2000 ) . ( 46
) M. LUBY , Pseudorandomness and Cryptographic Applications , Princeton ...

Author: Anand Desai

Publisher:

ISBN: UCSD:31822028497048

Category:

Page: 240

View: 108

Categories:

Modern Cryptography Probabilistic Proofs and Pseudorandomness

Modern Cryptography  Probabilistic Proofs and Pseudorandomness

This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness.

Author: Oded Goldreich

Publisher: Springer Science & Business Media

ISBN: 9783662125212

Category: Mathematics

Page: 183

View: 594

Cryptography is one of the most active areas in current mathematics research and applications. This book focuses on cryptography along with two related areas: the study of probabilistic proof systems, and the theory of computational pseudorandomness. Following a common theme that explores the interplay between randomness and computation, the important notions in each field are covered, as well as novel ideas and insights.
Categories: Mathematics

Random Number Generation on Handheld Devices for Cryptographic Applications

Random Number Generation on Handheld Devices for Cryptographic Applications

Random number generation is important in many fields today.

Author: Adam W. Montville

Publisher:

ISBN: OCLC:56729267

Category: Data encryption (Computer science)

Page: 136

View: 844

Random number generation is important in many fields today. It is particularly important in the field of cryptography when generating nonce values, cryptographic keys, and other data required in many cryptographic applications. The proliferation of small, handheld devices that are typically connected to large networks via a wireless connection requires stringent security. Because it may be easier to attack a pseudorandom number generator than to attack a particular cryptosystem, it is important that the generation of random numbers on handheld devices be as secure as possible. In order for the random number generator to provide good, secure "random" data, it must first be seeded by a value that, itself, possesses the qualities of a good random sequence. This paper explores several potential seed sources that are available on many current handheld devices.
Categories: Data encryption (Computer science)

The Journal of Combinatorial Mathematics and Combinatorial Computing

The Journal of Combinatorial Mathematics and Combinatorial Computing

Modern Cryptography , Probabilistic Proofs and Pseudorandomness . Springer -
Verlag , 1999 . ... Orthogonal Arrays : Theory and Applications . Springer - Verlag
... Pseudorandomness and Cryptographic Applications . Princeton University ...

Author:

Publisher:

ISBN: CORNELL:31924074897459

Category: Combinatorial analysis

Page:

View: 903

Categories: Combinatorial analysis

Introduction to Cryptography

Introduction to Cryptography

The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols.

Author: Hans Delfs

Publisher: Springer

ISBN: 9783662479742

Category: Computers

Page: 508

View: 653

The first part of this book covers the key concepts of cryptography on an undergraduate level, from encryption and digital signatures to cryptographic protocols. Essential techniques are demonstrated in protocols for key exchange, user identification, electronic elections and digital cash. In the second part, more advanced topics are addressed, such as the bit security of one-way functions and computationally perfect pseudorandom bit generators. The security of cryptographic schemes is a central topic. Typical examples of provably secure encryption and signature schemes and their security proofs are given. Though particular attention is given to the mathematical foundations, no special background in mathematics is presumed. The necessary algebra, number theory and probability theory are included in the appendix. Each chapter closes with a collection of exercises. In the second edition the authors added a complete description of the AES, an extended section on cryptographic hash functions, and new sections on random oracle proofs and public-key encryption schemes that are provably secure against adaptively-chosen-ciphertext attacks. The third edition is a further substantive extension, with new topics added, including: elliptic curve cryptography; Paillier encryption; quantum cryptography; the new SHA-3 standard for cryptographic hash functions; a considerably extended section on electronic elections and Internet voting; mix nets; and zero-knowledge proofs of shuffles. The book is appropriate for undergraduate and graduate students in computer science, mathematics, and engineering.
Categories: Computers

Proceedings of the Military Government and Aerospace Simulation Symposium

Proceedings of the Military  Government and Aerospace Simulation Symposium

PSEUDORANDOM NUMBER GENERATORS IN CRYPTOGRAPHY Like
stochastic simulations , most cryptographic applications require some source of
randomness . Examples include session key generation for symmetric ciphers ,
finding ...

Author: Michael J. Chinni

Publisher:

ISBN: CORNELL:31924070717669

Category: Airplanes

Page: 269

View: 389

Categories: Airplanes