World's Best Scientists 2026 revealed!
Nathan Keller

Nathan Keller

D-Index & Metrics

Computer Science

D-Index
36
Citations
5757
World Ranking
11231
National Ranking
178

Overview

Nathan Keller is affiliated with Bar-Ilan University in Israel and has made scholarly contributions mainly in the fields of Mathematics and Computer Science. Their research encompasses several specialized subfields such as Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Electrical and Electronic Engineering, Artificial Intelligence, and Algebra and Number Theory.

Their work has been published in various academic venues, with repeated contributions to Advances in Mathematics and arXiv (Cornell University). Additional publications appear in the Journal of the European Mathematical Society and the Israel Journal of Mathematics.

Nathan Keller's recent papers include:

  • "Stability for the complete intersection theorem, and the forbidden intersection problem of Erdős and Sós" (2024, Journal of the European Mathematical Society)
  • "The junta method for hypergraphs and the Erdős-Chvátal simplex conjecture" (2021, Advances in Mathematics)
  • "On t-intersecting families of permutations" (2024, Advances in Mathematics)
  • "A structure theorem for almost low-degree functions on the slice" (2020, Israel Journal of Mathematics)
  • "Sharp Hypercontractivity for Global Functions" (2023, arXiv [Cornell University])

The main topics addressed in Nathan Keller's research cover:

  • Limits and Structures in Graph Theory
  • Advanced Graph Theory Research
  • Complexity and Algorithms in Graphs
  • Graph Labeling and Dimension Problems
  • Graph theory and CDMA systems
  • Coding theory and cryptography
  • Commutative Algebra and Its Applications

Frequent co-authors with whom Nathan Keller has collaborated include Noam Lifshitz, Ohad Sheinfeld, David Ellis, Dor Minzer, and Ohad Klein.

Best Publications

  • Instant Ciphertext-Only Cryptanalysis of GSM Encrypted Communication

    Elad Barkan;Eli Biham;Nathan Keller

  • The Rectangle Attack - Rectangling the Serpent.

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Related-Key boomerang and rectangle attacks

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Key recovery attacks of practical complexity on AES-256 variants with up to 10 rounds

    Alex Biryukov;Orr Dunkelman;Nathan Keller;Dmitry Khovratovich

  • New Impossible Differential Attacks on AES

    Jiqiang Lu;Orr Dunkelman;Nathan Keller;Jongsung Kim

  • A related-key rectangle attack on the full KASUMI

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Minimalism in cryptography: the even-mansour scheme revisited

    Orr Dunkelman;Nathan Keller;Adi Shamir

  • Improved Single-Key Attacks on 8-Round AES-192 and AES-256

    Orr Dunkelman;Nathan Keller;Adi Shamir

  • A practical-time related-key attack on the KASUMI cryptosystem used in GSM and 3G telephony

    Orr Dunkelman;Nathan Keller;Adi Shamir

  • A practical attack on KeeLoq

    Sebastiaan Indesteege;Nathan Keller;Orr Dunkelman;Eli Biham

  • A Practical Attack on KeeLoq

    Sebastiaan Indesteege;Nathan Keller;Eli Biham;Orr Dunkelman

  • New results on boomerang and rectangle attacks

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Enhancing differential-linear cryptanalysis

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Improving the efficiency of impossible differential cryptanalysis of reduced Camellia and MISTY1

    Jiqiang Lu;Jongsung Kim;Nathan Keller;Orr Dunkelman

  • Related-Key impossible differential attacks on 8-round AES-192

    Eli Biham;Orr Dunkelman;Nathan Keller

  • Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems

    Itai Dinur;Orr Dunkelman;Nathan Keller;Adi Shamir

  • Low-Data Complexity Attacks on AES

    C. Bouillaguet;P. Derbez;O. Dunkelman;P. Fouque

  • DLCT: A New Tool for Differential-Linear Cryptanalysis

    Achiya Bar-On;Orr Dunkelman;Nathan Keller;Ariel Weizman

  • Differential-linear cryptanalysis of serpent

    Eli Biham;Orr Dunkelman;Nathan Keller

  • A Practical-Time Attack on the A5/3 Cryptosystem Used in Third Generation GSM Telephony.

    Orr Dunkelman;Nathan Keller;Adi Shamir

  • A Practical Attack on KeeLoq

    Wim Aerts;Eli Biham;Dieter De Moitié;Elke De Mulder

  • Improved Single-Key Attacks on 8-Round AES-192 and AES-256

    Orr Dunkelman;Nathan Keller;Adi Shamir

  • Related-Key Boomerang and Rectangle Attacks.

    Jongsung Kim;Seokhie Hong;Bart Preneel;Eli Biham

Frequent Co-Authors

Orr Dunkelman
Orr Dunkelman University of Haifa
Adi Shamir
Adi Shamir Weizmann Institute of Science
Eli Biham
Eli Biham Technion – Israel Institute of Technology
Gil Kalai
Gil Kalai Hebrew University of Jerusalem
Bart Preneel
Bart Preneel KU Leuven
Ramarathnam Venkatesan
Ramarathnam Venkatesan Microsoft (United States)
Ilya Mironov
Ilya Mironov Google (United States)
Noam Nisan
Noam Nisan Hebrew University of Jerusalem
Itai Benjamini
Itai Benjamini Weizmann Institute of Science

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Pursuing a degree in Computer Science opens up a range of flexible educational and career opportunities. Students who prefer adaptable learning may consider earning an online associate's degree in computer science or IT disciplines. This pathway is ideal for those seeking a faster entry into the technology workforce or looking to build foundational skills before transferring to a four-year program.

For learners interested in high-demand roles, exploring the most useful graduate degrees—including advanced computer science, data analytics, and cybersecurity—can lead to lucrative and stable career prospects. These programs tend to offer robust earning potential and align with growing industry needs.

Affordability is another crucial factor. Many students search for cheap online college classes to minimize student debt and make quality education more accessible. Additionally, several best colleges for low gpa offer online degrees, enabling students with diverse academic backgrounds to pursue further studies and enhance their career options.

Whether you’re just starting out or looking to advance your skills, these flexible online pathways can help you reach your goals in computer science and beyond.

Best Scientists Citing Nathan Keller

Trending Scientists

Recently Published Articles