Lightweight Key Exchange Algorithms for MQTT Protocol in Its Environment

2020 ◽

Vol 8 (6) ◽

pp. 3987-3991

Keyword(s):

Information Technology ◽

Internet Of Things ◽

Research Work ◽

Key Exchange ◽

Security Risks ◽

Computing Power ◽

International Telecommunication ◽

Global Standards ◽

Cryptographic Algorithms ◽

Exchange Algorithms

The Information Technology has evolved and we have reached at an era of Internet of Things (IoT). According to International Telecommunication Union’s Global Standards Initiative (GSI), it is the network of all kinds of ‘things’ embedded with electronics, sensors, actuators, software etc. Things connected in open Internet poses high security risks. Majority of these devices use Message Queuing Telemetry Transport (MQTT) protocol for exchanging information. Most of the devices with limited storage and computing power are connected using MQTT. Since the protocol doesn't provide any mechanism for encryption, the security aspect of the protocol is really weak. This paper describes the need for empowering security in MQTT. In this research work, we benchmark different cryptographic algorithms and propose the best possible algorithm to enable higher level of security in MQTT. This work further demonstrates how to use the proposed algorithm to enable lightweight key exchange mechanism among MQTT devices.

Download Full-text

Key Exchange Algorithms

Cryptanalysis of Number Theoretic Ciphers ◽

10.1201/9781315275765-19 ◽

2019 ◽

pp. 245-252

Author(s):

Samuel S. Wagstaff

Keyword(s):

Key Exchange ◽

Exchange Algorithms

Download Full-text

On a class of strongly asymmetric PKA algorithms

Journal of Mathematical Cryptology ◽

10.1515/jmc-2015-0019 ◽

2015 ◽

Vol 9 (3) ◽

Cited By ~ 1

Author(s):

Luigi Accardi ◽

Massimo Regoli

Keyword(s):

Matrix Model ◽

Key Agreement ◽

Key Exchange ◽

Public Key ◽

Discrete Logarithms ◽

Essential Ingredient ◽

Cryptographic Algorithms ◽

Exchange Algorithms ◽

The Matrix

AbstractIn the papers [New features for public key exchange algorithms, in: 18-th International ICWG Meeting (Krakow 2011)], [Strongly asymmetric PKD cryptographic algorithms: An implementation using the matrix model, in: Proceedings ISEC Conference (Shizuoka 2011)] a new scheme to produce public key agreement (PKA) algorithms was proposed and some examples based on polynomials (toy models) were discussed. In the present paper we introduce a non-commutative realization of the above mentioned scheme and prove that non-commutativity can be an essential ingredient of security in the sense that, in the class of algorithms constructed, under some commutativity assumptions on the matrices involved, we can find a breaking strategy, but dropping these assumptions we can not, even if we assume, as we do in all the attacks discussed in the present paper, that discrete logarithms have zero cost.

Download Full-text