Publications
Preprints
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
Information for reviewers
Review process
How to peer review
Peer review policy
Register Dashboard
Search

Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen

Register Dashboard
Search
25
views
12
references
 Top references
cited by
1
    
0 reviews
 Review
0
comments
 Comment
0
recommends
+1 Recommend
0 collections
    0
    shares
      809
      similar
       All similar
      • Record: found
      • Abstract: not found
      • Book Chapter: not found
      Selected Areas in Cryptography 

      Luby-Racko. Ciphers: Why XOR Is Not So Exclusive

      other
      Author(s): , ,
      Publication date (Online):
      Publisher: Springer Berlin Heidelberg

      Read this book at

      Publisher
      Buy book
      Bookmark
          There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.

          Related collections

          Most cited references12

          • Record: found
          • Abstract: not found
          • Book Chapter: not found

          Reducibility among Combinatorial Problems

          Richard M Karp (1972)
          Article 0 comments Cited 157 times – based on 0 reviews
            Bookmark
            • Record: found
            • Abstract: not found
            • Article: not found

            How to construct random functions

            Oded Goldreich, Shafi Goldwasser, Silvio Micali (1986)
            Article 0 comments Cited 65 times – based on 0 reviews     Review now
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              How to Construct Pseudorandom Permutations from Pseudorandom Functions

              Michael Luby, Charles Rackoff (1988)
              Article 0 comments Cited 45 times – based on 0 reviews     Review now
                Bookmark
                All references

                Author and book information

                Book Chapter
                Publication date (Print): 2003
                Publication date (Online): February 17 2003
                Pages: 271-290
                DOI: 10.1007/3-540-36492-7_18
                SO-VID: 0ceee6e9-fd1e-4b0d-a05b-5e166d6c1a0c
                History

                Data availability:

                Comments

                Comment on this book

                Book chapters

                Similar content809

                See all similar

                Cited by1

                See all cited by