Mats Näslund
Mats Näslund publishes mostly in Artificial Intelligence, Computer Networks and Communications and Information Systems, on topics such as Cryptographic Implementations and Security, Cryptography and Data Security and Chaos-based Image/Signal Encryption.
- World rank
- #1,210,865 of 7,710,434 ranked researchers
- Rank in Sweden
- #15,574 of 71,437
- Works
- 91
- Citations
- 2.3k
- Citations per work
- 25.3
What does Mats Näslund research?
Mats Näslund's work is mostly in Computer Science (71%), Engineering (9%).
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 Sciences7279.5%
- Computer Science6470.6%
- Engineering88.9%
- Everything else1920.5%
- 1Artificial Intelligence27% of their works
- 2Computer Networks and Communications20% of their works
- 3Information Systems11% of their works
- 4Electrical and Electronic Engineering9% of their works
- 5Computer Vision and Pattern Recognition8% of their works
- 6Hardware and Architecture5% of their works
Research topics
- Cryptographic Implementations and Security
- Cryptography and Data Security
- Chaos-based Image/Signal Encryption
- Coding theory and cryptography
- IPv6, Mobility, Handover, Networks, Security
- Cryptography and Residue Arithmetic
- Advanced Authentication Protocols Security
- Physical Unclonable Functions (PUFs) and Hardware Security
Which keywords describe Mats Näslund's research?
The keywords of their largest research topics: Cryptanalysis, Security Analysis, Hardware Implementations, Side-Channel Attacks, Block Ciphers, Hash Functions, Cryptography and Homomorphic Encryption.
- Key Exchange
- Authentication
- Elliptic Curves
- Handoff Decision Algorithms
- Algebraic Attacks
- Chaos
- Homomorphic Encryption
- Hash Functions
- Side-Channel Attacks
- Security Analysis
- Cryptanalysis
- Hardware Implementations
- Block Ciphers
- Cryptography
- Identity-Based Encryption
- Image Encryption
- Error-Correcting Codes
- Mobility Support
- Pairing-Based Cryptosystems
- Hardware Trojans
- Physical Unclonable Functions
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 21 words, with their numbers
- Cryptanalysis503 topics
- Security Analysis422 topics
- Hardware Implementations352 topics
- Side-Channel Attacks352 topics
- Block Ciphers261 topic
- Hash Functions261 topic
- Cryptography232 topics
- Homomorphic Encryption201 topic
- Identity-Based Encryption201 topic
- Chaos161 topic
- Image Encryption161 topic
- Algebraic Attacks141 topic
- Error-Correcting Codes141 topic
- Handoff Decision Algorithms111 topic
- Mobility Support111 topic
- Elliptic Curves91 topic
- Pairing-Based Cryptosystems91 topic
- Authentication81 topic
- Hardware Trojans81 topic
- Key Exchange81 topic
- Physical Unclonable Functions81 topic
Where does Mats Näslund work?
Mats Näslund's main affiliation in the publication record is Ericsson (Sweden), Sweden.
How many publications and citations does Mats Näslund have?
OpenAlex counts 91 works and 2,303 citations for Mats Näslund, an h-index of 20, ranking #1,210,865 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.
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 Mats Näslund. 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.