Göran Pulkkis
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Göran Pulkkis has a total of 18 co-authors. Here are the top co-authors by number of shared publications:
- Kaj Grahn
Arcada University of Applied Sciences
15 shared publications - Jonny Karlsson
Arcada University of Applied Sciences
8 shared publications Laura Bergstrom
4 shared publicationsPeik Åström
3 shared publicationsChristian Dieckert
1 shared publicationFrank Schneider
1 shared publication
Latest Publications
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 1641-1659
Quantum Computing and Quantum Communication
This chapter presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.
- 1 January 2019
- Published by IGI Global Scientific Publishing
- p. 1641-1659
Quantum Computing and Quantum Communication
This chapter presents state-of-the-art and future perspectives of quantum computing and communication. Timeline of relevant findings in quantum informatics, such as quantum algorithms, quantum cryptography protocols, and quantum computing models, is summarized. Mathematics of information representation with quantum states is presented. The quantum circuit and adiabatic models of quantum computation are outlined. The functionality, limitations, and security of the quantum key distribution (QKD) protocol is presented. Current implementations of quantum computers and principles of quantum programming are shortly described.
- 31 July 2014
- Published by IGI Global Scientific Publishing
- p. 4279-4292
Current Quantum Information Science and Technology
- 31 July 2014
- Published by IGI Global Scientific Publishing
- p. 4279-4292
Current Quantum Information Science and Technology
- 1 January 2014
- Published by Springer Nature
- p. 559-569
A Generalized Scalable Software Architecture for Analyzing Temporally Structured Big Data in the Cloud
- 1 January 2014
- Published by Springer Nature
- p. 559-569
A Generalized Scalable Software Architecture for Analyzing Temporally Structured Big Data in the Cloud
- Open Access
Identifying Time Measurement Tampering in the Traversal Time and Hop Count Analysis (TTHCA) Wormhole Detection Algorithm
Traversal time and hop count analysis (TTHCA) is a recent wormhole detection algorithm for mobile ad hoc networks (MANET) which provides enhanced detection performance against all wormhole attack variants and network types. TTHCA involves each node measuring the processing time of routing packets during the route discovery process and then delivering the measurements to the source node. In a participation mode (PM) wormhole where malicious nodes appear in the routing tables as legitimate nodes, the time measurements can potentially be altered so preventing TTHCA from successfully detecting the wormhole. This paper analyses the prevailing conditions for time tampering attacks to succeed for PM wormholes, before introducing an extension to the TTHCA detection algorithm called ∆T Vector which is designed to identify time tampering, while preserving low false positive rates. Simulation results confirm that the ∆T Vector extension is able to effectively detect time tampering attacks, thereby providing an important security enhancement to the TTHCA algorithm.
Open AccessIdentifying Time Measurement Tampering in the Traversal Time and Hop Count Analysis (TTHCA) Wormhole Detection Algorithm
Traversal time and hop count analysis (TTHCA) is a recent wormhole detection algorithm for mobile ad hoc networks (MANET) which provides enhanced detection performance against all wormhole attack variants and network types. TTHCA involves each node measuring the processing time of routing packets during the route discovery process and then delivering the measurements to the source node. In a participation mode (PM) wormhole where malicious nodes appear in the routing tables as legitimate nodes, the time measurements can potentially be altered so preventing TTHCA from successfully detecting the wormhole. This paper analyses the prevailing conditions for time tampering attacks to succeed for PM wormholes, before introducing an extension to the TTHCA detection algorithm called ∆T Vector which is designed to identify time tampering, while preserving low false positive rates. Simulation results confirm that the ∆T Vector extension is able to effectively detect time tampering attacks, thereby providing an important security enhancement to the TTHCA algorithm.
- Open Access
A New MANET Wormhole Detection Algorithm Based on Traversal Time and Hop Count Analysis
As demand increases for ubiquitous network facilities, infrastructure-less and self-configuring systems like Mobile Ad hoc Networks (MANET) are gaining popularity. MANET routing security however, is one of the most significant challenges to wide scale adoption, with wormhole attacks being an especially severe MANET routing threat. This is because wormholes are able to disrupt a major component of network traffic, while concomitantly being extremely difficult to detect. This paper introduces a new wormhole detection paradigm based upon Traversal Time and Hop Count Analysis (TTHCA), which in comparison to existing algorithms, consistently affords superior detection performance, allied with low false positive rates for all wormhole variants. Simulation results confirm that the TTHCA model exhibits robust wormhole route detection in various network scenarios, while incurring only a small network overhead. This feature makes TTHCA an attractive choice for MANET environments which generally comprise devices, such as wireless sensors, which possess a limited processing capability.
Open AccessA New MANET Wormhole Detection Algorithm Based on Traversal Time and Hop Count Analysis
As demand increases for ubiquitous network facilities, infrastructure-less and self-configuring systems like Mobile Ad hoc Networks (MANET) are gaining popularity. MANET routing security however, is one of the most significant challenges to wide scale adoption, with wormhole attacks being an especially severe MANET routing threat. This is because wormholes are able to disrupt a major component of network traffic, while concomitantly being extremely difficult to detect. This paper introduces a new wormhole detection paradigm based upon Traversal Time and Hop Count Analysis (TTHCA), which in comparison to existing algorithms, consistently affords superior detection performance, allied with low false positive rates for all wormhole variants. Simulation results confirm that the TTHCA model exhibits robust wormhole route detection in various network scenarios, while incurring only a small network overhead. This feature makes TTHCA an attractive choice for MANET environments which generally comprise devices, such as wireless sensors, which possess a limited processing capability.
- 18 January 2011
- Published by IGI Global Scientific Publishing
Network Security Software
Network Security Software: 10.4018/978-1-93177-743-8.ch001: This chapter is a topical overview of network security software and related skills needed by network users, IT professionals, and network security
- 18 January 2011
- Published by IGI Global Scientific Publishing
Network Security Software
Network Security Software: 10.4018/978-1-93177-743-8.ch001: This chapter is a topical overview of network security software and related skills needed by network users, IT professionals, and network security
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 660-704
Security of Mobile Devices for Multimedia Applications
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 660-704
Security of Mobile Devices for Multimedia Applications
- 18 January 2011
- Published by IGI Global Scientific Publishing
WLAN Security Management
WLAN Security Management: 10.4018/978-1-59904-937-3.ch091: In a wired local-area network (LAN), the network ports and cables are mostly contained inside a building. Therefore, a hacker must defeat physical security
- 18 January 2011
- Published by IGI Global Scientific Publishing
WLAN Security Management
WLAN Security Management: 10.4018/978-1-59904-937-3.ch091: In a wired local-area network (LAN), the network ports and cables are mostly contained inside a building. Therefore, a hacker must defeat physical security
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 1339-1348
Current Network Security Systems
- 18 January 2011
- Published by IGI Global Scientific Publishing
- p. 1339-1348
Current Network Security Systems
- 18 January 2011
- Published by IGI Global Scientific Publishing
WLAN Security Management
WLAN Security Management: 10.4018/978-1-59904-937-3.ch055: In a wired local-area network (LAN), the network ports and cables are mostly contained inside a building. Therefore, a hacker must defeat physical security
- 18 January 2011
- Published by IGI Global Scientific Publishing
WLAN Security Management
WLAN Security Management: 10.4018/978-1-59904-937-3.ch055: In a wired local-area network (LAN), the network ports and cables are mostly contained inside a building. Therefore, a hacker must defeat physical security