( en | de | ru )

 

Disambiguation of "Keller, Nathan"

Author of the publication

copydeleteadd this publication to your clipboard
Proof of Tomaszewski's Conjecture on Randomly Signed Sums

, and . (2020)cite arxiv:2006.16834Comment: Light editorial changes. 76 pages.

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nathan ben-Nathan

Nathan Rosenbaum

Hans Nathan

Siegfried Nathan

Nathan Zambou

 

Other publications of authors with the same name

Key Recovery Attacks of Practical Complexity on AES Variants With Up To 10 Rounds., , , , and . IACR Cryptology ePrint Archive, (2009)A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony., , and . IACR Cryptology ePrint Archive, (2010)Improved Single-Key Attacks on 8-round AES., , and . IACR Cryptology ePrint Archive, (2010)A Quantitative Version of the Gibbard-Satterthwaite Theorem for Three Alternatives, , , and . CoRR, (2011)The Junta Method in Extremal Hypergraph Theory and Chvátal's Conjecture., and . Electron. Notes Discret. Math., (2017)On the Influences of Variables on Boolean Functions in Product Spaces.. Comb. Probab. Comput., 20 (1): 83-102 (2011)A New Criterion for Nonlinearity of Block Ciphers., and . IEEE Trans. Inf. Theory, 53 (11): 3944-3957 (2007)Key Recovery Attacks on 3-round Even-Mansour, 8-step LED-128, and Full AES2., , , and . ASIACRYPT (1), volume 8269 of Lecture Notes in Computer Science, page 337-356. Springer, (2013)Improved Key Recovery Attacks on Reduced-Round AES with Practical Data and Memory Complexities., , , , and . CRYPTO (2), volume 10992 of Lecture Notes in Computer Science, page 185-212. Springer, (2018)A 2^70 Attack on the Full MISTY1., and . CRYPTO (1), volume 9814 of Lecture Notes in Computer Science, page 435-456. Springer, (2016)