John Steinberger | |||
| Currently teaching: Fundamentals of Cryptography | |||
| My Curriculum Vitae. | |||
| My Quals Talk. | |||
| My 4CT Talk. | |||
| My PhD also in PS. | |||
| Papers: | |||
| Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations (with Andrey Bogdanov, Lars R. Knudsen, Gregor Leander, Francois-Xavier Standaert and Elmar Tischhauser) Eurocrypt 2012, LNCS 7237, Springer. | |||
| The preimage security of double-block length compression functions (with Frederik Armknecht, Ewan Fleischmann, Matthias Krause, Jooyoung Lee and Martijn Stam) Asiacrypt 2011, LNCS 7073, Springer, 233-251. | PS | ||
| The collision security of Tandem-DM in the ideal cipher model (with Jooyoung Lee and Martijn Stam) Crypto 2011, LNCS 6841, Springer, 316-333. | PS | ||
| Domain extension for MACs beyond the birthday barrier (with Yevgeniy Dodis) Eurocrypt 2011, LNCS 6632, Springer, 323-342. | PS | ||
| Stam's collision resistance conjecture Eurocrypt 2010, LNCS 6610, Springer, 597-615. | PS | ||
| Multi-property-preserving domain extension using polynomial-based modes of operation (with Jooyoung Lee) Eurocrypt 2010, LNCS 6610, Springer, 573-596. | PS | ||
| Coset arrays and nonnegative integer linear combinations | PS | ||
| Message authentication codes from unpredictable blockciphers (with Yevgeniy Dodis) Crypto 2009, LNCS 5677, Springer, 267-285. | PS | ||
| An unavoidable set of D-reducible configurations Accepted to Transactions of the American Mathematical Society, 362 (2010), 6633-6661. | PS | FILES | |
| Constructing cryptographic hash functions from fixed-key blockciphers (with Phillip Rogaway) Crypto 2008, LNCS 5157, Springer, 433-450 | PS | ||
| Security/efficiency tradeoffs for permutation-based hashing (with Philip Rogaway) Eurocrypt 2008, LNCS 4965, Springer, 220-236 | PS | ||
| The collision intractability of MDC-2 in the ideal cipher model Eurocrypt 2007, LNCS 4515, Springer, 34-51 | PS | ||
| The lowest-degree polynomial with nonnegative coefficients divisible by the n-th cyclotomic polynomial | PS | ||
| Tilings of the integers can have superpolynomial periods Combinatorica, volume 29 (2009), 503-509 | PS | ||
| On the entry sum of cyclotomic arrays (with Don Coppersmith) INTEGERS: the Electronic Journal of Combinatorial and Additive Number Theory, 6 (2006) | PDF | PS | |
| Minimal vanishing sums of roots of unity with large coefficients Proceedings of the London Mathematical Society, 97 No. 3 (2008), 689-717 | PS | ||
| Quasiperiodic group factorizations Resultate der Mathematik, 51 (2008), 319-338 |
PS | ||
| Indecomposable tilings of the integers with exponentially long periods Electronic Journal of Combinatorics, 12 (2005) |
PDF |
PS | |
| Multiple tilings of Z with long periods, and tiles with many-generated level semigroups New York Journal of Mathematics, 11 (2005), 445-456 |
PDF |
PS | |
| A class of prototiles with doubly generated level semigroups Journal of Combinatorial Theory, Series A, 106 No. 1 (2004) | PDF | PS | |