The following pages link to John P. Steinberger (Q927817):
Displaying 39 items.
- Quasiperiodic group factorizations. (Q927818) (← links)
- Tilings of the integers can have superpolynomial periods (Q987563) (← links)
- (Q1648793) (redirect page) (← links)
- Random oracles and non-uniformity (Q1648794) (← links)
- Provable security of (tweakable) block ciphers based on substitution-permutation networks (Q1673418) (← links)
- Indifferentiability of iterated Even-Mansour ciphers with non-idealized key-schedules: five rounds are necessary and sufficient (Q1675219) (← links)
- A class of prototiles with doubly generated level semigroups (Q1826850) (← links)
- The lowest-degree polynomial with nonnegative coefficients divisible by the \(n\)-th cyclotomic polynomial (Q1953303) (← links)
- Minimizing the two-round Even-Mansour cipher (Q1994640) (← links)
- The security of tandem-DM in the ideal cipher model (Q2397447) (← links)
- Indecomposable tilings of the integers with exponentially long periods (Q2571279) (← links)
- Multiple tilings of \(\mathbb Z\) with long periods, and tiles with many-generated level semigroups (Q2583038) (← links)
- Indifferentiability of 8-Round Feistel Networks (Q2835584) (← links)
- On the Indifferentiability of Key-Alternating Ciphers (Q2845693) (← links)
- The Security of Multiple Encryption in the Ideal Cipher Model (Q2874494) (← links)
- Minimizing the Two-Round Even-Mansour Cipher (Q2874495) (← links)
- (Q2883286) (← links)
- Key-Alternating Ciphers in a Provable Setting: Encryption Using a Small Number of Public Permutations (Q2894400) (← links)
- To Hash or Not to Hash Again? (In)Differentiability Results for $$H^2$$ and HMAC (Q2914269) (← links)
- Stam’s Conjecture and Threshold Phenomena in Collision Resistance (Q2914271) (← links)
- Relaxing Full-Codebook Security: A Refined Analysis of Key-Length Extension Schemes (Q2946949) (← links)
- Multiproperty-Preserving Domain Extension Using Polynomial-Based Modes of Operation (Q2989808) (← links)
- Domain Extension for MACs Beyond the Birthday Barrier (Q3003390) (← links)
- An unavoidable set of $D$-reducible configurations (Q3065754) (← links)
- The Preimage Security of Double-Block-Length Compression Functions (Q3102189) (← links)
- Message Authentication Codes from Unpredictable Block Ciphers (Q3183569) (← links)
- (Q3415012) (← links)
- Minimal vanishing sums of roots of unity with large coefficients (Q3535598) (← links)
- Multi-property-preserving Domain Extension Using Polynomial-Based Modes of Operation (Q3563856) (← links)
- Stam’s Collision Resistance Conjecture (Q3563857) (← links)
- Constructing Cryptographic Hash Functions from Fixed-Key Blockciphers (Q3600233) (← links)
- (Q5111139) (← links)
- The Collision Security of Tandem-DM in the Ideal Cipher Model (Q5199213) (← links)
- Tight Security Bounds for Key-Alternating Ciphers (Q5418704) (← links)
- The Collision Intractability of MDC-2 in the Ideal-Cipher Model (Q5429382) (← links)
- Security/Efficiency Tradeoffs for Permutation-Based Hashing (Q5458594) (← links)
- Pseudorandom Functions in Almost Constant Depth from Low-Noise LPN (Q5739201) (← links)
- Indifferentiability of Confusion-Diffusion Networks (Q5739219) (← links)
- PPSZ for general \(k\)-SAT and CSP -- making Hertli's analysis simpler and 3-SAT faster (Q6655885) (← links)
