Arnab Roy
Arnab Roy publishes mostly in Artificial Intelligence, Computer Networks and Communications and Computer Vision and Pattern Recognition, on topics such as Cryptographic Implementations and Security, Cryptography and Data Security and Chaos-based Image/Signal Encryption.
- World rank
- #822,828 of 7,710,434 ranked researchers
- Rank in United States
- #273,867 of 1,627,098
- Works
- 150
- Citations
- 2.7k
- Citations per work
- 17.8
What does Arnab Roy research?
Arnab Roy's work is mostly in Computer Science (81%).
Their six largest subfields, inside their fields and domains; the grey slice is everything else they publish. The interactive view splits every one of their works down to single topics.
The fields and subfields, with their numbers
- Physical Sciences12180.9%
- Computer Science12180.9%
- Everything else2919.1%
- 1Artificial Intelligence44% of their works
- 2Computer Networks and Communications10% of their works
- 3Computer Vision and Pattern Recognition10% of their works
- 4Information Systems10% of their works
- 5Computational Theory and Mathematics5% of their works
- 6Hardware and Architecture2% of their works
Research topics
Which keywords describe Arnab Roy's research?
The keywords of their largest research topics: Cryptanalysis, Security Analysis, Block Ciphers, Hash Functions, Homomorphic Encryption, Identity-Based Encryption, Authentication and Biometrics.
- Quantum Information
- Security
- Combinatorial Optimization
- Security Protocols
- Error-Correcting Codes
- Image Encryption
- Biometrics
- Identity-Based Encryption
- Hash Functions
- Security Analysis
- Cryptanalysis
- Block Ciphers
- Homomorphic Encryption
- Authentication
- Chaos
- Cryptography
- Key Exchange
- Approximation Algorithms
- Passwords
- Quantum Computation
Size is their works in the topics tagged with each word, from their 8 largest topics. Each links to the topic it comes from most. The words come from the keyword list OpenAlex gives each topic, not from the text of the papers, so a word can appear that none of the papers uses.
All 20 words, with their numbers
- Cryptanalysis953 topics
- Security Analysis782 topics
- Block Ciphers511 topic
- Hash Functions511 topic
- Homomorphic Encryption491 topic
- Identity-Based Encryption491 topic
- Authentication302 topics
- Biometrics302 topics
- Chaos271 topic
- Image Encryption271 topic
- Cryptography261 topic
- Error-Correcting Codes261 topic
- Key Exchange171 topic
- Security Protocols171 topic
- Approximation Algorithms131 topic
- Combinatorial Optimization131 topic
- Passwords131 topic
- Security131 topic
- Quantum Computation121 topic
- Quantum Information121 topic
Where does Arnab Roy work?
Arnab Roy's main affiliation in the publication record is Fujitsu (United States), United States.
How many publications and citations does Arnab Roy have?
OpenAlex counts 150 works and 2,664 citations for Arnab Roy, an h-index of 25, ranking #822,828 of 7,710,434 researchers worldwide on the quality score.
Ranked on field-normalised citation excellence (50%), output (30%) and citations (20%). Counts come from OpenAlex author records, which occasionally merge different people who share a name or split one person into several.
Other researchers named Arnab Roy
- arnab-roy-indian-institute-of-technology-kharagpur-india
- arnab-roy-indian-institute-of-technology-kharagpur
- arnab-roy-interdigital-united-states
- arnab-roy-university-of-calcutta
- arnab-roy-national-energy-technology-laboratory
- arnab-roy-university-of-california-san-francisco
- arnab-roy-czech-academy-of-sciences-institute-of-mathematics
- arnab-roy-jadavpur-university
- arnab-roy-indian-institute-of-science-bangalore
- arnab-roy-tata-institute-of-fundamental-research
Papers, co-authors, who cited this work and researchers on the nearest topics have tabs of their own, above. Is this your page? Claim it with your ORCID iD, or request a correction or removal.
Discussion
Ask a question or share a note about Arnab Roy. Keep it to the research: no personal attacks, advertising or links. Any reader can report a post, which collapses it for everyone until it is opened.