Recent advancements in wireless technology have created an exponential rise in the number of connected devices leading to the internet of things (IoT) revolution. Large amounts of data are captured, processed and transmitted through the network by these embedded devices. Security of the transmitted data is a major area of concern in IoT networks. Numerous encryption algorithms have been proposed in these years to ensure security of transmitted data through the IoT network. Tiny encryption algorithm (TEA) is the most attractive among all, with its lower memory utilization and ease of implementation on both hardware and software scales. But one of the major issues of TEA and its numerous developed versions is the usage of the same key through all rounds of encryption, which yields a reduced security evident from the avalanche effect of the algorithm. Also, the encryption and decryption time for text is high, leading to lower efficiency in IoT networks with embedded devices. This paper proposes a novel tiny symmetric encryption algorithm (NTSA) which provides enhanced security for the transfer of text files through the IoT network by introducing additional key confusions dynamically for each round of encryption. Experiments are carried out to analyze the avalanche effect, encryption and decryption time of NTSA in an IoT network including embedded devices. The results show that the proposed NTSA algorithm is much more secure and efficient compared to state-of-the-art existing encryption algorithms.

https://www.mdpi.com/2073-8994/11/2/293/pdf

A Secure and Efficient Lightweight Symmetric Encryption Scheme for Transfer of Text Files between Embedded IoT Devices

Firmware for Data Security: A Review

This paper discusses several important algorithms used for the encryption and decryption of data in all fields, to make a comparative study for most important algorithms in terms of speed (implementation) and security (special keys) determine whether an encryption algorithm is good. What is more, computational resources, such memory (RAM) size, are an integral consideration since they affect algorithm efficiency, hence the need to ensure optimal resource allocation, etc. Particularly, encryption is the process of transforming plain text into ciphered-text, which cannot be understood or altered easily by undesirable people. This encrypted result is encoded and has immunity against attacks and unauthorized access and manipulation. Encryption algorithms often use private keys that are used to revert the encrypted data to its original meaningful format. Such an algorithm, such as Blowfish, RC5, or RC4, is basically a set of mathematical procedures that make it hard for malicious attackers to understand or use the original data. In symmetric key algorithms, a single key is used to encrypt and decrypt text. On the contrary, the asymmetric key algorithm uses two discrete keys, where both the sender and receiver have access to one of them. These security measures and systems eliminate possible internal and external threats to ensure integrity, correctness, confidentiality, and safety of data and infrastructures are controlled.

A Survey on Symmetric and Asymmetric Cryptography Algorithms in information Security

(t,m) [?]. (t, n) [?, ?]. $10.00 [?]. $12.00 [?]. 128 [?]. $139.99 [?]. $15.00 [?]. $16.95 [?]. $16.96 [?]. $18.95 [?]. $24.00 [?]. $24.00/$34 [?]. $24.95 [?, ?]. $26.95 [?]. $29.95 [?]. $30.95 [?]. $39 [?]. $43.39 [?]. $45.00 [?]. $5.95 [?]. $54.00 [?]. $54.95 [?]. $54.99 [?]. $6.50 [?]. $6.95 [?]. $69.00 [?]. $69.95 [?]. $75.00 [?]. $89.95 [?]. th [?]. A [?]. A [?, ?]. χ [?]. H [?]. k [?, ?]. M [?, ?]. M [?]. n [?, ?, ?].

/pdf/a-complete-bibliography-of-publications-in-cryptologia-19afbi1vz2.pdf

A Complete Bibliography of Publications in Cryptologia

What is the maximum number of pizza slices one can get by making four straight cuts through a circular pizza? How does a computer determine the best set of pixels to represent a straight line on a computer screen? How many people at a minimum does it take to guard an art gallery? Discrete mathematics has the answer to these-and many other-questions of picking, choosing, and shuffling. T. S. Michael's gem of a book brings this vital but tough-to-teach subject to life using examples from real life and popular culture. Each chapter uses one problem-such as slicing a pizza-to detail key concepts about counting numbers and arranging finite sets. Michael takes a different perspective in tackling each of eight problems and explains them in differing degrees of generality, showing in the process how the same mathematical concepts appear in varied guises and contexts. In doing so, he imparts a broader understanding of the ideas underlying discrete mathematics and helps readers appreciate and understand mathematical thinking and discovery. This book explains the basic concepts of discrete mathematics and demonstrates how to apply them in largely nontechnical language. The explanations and formulas can be grasped with a basic understanding of linear equations.

How to Guard an Art Gallery and Other Discrete Mathematical Adventures

The Tiny Encryption Algorithm (TEA) has been around for just over ten years. It is probably the most "minimal"-and hence fastest-block cipher ever devised and yet appears resistant to most attacks. In this article, we describe the algorithm, its simplicity of design and ease of use, its cryptographic strength, and the wide range of implementations and applications of the cipher.

The Tiny Encryption Algorithm

Although of similar age, the Quadratic Residue Cipher (QRC) has been neglected compared with the publicity received by other public key cryptosystems, notably the RSA cipher. This paper attempts to redress the balance somewhat, explaining in expository form the principle of the QRC, the advantages it offers over RSA and some experiences gained as a result of using the cipher.

Simon J. Shepherd

Papers

The Tiny Encryption Algorithm

The quadratic residue cipher and some notes on implementation