What is he best known for?
The fields of study he is best known for:
- Algebra
- Algorithm
- Cryptography
Discrete mathematics, Theoretical computer science, Cryptography, Hash function and Protocol are his primary areas of study.
His Discrete mathematics study integrates concerns from other disciplines, such as Computational complexity theory, Oblivious transfer, Combinatorics and Trapdoor function.
The study incorporates disciplines such as Pseudorandom number generator, Pseudorandom function family, Lattice and Linear algebra in addition to Combinatorics.
Alon Rosen interconnects Collision, Hash chain and Merkle–Damgård construction in the investigation of issues within Theoretical computer science.
His Cryptography research includes elements of Game theory and Public-key cryptography.
His work on Claw-free permutation and SHA-2 is typically connected to Collision resistance and Collision attack as part of general Hash function study, connecting several disciplines of science.
His most cited work include:
- Pseudorandom functions and lattices (224 citations)
- Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices (193 citations)
- Concurrent zero knowledge with logarithmic round-complexity (193 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Discrete mathematics, Theoretical computer science, Cryptography, Function and Combinatorics.
His Discrete mathematics research incorporates elements of Learning with errors, Pseudorandom number generator, Simple, Hash function and One-way function.
Alon Rosen has included themes like Secure multi-party computation, Protocol, Zero-knowledge proof and Encryption in his Theoretical computer science study.
His studies in Cryptography integrate themes in fields like Scheme, Adversary and Nash equilibrium.
Alon Rosen works mostly in the field of Function, limiting it down to topics relating to Injective function and, in certain cases, Trapdoor function.
His work carried out in the field of Combinatorics brings together such families of science as Factorization, Lattice problem, Algebraic structure and Cyclotomic polynomial.
He most often published in these fields:
- Discrete mathematics (44.27%)
- Theoretical computer science (35.88%)
- Cryptography (25.95%)
What were the highlights of his more recent work (between 2016-2021)?
- Discrete mathematics (44.27%)
- Theoretical computer science (35.88%)
- Mathematical proof (8.40%)
In recent papers he was focusing on the following fields of study:
His primary areas of investigation include Discrete mathematics, Theoretical computer science, Mathematical proof, Hash function and Function.
His Discrete mathematics research includes themes of Scheme and Algebraic structure.
In his research, Encryption is intimately related to Cryptography, which falls under the overarching field of Theoretical computer science.
His Mathematical proof course of study focuses on Transformation and Round complexity, Protocol, Composition and Ring signature.
His research in Hash function intersects with topics in Soundness, Verifiable secret sharing and Nash equilibrium.
His study in Function is interdisciplinary in nature, drawing from both Reduction, Boolean function, String, Polynomial hierarchy and Variety.
Between 2016 and 2021, his most popular works were:
- Proofs of Useful Work. (40 citations)
- Average-case fine-grained hardness (20 citations)
- Pseudorandom Functions: Three Decades Later (18 citations)
In his most recent research, the most cited papers focused on:
- Algebra
- Algorithm
- Programming language
The scientist’s investigation covers issues in PPAD, Discrete mathematics, Mathematical proof, Theoretical computer science and Combinatorics.
His PPAD study incorporates themes from Hash function, Correctness and Verifiable secret sharing.
Alon Rosen is interested in Boolean circuit, which is a branch of Discrete mathematics.
His Theoretical computer science research is multidisciplinary, incorporating elements of Message authentication code, Cryptography, Pseudorandom number generator and Encryption.
His Modulo, Average-case complexity and Time complexity study in the realm of Combinatorics interacts with subjects such as Iterated function.
His Algebraic structure research is multidisciplinary, relying on both Function and Exponential time hypothesis.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
