Computing Cryptographic Algorithms in Portable and Embedded Devices

2007 ◽  
Author(s):  
Archana Ramachandran ◽  
Zhibin Zhou ◽  
Dijiang Huang
Keyword(s):  
Embedded Devices ◽  
Cryptographic Algorithms

scholarly journals Timed Automaton-Based Quantitative Feasibility Analysis of Symmetric Cipher in Embedded RTOS: A Case Study of AES

2022 ◽  
Vol 2022 ◽  
pp. 1-16
Author(s):  
Yawen Ke ◽  
Xiaofeng Xia
Keyword(s):  
Real Time ◽  
Quantitative Prediction ◽  
Embedded Devices ◽  
The Real ◽  
Embedded Rtos ◽  
Cryptographic Algorithm ◽  
Wide Range ◽  
Cryptographic Algorithms ◽  
Timed Automaton

The real-time operating system (RTOS) has a wide range of application domains and provides devices with the ability to schedule resources. Because of the restricted resources of embedded devices and the real-time constraints of RTOS, the application of cryptographic algorithms in these devices will affect the running systems. The existing approaches for RTOS ciphers’ evaluation are mainly provided by experimental data performance analysis, which, however, lack a clear judgment on the affected RTOS performance indicators, such as task schedulability, bandwidth, as well as a quantitative prediction of the remaining resources of RTOS. By focusing on task schedulability in RTOS, this paper provides a timed automaton-based quantitative approach to judge the feasibility of ciphers in embedded RTOS. First, a cryptographic algorithm execution overhead estimation model is established. Then, by combining the overhead model with a sensitivity analysis method, we can analyze the feasibility of the cryptographic algorithm. Finally, a task-oriented and timed automaton-based model is built to verify the analysis results. We take AES as a case study and carry out experiments on embedded devices. The experimental results show the effectiveness of our approach, which will provide specific feasibility indicators for the application of cryptographic algorithms in RTOS.

scholarly journals A Vendor-Neutral Unified Core for Cryptographic Operations in GF(p) and GF(2m) Based on Montgomery Arithmetic

2018 ◽  
Vol 2018 ◽  
pp. 1-18 ◽  
Author(s):  
Martin Schramm ◽  
Reiner Dojen ◽  
Michael Heigl
Keyword(s):  
Energy Efficiency ◽  
Performance Analysis ◽  
Integrated Circuits ◽  
Random Numbers ◽  
Embedded Devices ◽  
Cryptographic Algorithms ◽  
Cryptographic Keys ◽  
Iot Devices

In the emerging IoT ecosystem in which the internetworking will reach a totally new dimension the crucial role of efficient security solutions for embedded devices will be without controversy. Typically IoT-enabled devices are equipped with integrated circuits, such as ASICs or FPGAs to achieve highly specific tasks. Such devices must have cryptographic layers implemented and must be able to access cryptographic functions for encrypting/decrypting and signing/verifying data using various algorithms and generate true random numbers, random primes, and cryptographic keys. In the context of a limited amount of resources that typical IoT devices will exhibit, due to energy efficiency requirements, efficient hardware structures in terms of time, area, and power consumption must be deployed. In this paper, we describe a scalable word-based multivendor-capable cryptographic core, being able to perform arithmetic operations in prime and binary extension finite fields based on Montgomery Arithmetic. The functional range comprises the calculation of modular additions and subtractions, the determination of the Montgomery Parameters, and the execution of Montgomery Multiplications and Montgomery Exponentiations. A prototype implementation of the adaptable arithmetic core is detailed. Furthermore, the decomposition of cryptographic algorithms to be used together with the proposed core is stated and a performance analysis is given.

Kombinasi Mode Cipher Block Chaining Dengan Algoritma Triangle Chain Cipher Pada Penyandian Login Website

2018 ◽  
Vol 2 (1) ◽  
pp. 1
Author(s):  
Dafirius Lombu ◽  
Siska Dame Tarihoran ◽  
Irwan Gulo
Keyword(s):  
Operation Mode ◽  
Feedback Mechanism ◽  
Database Access ◽  
Original Meaning ◽  
Mode Of Operation ◽  
Encryption And Decryption ◽  
Cryptographic Algorithms ◽  
Block Chaining

Generally, the database access of a website lies in the user login. When the login data is not accompanied by security techniques, it is very easily accessible by other parties. One effort that can be done to solve the problem is to encode the login data of website users based on cryptographic technique algorithm. Triangle Chain Cipher (TCC) is one of the classic cryptographic algorithms that encode data doubly and generate keys randomly along the plain. The process of encryption and decryption are interdependent to be one of the advantages of this algorithm. This algorithm will be more effective when combined with the Cipher Block Chaining (CBC) operation mode that is widely used in modern cryptographic algorithms today. The feedback mechanism between the blocks in this mode of operation is the operating advantage. This study describes how to combine the mode of operation of block chaining cipher with triangle chain cipher algorithm so that cipher data login website generated more random and difficult to find its original meaning.

PENERAPAN METODE SEGITIGA PASCAL ALJABAR UNTUK MEMAKSIMALKAN TEKNIK PENYANDIAN ALGORITMA WORD AUTO KEY ENCRYPTION (WAKE)

2019 ◽  
Vol 3 (1) ◽  
Author(s):  
Kaldius Ndruru ◽  
Putri Ramadhani
Keyword(s):  
Data Security ◽  
Important Data ◽  
Pascal Triangle ◽  
Absolute Requirement ◽  
Cryptographic Algorithms ◽  
Secure Data ◽  
Triangle Method ◽  
Symmetric Key

Security of data stored on computers is now an absolute requirement, because every data has a high enough value for the user, reader and owner of the data itself. To prevent misuse of the data by other parties, data security is needed. Data security is the protection of data in a system against unauthorized authorization, modification, or destruction. The science that explains the ways of securing data is known as cryptography, while the steps in cryptography are called critical algorithms. At this time, there are many cryptographic algorithms whose keys are weak especially the symmetric key algorithm because they only have one key, the key for encryption is the same as the decryption key so it needs to be modified so that the cryptanalysts are confused in accessing important data. The cryptographic method of Word Auto Key Encryption (WAKE) is one method that has been used to secure data where in this case the writer wants to maximize the encryption key and description of the WAKE algorithm that has been processed through key formation. One way is to apply the algebraic pascal triangle method to maximize the encryption key and description of the WAKE algorithm, utilizing the numbers contained in the columns and rows of the pascal triangle to make shifts on the encryption key and the description of the WAKE algorithm.Keywords: Cryptography, WAKE, pascal

A Novel Simplified AES Algorithm for Lightweight Real-Time Applications: Testing and Discussion

2020 ◽  
Vol 13 (3) ◽  
pp. 435-445 ◽  
Author(s):  
Malik Qasaimeh ◽  
Raad S. Al-Qassas ◽  
Fida Mohammad ◽  
Shadi Aljawarneh
Keyword(s):  
Processing Time ◽  
Block Size ◽  
Statistical Test ◽  
Mathematical Proofs ◽  
The Past ◽  
Aes Algorithm ◽  
Cryptographic Algorithm ◽  
Cryptographic Algorithms ◽  
Compare And Contrast ◽  
Constrained Devices

Background: Lightweight cryptographic algorithms have been the focus of many researchers in the past few years. This has been inspired by the potential developments of lightweight constrained devices and their applications. These algorithms are intended to overcome the limitations of traditional cryptographic algorithms in terms of exaction time, complex computation and energy requirements. Methods: This paper proposes LAES, a lightweight and simplified cryptographic algorithm for constricted environments. It operates on GF(24), with a block size of 64 bits and a key size of 80-bit. While this simplified AES algorithm is impressive in terms of processing time and randomness levels. The fundamental architecture of LAES is expounded using mathematical proofs to compare and contrast it with a variant lightweight algorithm, PRESENT, in terms of efficiency and randomness level. Results: Three metrics were used for evaluating LAES according to the NIST cryptographic applications statistical test suite. The testing indicated competitive processing time and randomness level of LAES compared to PRESENT. Conclusion: The study demonstrates that LAES achieves comparable results to PRESENT in terms of randomness levels and generally outperform PRESENT in terms of processing time.

scholarly journals TRNGs from Pre-Formed ReRAM Arrays

Cryptography ◽  
2021 ◽  
Vol 5 (1) ◽  
pp. 8
Author(s):  
Bertrand Cambou ◽  
Donald Telesca ◽  
Sareh Assiri ◽  
Michael Garrett ◽  
Saloni Jain ◽  
...  
Keyword(s):  
Random Number ◽  
Random Number Generator ◽  
Random Access ◽  
Random Number Generators ◽  
Cryptographic Algorithms ◽  
Cryptographic Keys ◽  
Low Levels ◽  
Stochastic Properties ◽  
Pseudo Random Number Generator ◽  
Number Of Cells

Schemes generating cryptographic keys from arrays of pre-formed Resistive Random Access (ReRAM) cells, called memristors, can also be used for the design of fast true random number generators (TRNG’s) of exceptional quality, while consuming low levels of electric power. Natural randomness is formed in the large stochastic cell-to-cell variations in resistance values at low injected currents in the pre-formed range. The proposed TRNG scheme can be designed with three interconnected blocks: (i) a pseudo-random number generator that acts as an extended output function to generate a stream of addresses pointing randomly at the array of ReRAM cells; (ii) a method to read the resistance values of these cells with a low injected current, and to convert the values into a stream of random bits; and, if needed, (iii) a method to further enhance the randomness of this stream such as mathematical, Boolean, and cryptographic algorithms. The natural stochastic properties of the ReRAM cells in the pre-forming range, at low currents, have been analyzed and demonstrated by measuring a statistically significant number of cells. Various implementations of the TRNGs with ReRAM arrays are presented in this paper.

Sign in / Sign up

Export Citation Format

Share Document