- Number Theory Background Divisibility and gcd
- Changing Base without Losing Space Yevgeniy Dodis
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers
- Turing Machines A "Turing machine" is a theoretical model of a computer introduced by Alan Turing in 1936. It consists of
- P, NP and NP-completeness Note: As usual, N = {1, 2, 3, 4, . . .}.
- Some results on coset array combinations John Steinberger
- A new proof of the 4CT John Steinberger1
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- Message Authentication Codes from Unpredictable Block Ciphers
- Approximation Algorithms A word before we start: optimal means "best possible".
- Tilings of the Integers, Vanishing Sums of Roots of Unity, and Cyclotomic Arrays
- DISCHARGING CARTWHEELS Neil Robertson 1
- function Heapsort(a, size) { // `a' is an unsorted array of length `size' //
- Graph Theory Definitions A graph is a pair of sets (V, E) where V is a finite set called the set of vertices and E is a set of 2-element
- REDUCIBILITY IN THE FOUR-COLOR THEOREM Neil Robertson1
- Multi-property-preserving Domain Extension Using Polynomial-based Modes of Operation
- On the entry sum of cyclotomic arrays Don Coppersmith (IDACCR), John Steinberger (UC Davis)
- Any set S of t elements can have its elements encoded by bit strings where we use log2(t) bit strings. For example, say S = {a, b, c, d, e}. Then S has t = 5 elements and we can encode the elements of S using
- John P. Steinberger Curriculum Vitae
- Note: For these notes, sometimes we write xy for the concatenation of strings x, y, and other times we write x y. This just depends on our mood.
- The lowest-degree polynomial with nonnegative coefficients divisible by the n-th cyclotomic polynomial
- Stam's collision resistance conjecture John Steinberger
- Submitted exclusively to the London Mathematical Society doi:10.1112/S0000000000000000
- On the entry sum of cyclotomic arrays Don Coppersmith (IDACCR), John Steinberger (UC Davis)
- Homework 1 for 22B-02 Due Friday October 8
- A class of prototiles with doubly generated level semigroups
- Multipropertypreserving Domain Extension Using Polynomialbased Modes of Operation
- Tilings of the Integers, Vanishing Sums of Roots of Unity, and Cyclotomic Arrays
- Homework 8 for 22B-02 Due Monday November 29
- Tilings of the integers can have superpolynomial periods John P. Steinberger
- Submitted exclusively to the London Mathematical Society doi:10.1112/S0000000000000000
- The lowestdegree polynomial with nonnegative coe#cients divisible by the nth cyclotomic polynomial
- Quasiperiodic group factorizations John P. Steinberger
- Some results on coset array combinations John Steinberger
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model
- Homework 9 for 22B-02 Due Friday December 3
- The collision security of TandemDM in the ideal cipher model
- Message Authentication Codes from Unpredictable Block Ciphers
- Indecomposable tilings of the integers with exponentially long periods
- Homework 7 for 22B-02 Due Friday November 19
- Homework 2 for 22B-02 Due Friday October 15
- TRANSACTIONS OF THE AMERICAN MATHEMATICAL SOCIETY
- Constructing Cryptographic Hash Functions from FixedKey Blockciphers
- Homework 10 for 22B-02 (no due date)
- Multiple Tilings of Z with Long Periods, and Tiles with Many-generated Level Semigroups
- Stam's collision resistance conjecture John Steinberger #
- Security/Efficiency Tradeoffs for Permutation-Based Hashing
- A group is a pair (G, ) where G is a nonempty set and a binary operation : G G G satisfying the following properties
- Some guidance for your talk. There are videos online of FOCS and STOC talks (maybe even CCC, I don't know). You can probably even find a talk of someone presenting your paper, which might give you ideas. A
- Domain Extension for MACs Beyond the Birthday Barrier Yevgeniy Dodis1
- Challenge Problem. An adversary A has access to two infinite lists of oracles 1, 2, 3, . . . and 1, 2, 3, . . .. Each oracle is an independent random permutation of the set [n] = {1, . . . , n}. Each oracle is presented to
- Domain Extension for MACs Beyond the Birthday Barrier Yevgeniy Dodis 1 and John Steinberger 2
- First "Research" Problem Due Date: April 1
