Skip to primary content
Skip to secondary content

in theory

"Marge, I agree with you – in theory. In theory, communism works. In theory." — Homer Simpson

in   theory

Main menu

  • Home
  • About
  • LaTeX to WordPress
    • Download
    • LaTeX2WP Example
    • Using LaTeX2WP
  • Lecture Notes

Tag Archives: Luby-Rackoff

CS276 Lecture 16: Pseudorandom Permutations

Posted on March 16, 2009 by luca
Reply

Scribed by Anupam Prakash

Summary

Today we finish the analysis of a construction of a pseudorandom permutation (block cipher) given a pseudorandom function.

Continue reading →

Posted in CS276 | Tagged Luby-Rackoff, pseu, pseudorandom function, pseudorandom permutation | Leave a reply

CS276 Lecture 15: Pseudorandom Permutations

Posted on March 16, 2009 by luca
1

Scribed by Siu-Man Chan

Summary

Given one way permutations (of which discrete logarithm is a candidate), we know how to construct pseudorandom functions. Today, we are going to construct pseudorandom permutations (block ciphers) from pseudorandom functions.

Continue reading →

Posted in CS276 | Tagged Luby-Rackoff, pseudorandom function, pseudorandom permutation | 1 Reply

CS276 Lecture 16 (draft)

Posted on March 12, 2009 by luca
Reply

Today we finish the analysis of a construction of a pseudorandom permutation (block cipher) given a pseudorandom function.

Continue reading →

Posted in CS276, Uncategorized | Tagged Luby-Rackoff, pseudorandom function, pseudorandom permutation | Leave a reply

CS276 Lecture 15 (draft)

Posted on March 10, 2009 by luca
Reply

Summary

Today we give a construction of a pseudorandom permutation (block cipher) given a pseudorandom function, and we begin its analysis. Continue reading →

Posted in CS276 | Tagged Luby-Rackoff, pseudorandom function, pseudorandom permutation | Leave a reply
Follow in theory on WordPress.com

Recent Comments

  • valuevar on CS359G Lecture 16: Constructions of Expanders
  • Tenure -track Assistant Professor at Bocconi University (apply by January 8, 2021) – Theoretical Computer Science Jobs on Bocconi is Looking for Assistant Professors in Computer Science
  • Application Deadline for Assistant Professor Positions at Bocconi | in theory on Bocconi is Looking for Assistant Professors in Computer Science
  • Luca Aceto on An Unusual Year, in Pictures
  • Kim Ki-duk | in theory on Post-doc Opportunities in Milan

Recent Posts

  • This year, for Lent, we realized it has been Lent all along
  • Application Deadline for Assistant Professor Positions at Bocconi
  • An Unusual Year, in Pictures
  • Kim Ki-duk
  • Bocconi is Looking for Assistant Professors in Computer Science

Archives

Categories

  • Additive Combinatorics
  • Apple
  • ARV
  • average-case complexity
  • Avi Wigderson
  • Ben Green
  • CCA security
  • Cheeger inequality
  • circuit lower bounds
  • Conceptual contributions
  • covid-19
  • cryptography
  • CS254 2010
  • Dan Spielman
  • eigenvalues
  • eigenvectors
  • Expanders
  • Fields Medal
  • FOCS 2006
  • FOCS 2010
  • Graph Isomorphism
  • Hard-Core Sets
  • ICM 2006
  • Integrality gap
  • Jean Bourgain
  • jobs
  • Laplacian
  • LaTeX
  • LaTeX in WordPress
  • Leonid Levin
  • linear programming
  • Luby-Rackoff
  • MAC
  • Max Cut
  • maximum flow
  • Metric embeddings
  • Moses Charikar
  • Natural Proofs
  • Notices of the AMS
  • Oded Goldreich
  • online optimization
  • Paul Erdos
  • PCP
  • Proposition 8
  • pseudorandom function
  • Pseudorandomness
  • pseudorandom permutation
  • public-key encryption
  • quadratic residue
  • Random Oracle Model
  • random walks
  • Regularity Lemma
  • RSA
  • safety
  • SAT
  • semidefinite programming
  • signature schemes
  • Silvio Micali
  • sparsest cut
  • spectral graph theory
  • Spectral partitioning
  • Stephen Colbert
  • STOC and FOCS
  • stochastic block model
  • Szemeredi Theorem
  • Tamar Ziegler
  • Terence Tao
  • things that are excellent
  • things that are terrible
  • Tim Gowers
  • Turing Centennial
  • unique games
  • World Cup
  • Zero Knowledge
  • zig-zag product

Top Posts

  • Lecture Notes
  • CS261 Lecture 16: Multicommodity flow
  • LaTeX to WordPress
  • Fests
  • CS 261 Lecture 10: the fattest path
  • Online Optimization Post 3: Follow the Regularized Leader
  • CS294 Lecture 2: Basics of Spectral Graph Theory
  • Turing Centennial Post 4: Luca Trevisan
  • Bocconi is Looking for Assistant Professors in Computer Science
  • CS261 Lecture 11: Strongly Polynomial Time Algorithms

math

  • Doron Zeilberger
  • Terry Tao
  • Tim Gowers

non-theory

  • Bitch PhD
  • The Peking Duck
  • Unfogged

theory

  • 3D Pancakes
  • Complexity Blog
  • Geomblog
  • Informatics Weekly
  • James Lee
  • My Biased Coin
  • my slice of pizza
  • Oded Goldreich
  • Process Algebra Diary
  • Richard Lipton
  • Shtetl Optimized
  • Theory Matters

Recent Comments

valuevar on CS359G Lecture 16: Constructio…
Tenure -track Assist… on Bocconi is Looking for Assista…
Application Deadline… on Bocconi is Looking for Assista…
Luca Aceto on An Unusual Year, in Pictu…
Kim Ki-duk | in theo… on Post-doc Opportunities in…

math

  • Doron Zeilberger
  • Terry Tao
  • Tim Gowers

non-theory

  • Bitch PhD
  • The Peking Duck
  • Unfogged

theory

  • 3D Pancakes
  • Complexity Blog
  • Geomblog
  • Informatics Weekly
  • James Lee
  • My Biased Coin
  • my slice of pizza
  • Oded Goldreich
  • Process Algebra Diary
  • Richard Lipton
  • Shtetl Optimized
  • Theory Matters

Archives

Categories

  • Additive Combinatorics
  • Apple
  • ARV
  • average-case complexity
  • Avi Wigderson
  • Ben Green
  • CCA security
  • Cheeger inequality
  • circuit lower bounds
  • Conceptual contributions
  • covid-19
  • cryptography
  • CS254 2010
  • Dan Spielman
  • eigenvalues
  • eigenvectors
  • Expanders
  • Fields Medal
  • FOCS 2006
  • FOCS 2010
  • Graph Isomorphism
  • Hard-Core Sets
  • ICM 2006
  • Integrality gap
  • Jean Bourgain
  • jobs
  • Laplacian
  • LaTeX
  • LaTeX in WordPress
  • Leonid Levin
  • linear programming
  • Luby-Rackoff
  • MAC
  • Max Cut
  • maximum flow
  • Metric embeddings
  • Moses Charikar
  • Natural Proofs
  • Notices of the AMS
  • Oded Goldreich
  • online optimization
  • Paul Erdos
  • PCP
  • Proposition 8
  • pseudorandom function
  • Pseudorandomness
  • pseudorandom permutation
  • public-key encryption
  • quadratic residue
  • Random Oracle Model
  • random walks
  • Regularity Lemma
  • RSA
  • safety
  • SAT
  • semidefinite programming
  • signature schemes
  • Silvio Micali
  • sparsest cut
  • spectral graph theory
  • Spectral partitioning
  • Stephen Colbert
  • STOC and FOCS
  • stochastic block model
  • Szemeredi Theorem
  • Tamar Ziegler
  • Terence Tao
  • things that are excellent
  • things that are terrible
  • Tim Gowers
  • Turing Centennial
  • unique games
  • World Cup
  • Zero Knowledge
  • zig-zag product

Top Posts

  • Lecture Notes
  • CS261 Lecture 16: Multicommodity flow
  • LaTeX to WordPress
  • Fests
  • CS 261 Lecture 10: the fattest path
  • Online Optimization Post 3: Follow the Regularized Leader
  • CS294 Lecture 2: Basics of Spectral Graph Theory
  • Turing Centennial Post 4: Luca Trevisan
  • Bocconi is Looking for Assistant Professors in Computer Science
  • CS261 Lecture 11: Strongly Polynomial Time Algorithms
Blog at WordPress.com.