In this paper, we present RBS (Redundant Bit Security) algorithm which is a low-complexity symmetric
encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data
bits to change the location of the plaintext bits in the transmitted data without changing their order. The
location of redundant bits inside the transmitted data represents the secret key between sender and
receiver. The algorithm provides integrity and authentication of the original data as well. The
implementation comparison of this algorithm with other algorithms confirms that it a good candidate for
resource-constraint devices such as RFID systems and wireless sensors.
Secured Paillier Homomorphic Encryption Scheme Based on the Residue Number Sy...ijcisjournal
In this paper, we present an improved Paillier Cryptosystem for a secured data transmission based on the
Residue Number System (RNS). The current state of Paillier Cryptosystem allows the computation of the
plaintext from the cipher text without solving its security assumption of Decisional Composite Residuosity
or the knowledge of its private keys under mathematical attacks
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
Secured Paillier Homomorphic Encryption Scheme Based on the Residue Number Sy...ijcisjournal
In this paper, we present an improved Paillier Cryptosystem for a secured data transmission based on the
Residue Number System (RNS). The current state of Paillier Cryptosystem allows the computation of the
plaintext from the cipher text without solving its security assumption of Decisional Composite Residuosity
or the knowledge of its private keys under mathematical attacks
The International Journal of Engineering & Science is aimed at providing a platform for researchers, engineers, scientists, or educators to publish their original research results, to exchange new ideas, to disseminate information in innovative designs, engineering experiences and technological skills. It is also the Journal's objective to promote engineering and technology education. All papers submitted to the Journal will be blind peer-reviewed. Only original articles will be published.
In many of today’s computer application needs, faster operation is essential to the efficient implementation
of information security algorithm. RC4 has been used as the data encryption algorithm for many
applications and protocols including the Wi-Fi, Skype, and Bit Torrent to name a few. Several efficient
approaches to the implementation of RC4 have been proposed and we review some of those. More recently
some parallel approaches to faster implementation of RC4 have been presented and we include those in our
survey of efficient approaches to RC4. This paper presents an analysis of available hardware/software
parallel implementations of RC4 symmetric key-based algorithm and some security approaches which
make it more secure.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Design and implementation of proposed 320 bit RC6-cascaded encryption/decrypt...IJECEIAES
This paper attempts to build up a simple, strong and secure cryptographic algorithm. The result of such an attempt is “RC6-Cascade” which is 320-bits RC6 like block cipher. The key can be any length up to 256 bytes. It is a secret-key block cipher with precise characteristics of RC6 algorithm using another overall structure design. In RC6-Cascade, cascading of F-functions will be used instead of rounds. Moreover, the paper investigates a hardware design to efficiently implement the proposed RC6-Cascade block cipher core on field programmable gate array (FPGA). An efficient compact iterative architecture will be designed for the F-function of the above algorithm. The goal is to design a more secure algorithm and present a very fast encryption core for low cost and small size applications.
A lightweight secure scheme for detecting provenance forgery and packet drop ...LeMeniz Infotech
A lightweight secure scheme for detecting provenance forgery and packet drop attacks in wireless sensor networks
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
Neural Cryptography for Secret Key ExchangeIJMTST Journal
The goal of any cryptography system is the exchange of information among the intended user without any leakage of information to other who may have unauthorized access to it. A common secret key could be created over a public channel accessible to any opponent. Neural networks can be used to generate common secret key. In case of neural cryptography, both the communicating networks receive an identical input vector, generate an output bit and are trained based on the output bit. The two networks and their weights vectors exhibit a new phenomenon, where the networks synchronize to a state with identical time-dependent weights. The generated secret key over a public channel is used for encryption and decryption of the message or information send over the channel.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
SEAD: Source Encrypted Authentic Data for Wireless Sensor NetworksIJERD Editor
One of the critical issues in WSNs is providing security for the secret data in military applications. It is necessary to ensure data integrity and authentication for the source data and secure end-to-end path for data transmission. Mobile sinks are suitable for data collection and localization. Mobile sinks and sensor nodes communicate with each other using their public identity, which is prone to security attacks like sink replication and node replication attack. In this work, we have proposed Source Encrypted Authentic Data algorithm (SEAD) that hides the location of mobile sink from malicious nodes. The sensed data is encrypted utilizing symmetric encryption ---Advanced Encryption Standards (AES) and tracks the location of the mobile sink. When data encounters a malicious node in a path, then data transmission path is diverted through a secure path. SEAD uses public encryption ---Elliptic Curve Cryptography (ECC) to verify the authenticity of the data. Simulation results show that the proposed algorithm ensures data integrity and node authenticity against malicious nodes. Double encryption in the proposed algorithm produces better results in comparison with the existing algorithms.
Implementation of Low-Complexity Redundant Multiplier Architecture for Finite...ijcisjournal
In the present work, a low-complexity Digit-Serial/parallel Multiplier over Finite Field is proposed. It is
employed in applications like cryptography for data encryption and decryptionto deal with discrete
mathematical andarithmetic structures. The proposedmultiplier utilizes a redundant representation because
of their free squaring and modular reduction. The proposed 10-bit multiplier is simulated and synthesized
using Xilinx VerilogHDL. It is evident from the simulation results that the multiplier has significantly low
area and power when compared to the previous structures using the same representation.
Secure Image Transfer in The Domain Transform DFTijcisjournal
This paper presents a new approach for secure image transmission. It consists of three treatments including: a compression based on Discrete Fourier Transform (DFT), a use of symmetric encryption Advanced Encryption Standard (AES) and a Data Hidden Insertion technique for the transport of sensitive information.
SECURED TEXT MESSAGE TRANSMISSION IN A WIRELESS COMMUNICATION SYSTEM WITH THE...caijjournal
A broad variety of wireless data applications and services depend on security. This paper presents a
simulation-based study of a wireless communication system using a secured Vigenere cipher and the RSA
cryptographic algorithms on text message transmission. The system under consideration uses 1/2-rated
CRC channel coding and BPSK digital modulation over an Additive White Gaussian noise (AWGN)
channel. To address security concerns, a text message is encrypted at the transmitter with the Vigenere
cipher and RSA before being decrypted and compared for different levels of SNR at the receiver end. To
carry out the computer simulation, the Matlab 2016a programming language has been used. The
transmitted text message is successfully retrieved at the receiver end after the Vigenere cipher and the RSA
cryptographic algorithm are implemented. It is also anticipated that as noise power increases, the
effectiveness of a wireless communication system based on the Vigenere cipher and RSA security will
decrease.
International Journal of Engineering Research and Development (IJERD)IJERD Editor
call for paper 2012, hard copy of journal, research paper publishing, where to publish research paper,
journal publishing, how to publish research paper, Call For research paper, international journal, publishing a paper, IJERD, journal of science and technology, how to get a research paper published, publishing a paper, publishing of journal, publishing of research paper, reserach and review articles, IJERD Journal, How to publish your research paper, publish research paper, open access engineering journal, Engineering journal, Mathemetics journal, Physics journal, Chemistry journal, Computer Engineering, Computer Science journal, how to submit your paper, peer reviw journal, indexed journal, reserach and review articles, engineering journal, www.ijerd.com, research journals,
yahoo journals, bing journals, International Journal of Engineering Research and Development, google journals, hard copy of journal
Design and implementation of proposed 320 bit RC6-cascaded encryption/decrypt...IJECEIAES
This paper attempts to build up a simple, strong and secure cryptographic algorithm. The result of such an attempt is “RC6-Cascade” which is 320-bits RC6 like block cipher. The key can be any length up to 256 bytes. It is a secret-key block cipher with precise characteristics of RC6 algorithm using another overall structure design. In RC6-Cascade, cascading of F-functions will be used instead of rounds. Moreover, the paper investigates a hardware design to efficiently implement the proposed RC6-Cascade block cipher core on field programmable gate array (FPGA). An efficient compact iterative architecture will be designed for the F-function of the above algorithm. The goal is to design a more secure algorithm and present a very fast encryption core for low cost and small size applications.
A lightweight secure scheme for detecting provenance forgery and packet drop ...LeMeniz Infotech
A lightweight secure scheme for detecting provenance forgery and packet drop attacks in wireless sensor networks
Do Your Projects With Technology Experts
To Get this projects Call : 9566355386 / 99625 88976
Visit : www.lemenizinfotech.com / www.ieeemaster.com
Mail : projects@lemenizinfotech.com
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Lightweight Secure Scheme for Detecting Provenance Forgery and Packet Drop ...1crore projects
IEEE PROJECTS 2015
1 crore projects is a leading Guide for ieee Projects and real time projects Works Provider.
It has been provided Lot of Guidance for Thousands of Students & made them more beneficial in all Technology Training.
Dot Net
DOTNET Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
Java Project Domain list 2015
1. IEEE based on datamining and knowledge engineering
2. IEEE based on mobile computing
3. IEEE based on networking
4. IEEE based on Image processing
5. IEEE based on Multimedia
6. IEEE based on Network security
7. IEEE based on parallel and distributed systems
ECE IEEE Projects 2015
1. Matlab project
2. Ns2 project
3. Embedded project
4. Robotics project
Eligibility
Final Year students of
1. BSc (C.S)
2. BCA/B.E(C.S)
3. B.Tech IT
4. BE (C.S)
5. MSc (C.S)
6. MSc (IT)
7. MCA
8. MS (IT)
9. ME(ALL)
10. BE(ECE)(EEE)(E&I)
TECHNOLOGY USED AND FOR TRAINING IN
1. DOT NET
2. C sharp
3. ASP
4. VB
5. SQL SERVER
6. JAVA
7. J2EE
8. STRINGS
9. ORACLE
10. VB dotNET
11. EMBEDDED
12. MAT LAB
13. LAB VIEW
14. Multi Sim
CONTACT US
1 CRORE PROJECTS
Door No: 214/215,2nd Floor,
No. 172, Raahat Plaza, (Shopping Mall) ,Arcot Road, Vadapalani, Chennai,
Tamin Nadu, INDIA - 600 026
Email id: 1croreprojects@gmail.com
website:1croreprojects.com
Phone : +91 97518 00789 / +91 72999 51536
Efficient two-stage cryptography scheme for secure distributed data storage i...IJECEIAES
Cloud computing environment requires secure access for data from the cloud server, small execution time, and low time complexity. Existing traditional cryptography algorithms are not suitable for cloud storage. In this paper, an efficient two-stage cryptography scheme is proposed to access and store data into cloud safely. It comprises both user authentication and encryption processes. First, a two-factor authentication scheme one-time password is proposed. It overcomes the weaknesses in the existing authentication schemes. The proposed authentication method does not require specific extra hardware or additional processing time to identity the user. Second, the plaintext is divided into two parts which are encrypted separately using a unique key for each. This division increases the security of the proposed scheme and in addition decreases the encryption time. The keys are generated using logistic chaos model theory. Chaos equation generates different values of keys which are very sensitive to initial condition and control parameter values entered by the user. This scheme achieves high-security level by introducing different security processes with different stages. The simulation results demonstrate that the proposed scheme reduces the size of the ciphertext and both encryption and decryption times than competing schemes without adding any complexity.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Simulated Analysis and Enhancement of Blowfish Algorithmiosrjce
This paper represents or analyzes the security of system based on Blowfish. Blowfish mainly focuses
on the encrypt and decrypt techniques and algorithms apply for cryptanalysis. It describe the algorithms for
encryption as well as decryption algorithms and also give the sufficient description of key generation, key
expansion, function and working principle of Blowfish cipher with proper explanations. Taking the current era,
Most of the famous systems which offer security for a network or web or to a data are vulnerability to attacks and
they are broken at some point of time by effective cryptanalysis methods, irrespective of its complex algorithmic
design. In the general, today’s cryptography world is bounded to an interpretive of following any one or multi
encryption scheme and that too for a single iteration on a single file only. This is evident in the maximum of the
encryption-decryption cases. It also describes the comparisons between older blowfish and enhances blowfish. It
also shows enhance Blowfish algorithm for encryption and decryption of data. It is also give the proper simulated
analysis of encryption and decryption time for different file formats using a windows application. It describe
feature of application and its process and efficiency as well as calculation of time and throughput.
Neural Cryptography for Secret Key ExchangeIJMTST Journal
The goal of any cryptography system is the exchange of information among the intended user without any leakage of information to other who may have unauthorized access to it. A common secret key could be created over a public channel accessible to any opponent. Neural networks can be used to generate common secret key. In case of neural cryptography, both the communicating networks receive an identical input vector, generate an output bit and are trained based on the output bit. The two networks and their weights vectors exhibit a new phenomenon, where the networks synchronize to a state with identical time-dependent weights. The generated secret key over a public channel is used for encryption and decryption of the message or information send over the channel.
File transfer with multiple security mechanismShubham Patil
The system enhances the security and the data confidentiality between the users and receiver by the two-layer encryption mechanism and the QR code for verification. The system consists of three main components which are very important to providing the security between sender and receiver while transmitting the data
SEAD: Source Encrypted Authentic Data for Wireless Sensor NetworksIJERD Editor
One of the critical issues in WSNs is providing security for the secret data in military applications. It is necessary to ensure data integrity and authentication for the source data and secure end-to-end path for data transmission. Mobile sinks are suitable for data collection and localization. Mobile sinks and sensor nodes communicate with each other using their public identity, which is prone to security attacks like sink replication and node replication attack. In this work, we have proposed Source Encrypted Authentic Data algorithm (SEAD) that hides the location of mobile sink from malicious nodes. The sensed data is encrypted utilizing symmetric encryption ---Advanced Encryption Standards (AES) and tracks the location of the mobile sink. When data encounters a malicious node in a path, then data transmission path is diverted through a secure path. SEAD uses public encryption ---Elliptic Curve Cryptography (ECC) to verify the authenticity of the data. Simulation results show that the proposed algorithm ensures data integrity and node authenticity against malicious nodes. Double encryption in the proposed algorithm produces better results in comparison with the existing algorithms.
Implementation of Low-Complexity Redundant Multiplier Architecture for Finite...ijcisjournal
In the present work, a low-complexity Digit-Serial/parallel Multiplier over Finite Field is proposed. It is
employed in applications like cryptography for data encryption and decryptionto deal with discrete
mathematical andarithmetic structures. The proposedmultiplier utilizes a redundant representation because
of their free squaring and modular reduction. The proposed 10-bit multiplier is simulated and synthesized
using Xilinx VerilogHDL. It is evident from the simulation results that the multiplier has significantly low
area and power when compared to the previous structures using the same representation.
Secure Image Transfer in The Domain Transform DFTijcisjournal
This paper presents a new approach for secure image transmission. It consists of three treatments including: a compression based on Discrete Fourier Transform (DFT), a use of symmetric encryption Advanced Encryption Standard (AES) and a Data Hidden Insertion technique for the transport of sensitive information.
A Wallace Tree Approach for Data Aggregation in Wireless Sensor Nodes ijcisjournal
Wireless Sensor Networks (WSN) refers to a gathering of spatially scattered and committed sensors used
for to sense the environmental and physical conditions. The WSN collects and aggregates the data from
all the sensor nodes and send it to the sink. But the delay required for Radio transmission of collected
information to the sink is very high. If the delay of the network is high then the power consumption may be
high it leads to decrease in node life time. So to avoid that problem the delay of the network must be kept
at minimum in order to increase the node lifetime. If number of computations required for data
aggregation process are low then automatically the delay of the network is also very less. At present a
carry look ahead adder with parallel prefix algorithm for data aggregation is used but with this approach
is having the disadvantages like high latency and memory. To avoid all those disadvantages a novel tree
approach is proposed. The expected results are reduced in latency that is it increase the speed of data
aggregation process in Wireless sensor nodes along with less memory requirement for that Tree structure.
Translation of sign language using generic fourier descriptor and nearest nei...ijcisjournal
Sign languages are used all over the world as a primary means of communication by deaf people. Sign
language translation is a promising application for vision-based gesture recognition methods. Therefore, it
is need such a tool that can translate sign language directly. This paper aims to create a system that can
translate static sign language into textual form automatically based on computer vision. The method
contains three phases, i.e. segmentation, feature extraction, and recognition. We used Generic Fourier
Descriptor (GFD) as feature extraction method and K-Nearest Neighbour (KNN) as classification
approach to recognize the signs. The system was applied to recognize each 120 stored images in database
and 120 images which is captured real time by webcam. We also translated 5 words in video sequences.
The experiment revealed that the system can recognized the signs with about 86 % accuracy for stored
images in database and 69 % for testing data which is captured real time by webcam.
Target Detection Using Multi Resolution Analysis for Camouflaged Images ijcisjournal
Target detection is a challenging problem having many applications in defense and civil. Most of the
targets in defense are camouflaged. It is difficult for a system to detect camouflaged targets in an image. A
novel and constructive approach is proposing to detect object in camouflage images. This method uses
various methodologies such as 2-D DWT, gray level co-occurrence matrix (GLCM), wavelet coefficient
features, region growing algorithm and canny edge detection. Target detection is achieved by calculating
wavelet coefficient features from GLCM of transformed sub blocks of the image. Seed block is obtained by
evaluating wavelet coefficient features. Finally the camouflage object is highlighted using image
processing schemes. The proposed target detection system is implemented in Matlab 7.7.0 and tested on
different kinds of images.
128-Bit Area Efficient Reconfigurable Carry Select Adder ijcisjournal
Adders are one of the most critical arithmetic circuits in a system and their throughput affects the overall
performance of the system. Carry Select Adder (CSLA) is one of the fastest adders used in many dataprocessing
processors to perform fast arithmetic functions. From the structure of the CSLA, it is clear that
there is scope for reducing the area and power consumption in the CSLA. In this paper, we proposed an
area-efficient carry select adder by sharing the common Boolean logic term. After logic optimization and
sharing partial circuit, we only need one XOR gate and one inverter gate for sum generation. Through the
multiplexer, we can select the final-sum only and for carry selection we need only one AND gate and one
OR gate. Based on this modification 16-, 32-, 64-, and 128-bit CSLA architecture have been developed and
compared with the conventional CSLA architecture. The proposed design greatly reduces the area
compared to other CSLAs. From this improvement, the gate count of a 128-bit carry select adder can be
reduced from 3320 to 1664. The proposed structure is implemented in Artix-7 FPGA. Compared with the
proposed design, the conventional CSLA has 65.80% less area.
Enhanced Optimization of Edge Detection for High Resolution Images Using Veri...ijcisjournal
dge Detection plays a crucial role in Image Processing and Segmentation where a set of algorithms aims
to identify various portions of a digital image at which a sharpened image is observed in the output or
more formally has discontinuities. The contour of Edge Detection also helps in Object Detection and
Recognition. Image edges can be detected by using two attributes such as Gradient and Laplacian. In our
Paper, we proposed a system which utilizes Canny and Sobel Operators for Edge Detection which is a
Gradient First order derivative function for edge detection by using Verilog Hardware Description
Language and in turn compared with the results of the previous paper in Matlab. The process of edge
detection in Verilog significantly reduces the processing time and filters out unneeded information, while
preserving the important structural properties of an image. This edge detection can be used to detect
vehicles in Traffic Jam, Medical imaging system for analysing MRI, x-rays by using Xilinx ISE Design
Suite 14.2.
Impedance Cardiography Filtering Using Non-Negative Least-Mean-Square Algorithmijcisjournal
In general using several signal acquisition methods are applied to get cardio-impedance signal to analyse
the cardiac output. The analysis completely based on frequency information obtained after applying
frequency selection filters and frequency shaping filters. Here proposing a constructive approach involves
a developed Non-Negative LMS (NNLMS) followed by filtering techniques to measure and overcome the
limitations of commonly used approaches. The proposed technique performance is analysed by considering
different types of noise environments like fundamental one white noise and also sum of sinusoidal noise.
The simulation results are useful to measure the performance and accuracy under different noise
environments also a comparative analysis is done with the proposed work with existing methods under
different performance metrics by the help of quantitative analysis of algorithms. Simulation results are
found to be satisfactory in the analysis of cardiac output.
Content Based Image Retrieval Using Gray Level Co-Occurance Matrix with SVD a...ijcisjournal
In this paper, gray level co-occurrence matrix, gray level co-occurrence matrix with singular value
decomposition and local binary pattern are presented for content based image retrieval. Based upon the
feature vector parameters of energy, contrast, entropy and distance metrics such as Euclidean distance,
Canberra distance, Manhattan distance the retrieval efficiency, precision, and recall of the images are
calculated. The retrieval results of the proposed method are tested on Corel-1k database. The results after
being investigated shows a significant improvement in terms of average retrieval rate, average retrieval
precision and recall of different algorithms such as GLCM, GLCM & SVD, LBP with radius one and LBP
with radius two based on different distance metrics.
An Optimized Device Sizing of Two-Stage CMOS OP-AMP Using Multi-Objective Gen...ijcisjournal
A novel approach for optimizing the transistor dimensions of two stage CMOS op-amp using MultiObjective
Genetic Algorithm (MOGA) is presented. The proposed approach is used to find the optimal
dimensions of each transistor to improve op-amp performances for analog and mixed signal integrated
circuit design. The aim is to automatically determine the device sizes to meet the given performance
specifications while minimizing the cost function such as power dissipation and a weighted sum of the
active area. This strongly suggests that the approach is capable of determining the globally optimal
solutions to the problem. Exactness of performance prediction in the device sizing program (implemented
in MATLAB) maintained. Here Six parameters are considered i.e., open loop gain, Phase Margin (PM),
Area (A), Bandwidth of unity Gain (UGB), Power Consumption (P) and Slew Rate (SR). The circuit is
simulated in cadence(Virtuoso Spectre) 0.18um CMOS technology.
A survey on privacy preserving data publishingijcisjournal
Data mining is a computational process of analysing and extracting the data from large useful datasets. In
recent years, exchanging and publishing data has been common for their wealth of opportunities. Security,
Privacy and data integrity are considered as challenging problems in data
mining.Privacy is necessary to protect people’s interest in competitive situations. Privacy is an abilityto
create and maintain different sort of social relationships with people. Privacy Preservation is one of the
most important factor for an individual since he should not embarrassed by an adversary. The Privacy
Preservation is an important aspect of data mining to ensure the privacy by various methods. Privacy
Preservation is necessary to protect sensitive information associated with individual. This paper provides a
survey of key to success and an approach where individual’s privacy would to be non-distracted.
Cryptography technology is a security technique used to change plain text to another shape of data or to
symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey
through public networks. Currently, there are many proposed algorithms that provide this service
especially for sensitive data or very important conversations either through mobile or video conferences. In
this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is
compared to the AES. The algorithm has four different rounds for each quarter of the key container table,
and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight
and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested
algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table
are big.
Comparative Performance Analysis of Low Power Full Adder Design in Different ...ijcisjournal
This paper gives the comparison of performance of full adder design in terms of area, power and delay in
different logic styles. Full adder design achieves low power using the Transmission Gate logic compared to
all other topologies such as Basic CMOS, Pass Transistor and GDI techniques but it make use of more
number of transistors compared to GDI. GDI occupies less area compared to all other logic design styles.
This paper presents the simulated outcome using Tanner tools and also H-Spice tool which shows power
and speed comparison of different full adder designs. All simulations have been performed in 90nm, 45nm
and 22nm scaling parameters using Predictive Technology Models in H-Spice tool.
Noise Immune Convolutional Encoder Design and Its Implementation in Tanner ijcisjournal
With the rapid advances in integrated circuit(IC) technologies, number of functions on a chip was
increasing at a very fast rate, with which interconnect density is increasing especially in functional logic
chips. The on-chip noise affects are increasing and needs to be addressed. In this paper we have
implemented a convolution encoder using a technique that provides higher noise immunity. The encoder
circuit is simulated in Tanner 15.0 with data rate of 25Mbps and a clock frequency of 250MHz
Design of Tripl-Band CPW FED Circular Fractal Antenna ijcisjournal
A novel miniaturized circular fractal antenna is designed by inscribing circular slot on rectangular ground
plane and successively forming circular rings connected by semi-circles for circular-fractal patch. Novel
modified Coplanar Waveguide (CPW) is used as feed for fractal circular patch. The analysis of parametric
variations is performed by consecutive fractal iterations, varying the radius of inscribed circle of ground
plane, slots and different ground plane configurations. To further enhance gain and radiation pattern a
dual inverted L slots is included in ground plane. From the results it is evident that, the proposed fractal
antenna possesses triple bands at 1.8GHz, 3.5GHz and 5.5GHz. These bands are used in Digital
Communication Systems (DCS) (1.8GHz), IEEE 802.16d fixed WiMAX (3.5GHz) and IEEE 802.11a WLAN
(5.5GHz) applications.
Slope at Zero Crossings (ZC) of Speech Signal for Multi-Speaker Activity Dete...ijcisjournal
Multi-Speaker activity (MSA) detection helps in detecting the presence of whether the speech signals has a
single speaker or multiple speaker speeches in the speech signal. It is easy to calculate the slope at ZCs
(zero crossings) of the speech signal and makes a comparison with a suitable threshold (Th). Multi-speaker
is declared as and when the zero crossing value exceeds the threshold. The impact of the proposed
technique is compared to the existing technique by calculating the sample-by-sample ZCR (Zero crossing
rate) value is demonstrated. Experimental results prove that the proposed ZCR technique achieves accurate
results than the traditional techniques for MSA detection that uses the cepstrum resynthesis residual
magnitude (CRRM) in the literature.
Improvement of Search Algorithm for Integral Distinguisher in Subblock-Based ...ijcisjournal
Integral distinguisher is the main factor of integral attack. Conventionally, higher order integral distinguisher is obtained as an extension of first order integral (conventional algorithm). The algorithm was applied to many subblock-based block ciphers, however, the conventional algorithm has some problems. We find other integral distinguisher of two sub block-based block ciphers, TWINE and LBlock, which are different from the conventional evaluations. As a solution, we propose a new algorithm to search for higher order integral distinguisher. The point of a proposal algorithm is exploitation of bijective and injective components of cipher functions. Applying the proposal algorithm to TWINE and LBlock, we confirm the results of the proposal algorithm are consistent with the results which are calculated from computer experiment. The results are the optimal distinguisher and the most advantageous one for the attackers. Our proposal algorithm contributes to development of stronger block ciphers by obtaining such integral distinguisher.
International Journal on Cryptography and Information Security ( IJCIS)ijcisjournal
International Journal on Cryptography and Information Security ( IJCIS) is an open access peer reviewed journal that focuses on cutting-edge results in applied cryptography and Information security. It aims to bring together scientists, researchers and students to exchange novel ideas and results in all aspects of cryptography, coding and Information security.
NEW ALGORITHM FOR WIRELESS NETWORK COMMUNICATION SECURITYijcisjournal
This paper evaluates the security of wireless communication network based on the fuzzy logic in Mat lab. A new algorithm is proposed and evaluated which is the hybrid algorithm. We highlight the valuable assets in designing of wireless network communication system based on network simulator (NS2), which is crucial to protect security of the systems. Block cipher algorithms are evaluated by using fuzzy logics and a hybrid
algorithm is proposed. Both algorithms are evaluated in term of the security level. Logic (AND) is used in the rules of modelling and Mamdani Style is used for the evaluations
Enhancing the Techniques to Secure Grid Computingijtsrd
Security is important issue in every aspect in todays world if you are using the networks. Various algorithms are there to secure your network so that unauthorized user cant breach into your accounts. SO for this authentication and authorization plays an important role but apart from these use of various encryption algorithms are there for grid data security. By using these algorithms you can easily secure your network and it will also enhance the performance of our grid networks. In this paper model has been designed for grid security that is been implemented on network Simulator and the performance has been measured with the previous models. By using various cryptographic algorithms the efficiency and the packed delivery ratio is increased incredibly. Simranjeet Kaur"Enhancing the Techniques to Secure Grid Computing" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-1 | Issue-6 , October 2017, URL: http://www.ijtsrd.com/papers/ijtsrd2531.pdf http://www.ijtsrd.com/computer-science/computer-network/2531/enhancing-the-techniques-to-secure-grid-computing/simranjeet-kaur
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
Secured authentication of radio-frequency identification system using PRESENT...IJECEIAES
The internet of things (IoT) is an emerging and robust technology to interconnect billions of objects or devices via the internet to communicate smartly. The radio frequency identification (RFID) system plays a significant role in IoT systems, providing most features like mutual establishment, key establishment, and data confidentiality. This manuscript designed secure authentication of IoT-based RFID systems using the lightweight PRESENT algorithm on the hardware platform. The PRESENT-256 block cipher is considered in this work, and it supports 64-bit data with a 256-key length. The PRESENT-80/128 cipher is also designed along with PRESENT-256 at electronic codebook (ECB) mode for Secured mutual authentication between RFID tag and reader for IoT applications. The secured authentication is established in two stages: Tag recognition from reader, mutual authentication between tag and reader using PRESENT80/128/256 cipher modules. The complete secured authentication of IoTbased RFID system simulation results is verified using the chip-scope tool with field-programmable gate array (FPGA) results. The comparative results for PRESENT block cipher with existing PRESENT ciphers and other lightweight algorithms are analyzed with resource improvements. The proposed secured authentication work is compared with similar RFID-mutual authentication (MA) approaches with better chip area and frequency improvements.
ARTIFICIAL NEURAL CRYPTOGRAPHY DATAGRAM HIDING TECHNIQUES FOR COMPUTER SECURI...IAEME Publication
Cryptography is the scientific study of mathematical and algorithmic techniques relating to information security. Cryptographic techniques will help to protect information in cases where an attacker can have physical access to the bits representing the information, ex. When the information has to be sent over a communication channel that can be eaves dropped on by an attacker. Cryptographic primitives are the basic building blocks for constructing cryptographic solutions to information protection problems. A cryptographic primitive consists of one or more algorithms that achieve a number of protection goals. There is no well-agreed upon complete list of cryptographic primitives, nor are all cryptographic primitives independent, it is often possible to realize one primitive using a combination of other primitives.
A Comparative Study of RSA and ECC and Implementation of ECC on Embedded SystemsAM Publications
A large share of embedded applications are wireless, which makes the communication channel especially vulnerable. The research in the field of ECC is mostly focused on its implementation on application specific systems, which have restricted resources like storage, processing speed and domain specific CPU architecture. The focus of this research is on the implementation of ECC in an embedded iOS application to compare the performance measures obtained in the wireless environment or embedded systems by using elliptic curve cryptography (ECC), with a traditional cryptosystem like RSA.
A PERFORMANCE EVALUATION OF COMMON ENCRYPTION TECHNIQUES WITH SECURE WATERMAR...IJNSA Journal
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are considering the important performance of these algorithms like CPU time consumption, memory usage and battery usage. This research tries to demonstrate a fair comparison between the most common algorithms and with a novel method called Secured Watermark System (SWS) in data encryption field according to CPU time, packet size and power consumption. It provides a comparison the most known algorithms used in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the compared encryption algorithms with different parameters.
Ciphering algorithms play a main role in information security systems. Therefore in this paper we are
considering the important performance of these algorithms like CPU time consumption, memory usage and
battery usage. This research tries to demonstrate a fair comparison between the most common algorithms
and with a novel method called Secured Watermark System (SWS) in data encryption field according to
CPU time, packet size and power consumption. It provides a comparison the most known algorithms used
in encryption: AES (Rijndael), DES, Blowfish, and Secured Watermark System (SWS).
For comparing these algorithms with each other variations of data block sizes, and a variation of
encryption-decryption speeds where used in this research.
In addition a comparison with different platforms such as Windows 8, Windows XP and Linux has been
conducted. Finally the results of the experimentation demonstrate the performance and efficiency of the
compared encryption algorithms with different parameters.
Creation of smart spaces and scaling of devices to achieve miniaturization in pervasive computing environments has put forth a question on the degree of security of such devices. Security being a unique challenge in such environments, solution demands scalability, access control, heterogeneity, trust. Most of the existing cryptographic solutions widely in use rely on the hardness of factorization and number theory
problems. With the increase in cryptanalytic attacks these schemes will soon become insecure. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this work, we discuss the aspects of Lattice based cryptography as a new dimension of providing security whose strength lies in the hardness of lattice problems. We discuss about a cryptosystem whose security relies on high lattice dimension.
Review and Performance Comparison of Distributed Wireless Reprogramming Proto...IOSR Journals
Abstract:A Reprogramming service should be efficient, reliable and secured in Wireless sensor network.
Wireless reprogramming for wireless sensor network emphasize over the process of changing or improving the
functionality of simulation or existing code. For challenging and on demand security purpose, secure and
distributed routing protocols such as SDRP and ISDRP were developed. This paper reviews and compares the
propagation delay for two reprogramming protocols, SDRP and ISDRP, which based on hierarchy of energies
in network. Both are based on identity-based cryptography. But in the improved protocol the keys are
distributed to the network as per the sorting and communication capabilities to improve the broadcast or
communication nature of the network. Moreover, ISDRP demonstrates the security concepts, which deals over
the key encryption properties using heap sort algorithm and the confidentiality parameter is enhanced by
changing the private key values after certain interval of time for cluster head in respect to different public keys.
The ISDRP shows high efficiency rate clearly with the throughput and propagation results by implementation in
practice over SRDP.
Keywords: identity-based cryptography,ISDRP, heapsort algorithm, Reprogramming, SDRP, Wireless sensor
network.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
Connector Corner: Automate dynamic content and events by pushing a buttonDianaGray10
Here is something new! In our next Connector Corner webinar, we will demonstrate how you can use a single workflow to:
Create a campaign using Mailchimp with merge tags/fields
Send an interactive Slack channel message (using buttons)
Have the message received by managers and peers along with a test email for review
But there’s more:
In a second workflow supporting the same use case, you’ll see:
Your campaign sent to target colleagues for approval
If the “Approve” button is clicked, a Jira/Zendesk ticket is created for the marketing design team
But—if the “Reject” button is pushed, colleagues will be alerted via Slack message
Join us to learn more about this new, human-in-the-loop capability, brought to you by Integration Service connectors.
And...
Speakers:
Akshay Agnihotri, Product Manager
Charlie Greenberg, Host
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
GraphRAG is All You need? LLM & Knowledge GraphGuy Korland
Guy Korland, CEO and Co-founder of FalkorDB, will review two articles on the integration of language models with knowledge graphs.
1. Unifying Large Language Models and Knowledge Graphs: A Roadmap.
https://arxiv.org/abs/2306.08302
2. Microsoft Research's GraphRAG paper and a review paper on various uses of knowledge graphs:
https://www.microsoft.com/en-us/research/blog/graphrag-unlocking-llm-discovery-on-narrative-private-data/
State of ICS and IoT Cyber Threat Landscape Report 2024 previewPrayukth K V
The IoT and OT threat landscape report has been prepared by the Threat Research Team at Sectrio using data from Sectrio, cyber threat intelligence farming facilities spread across over 85 cities around the world. In addition, Sectrio also runs AI-based advanced threat and payload engagement facilities that serve as sinks to attract and engage sophisticated threat actors, and newer malware including new variants and latent threats that are at an earlier stage of development.
The latest edition of the OT/ICS and IoT security Threat Landscape Report 2024 also covers:
State of global ICS asset and network exposure
Sectoral targets and attacks as well as the cost of ransom
Global APT activity, AI usage, actor and tactic profiles, and implications
Rise in volumes of AI-powered cyberattacks
Major cyber events in 2024
Malware and malicious payload trends
Cyberattack types and targets
Vulnerability exploit attempts on CVEs
Attacks on counties – USA
Expansion of bot farms – how, where, and why
In-depth analysis of the cyber threat landscape across North America, South America, Europe, APAC, and the Middle East
Why are attacks on smart factories rising?
Cyber risk predictions
Axis of attacks – Europe
Systemic attacks in the Middle East
Download the full report from here:
https://sectrio.com/resources/ot-threat-landscape-reports/sectrio-releases-ot-ics-and-iot-security-threat-landscape-report-2024/
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
LF Energy Webinar: Electrical Grid Modelling and Simulation Through PowSyBl -...DanBrown980551
Do you want to learn how to model and simulate an electrical network from scratch in under an hour?
Then welcome to this PowSyBl workshop, hosted by Rte, the French Transmission System Operator (TSO)!
During the webinar, you will discover the PowSyBl ecosystem as well as handle and study an electrical network through an interactive Python notebook.
PowSyBl is an open source project hosted by LF Energy, which offers a comprehensive set of features for electrical grid modelling and simulation. Among other advanced features, PowSyBl provides:
- A fully editable and extendable library for grid component modelling;
- Visualization tools to display your network;
- Grid simulation tools, such as power flows, security analyses (with or without remedial actions) and sensitivity analyses;
The framework is mostly written in Java, with a Python binding so that Python developers can access PowSyBl functionalities as well.
What you will learn during the webinar:
- For beginners: discover PowSyBl's functionalities through a quick general presentation and the notebook, without needing any expert coding skills;
- For advanced developers: master the skills to efficiently apply PowSyBl functionalities to your real-world scenarios.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024Tobias Schneck
As AI technology is pushing into IT I was wondering myself, as an “infrastructure container kubernetes guy”, how get this fancy AI technology get managed from an infrastructure operational view? Is it possible to apply our lovely cloud native principals as well? What benefit’s both technologies could bring to each other?
Let me take this questions and provide you a short journey through existing deployment models and use cases for AI software. On practical examples, we discuss what cloud/on-premise strategy we may need for applying it to our own infrastructure to get it to work from an enterprise perspective. I want to give an overview about infrastructure requirements and technologies, what could be beneficial or limiting your AI use cases in an enterprise environment. An interactive Demo will give you some insides, what approaches I got already working for real.
Kubernetes & AI - Beauty and the Beast !?! @KCD Istanbul 2024
A novel authenticated cipher for rfid systems
1. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
DOI:10.5121/ijcis.2014.4102 13
A NOVEL AUTHENTICATED CIPHER FOR RFID
SYSTEMS
Zahra Jeddi, Esmaeil Amini and Magdy Bayoumi
The Centre for Advanced Computer Studies, University of Louisiana at Lafayette,
Lafayette, LA, USA
ABSTRACT
In this paper, we present RBS (Redundant Bit Security) algorithm which is a low-complexity symmetric
encryption with a 132-bit secret key. In this algorithm redundant bits are distributed among plaintext data
bits to change the location of the plaintext bits in the transmitted data without changing their order. The
location of redundant bits inside the transmitted data represents the secret key between sender and
receiver. The algorithm provides integrity and authentication of the original data as well. The
implementation comparison of this algorithm with other algorithms confirms that it a good candidate for
resource-constraint devices such as RFID systems and wireless sensors.
KEYWORDS
RFID systems, symmetric encryption algorithm, private key, authentication
1. INTRODUCTION
Radio Frequency Identification (RFID) is a method used for identifying items like barcodes. In
RFID systems the identification is performed using radio signals and there is no physical contact
like barcodes. This way, huge number of items can be identified in a short time with high
reliability and low cost which makes this method very attractive for applications like supply chain
management, e-health, monitoring objects, electrical tagging, etc.
In general, each RFID system consists of three parts. i) Transponder or tag which is implemented
on objects for storing data, ii) Transceiver or reader which provides electromagnetic field in order
for activating tags and reading their data through radio frequency waves, and iii) A back-end
server which receives and processes data from readers.
Among these three parts, tags have more implementation limitations. There are two types of tags
in general: active and passive tags. Active tags are equipped with their own batteries whereas
passive tags rely on radio frequency energy transferred from the reader. Compared to active tags,
passive tags have longer life time, are smaller and lighter but, their signal range is shorter than
active tags. Passive tag systems are severely constrained on chip area and power consumption as
they do not have internal power source. This paper focuses on the passive RFID tags and their
power limitations.
Since the communication between the tags and the reader is done through an unsecure wireless
channel, the transmitted data is vulnerable to attacks by unauthorized readers. These attacks are
categorized into two main groups: privacy violation and security violation [1]. In privacy
violation, the attacker tries to harvest information from the objects by eavesdropping to the
communications between the object and the reader or by tracking them. In security violation, an
2. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
14
adversary counterfeit behaviours of a tag or a reader for making undesirable communications.
Therefore, a mechanism is required to provide privacy and security during the communication.
This demand can be accomplished either physically or cryptographically.
The most known physical methods in RFID security are killing tags, blocking tags, Faraday cage
and active interference [2]. Each of these methods has its pros and cons. Killing a tag, the tag will
lose its functionality and cannot be reactivated which considerably reduces the life time of tags.
Blocking tag method, attacker cannot have access to tags just in a defined range and beyond this
range, tags are not protected from attacks. In Faraday cage method, a wrapper shields the tag from
radio waves which imposes another cost to the system. In active interference method,
unauthorized readers are impeded to have communications with tags, but sometimes legal readers
get blocked as well. Based on the limitations and disadvantages of physical mechanisms stated
above, these methods are only applicable for some specific applications.
Regarding cryptographic solutions, tags are extremely resource limited for adapting conventional
encryption methods. These limitations are strong motivations for investigating light encryption
algorithms which can handle the area and power constraints of RFID systems. In this paper, a
new light symmetric encryption algorithm is proposed called RBS. In RBS, the message is
intentionally manipulated by distributing redundant bits among plaintext bits and the location of
redundant bits inside the transmitted data represents the secret key between sender and receiver.
Meanwhile, there is a relation between plaintext data and redundant data in RBS algorithm. These
redundant bits are generated by Message Authentication Code (MAC) algorithm which its input is
the plaintext data. This way, these redundant bits can be used for authenticating the message as
well. In RBS, the security level of the algorithm is adjustable through the number of redundant
bits. In other words, there is a dependency between the provided security and the authentication
part of the system which distinguishes RBS algorithm from other existing algorithms. To have
flexibility in the number of redundant bits, the implemented MAC algorithm generates variable
length outputs. In addition to the number of redundant bits, their values and their positions in the
ciphertext are also determining factors in the security of the generated ciphertext. Furthermore,
some plaintext bits are also altered based on the value of the encryption key and redundant bits in
order to make the generated ciphertext more secure against attacks.
The rest of this paper is organized as follows: Section 2 presents some related work presented in
literature. The relation between redundant bits, security and key space is discussed in sections 3.
Then, the algorithm of RBS is presented in section 4. The proposed implementation is presented
in section 5. Experimental results are presented in sections 6 and section 7 concludes the paper.
2. RELATED WORK
Cryptographic algorithms are divided into two main groups: Private key or Symmetric algorithms
and Public key or Asymmetric algorithms. Public key algorithms such as RSA and Elliptic Curve
Cryptography (ECC) are very strong in terms of security and they provide reliability,
confidentiality, integrity, availability and non-repudiation services altogether. ECC-based systems
offer similar security for smaller key sizes compared to RSA-based systems. Since the
computational and area complexities of hardware implementations for cryptographic algorithms
are proportional to their key sizes, ECC-based systems are smaller, faster, and consume less
power compared to RSA-based systems [3]. Therefore, ECC algorithm is a better choice than
RSA algorithm for resource constrained systems.
A lot of research has been done on hardware-efficient ECC implementations [4-13]. In [4, 5] the
authors have tried to make a relation between power consumption of their ECC architectures and
the requested security level. In [6], the authors have tried to adapt ECC algorithm with RFID
3. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
15
systems by reducing the number of registers, operations and the operation frequency and have
used restructured formulas as much as possible in order to meet the resource limitations of RFID
systems. Making ECC algorithm lighter is another solution. Reducing the flexibility of ECC
algorithm by limiting the parameters such as using only one special elliptic curve [7], selecting
specific field sizes [8] or choosing specific prime numbers [9-12] are other ways to make ECC
algorithm lighter. Although applying dedicated hardware with these limitations leads to meet the
power limitation, but, any change in security parameters imposes replacement of all tags with
new ones. Authors of [13] addressed the design of an ECC-based M-PKI usable for mobile
phones/devices by some modifications on the existing PKI.
Since Public key algorithms have still significant challenges for RFID systems’ implementation,
recently researches have been directed towards Private Key schemes. Private Key algorithms are
divided into three categories: block ciphers, stream ciphers and hybrid ciphers which are the
combination of block and stream ciphers. In block cipher algorithms, the message is broken into
the fixed size of blocks and each block is en/decrypted individually. Stream ciphers encrypt one
bit or one byte at a time. They rely on the generation of a pseudorandom keystream and use XOR
function for encryption.
AES [14] and PRESENT [15] are known block cipher algorithms. AES is basically designed for
efficient software implementation. The best known lightweight AES requires 3200 gate
equivalent (GE) for implantation. PRESENT is another lightweight encryption algorithm which is
based on S-Box and is inspired by the techniques used in DES and AES. This algorithm takes 32
rounds working with either 80 bit or 128 bit keys. In each round, after adding the round key to the
plaintext, s-box is applied on it for 16 times in parallel. Area optimized version of PRESENT is
implemented by 1075 GE and in 563 clock cycles generates 64-bit ciphertext.
Grain-128 [16] and Trivium [17] are two known stream cipher algorithms. Grain uses 128-bit key
and 96-bit initial vector (IV) and Trivium uses 80-bit key and an 80-bit IV. Trivium provides a
flexible trade-off between speed and gate count in hardware. It consists of three shift registers of
different lengths.
The Hummingbird-2 (HB-2) [18] is hybrid cipher with 128-bit key and 64-bit initial vector. It
operates on 16-bit blocks and it is performed by a series of exclusive-or, addition modulo and a
nonlinear mixing operations. This algorithm has an initialization phase before encryption like
Grain. The first version of this algorithm was vulnerable to a chosen-IV and chosen-message
attack [19].
Private Key encryption algorithms can provide authentication and integrity using message
authentication code (MAC) algorithms such as HMAC [20]. In this approach, the plaintext and
the authentication key are both fed into the MAC algorithm and then the generated MAC digest is
appended to the plaintext before encryption. In the receiver side, the received message will be
accepted if the MAC of the decrypted message is identical with the received MAC.
Grain [16] and HB-2 [18] algorithms both provide optional authentication. In these two
algorithms, the authentication code is appended to the encrypted message. Both of these two
algorithms do not impose considerable hardware overhead for providing the authentication as
they share the same hardware for encryption and authentication. However, authentication has its
own timing overhead as it cannot be done along with encryption phase. In Grain method, the
authentication key is required to be changed after each usage. Otherwise, the attacker will find the
authentication key with comparing two or three different ciphertexts. Since exchanging keys in
symmetric algorithms is a big challenge, refreshing this key imposes undesirable overhead to the
algorithm.
4. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
16
This paper proposes a new symmetric encryption method for RFID systems, called RBS;
Redundant Bit Security which provides both authentication and confidentiality at the same time
with low overhead in performance, area and power consumption. This method is based on
inserting the redundant bits into the altered plaintext. The contribution of this work is using the
output of light RFID MAC algorithms proposed in [21], as the redundant bits and merging them
with the altered original bits. This way, the redundant bits provide authentication, integrity and
confidentiality. The light MAC algorithm in [21] supports different digest sizes. As a result, the
number of redundant bits and accordingly the security level could be adjusted in RBS without
requiring changing the underlying MAC algorithm.
3. PRELIMINARIES
Typically, encryption algorithms are based on applying some mathematical operations on the
plaintext and ciphertext. Unlike these conventional encryption methods, the proposed RBS
algorithm in this paper does not use these mathematics computations for encryption and
decryption. Instead, the message is intentionally manipulated by inserting redundant bits into
original bits. In this algorithm, the location of the original bits changes in the ciphertext. As an
example, suppose that the original message is “1010”. Inserting one redundant bit at the third
place changes the message to “10110”. Knowing that just one bit is redundant, the attacker
confronts with four possible plaintexts. Besides redundant bits’ locations, their values are
important as well. For instance, assume that the original bits are all zero so adding one ‘0’ bit as a
redundant bit will not have the same effect as adding a “1” redundant bit in this case. Therefore, i)
the number of redundant bits, ii) their locations and iii) their values are all important in hiding the
plaintext inside the ciphertext. In other words, there is a relation between the security level of
RBS algorithms and each of these three parameters. The first parameter is discussed in the
following sub-section and the other two parameters are studied in Section4.
3.1 Key space
Security level is defined by answering this question: How long it will take for an attacker to break
the algorithm and what resources he needs in order to have a reasonable chance of succeeding?
One of the well-known tools for measuring the security level of an algorithm is key space. The
security level of an encryption algorithm has a direct relation with its key space. Key space is the
set of all possible keys that can be used to initialize a cryptographic algorithm.
Let us explain the concept in RBS algorithm. Suppose that n is the number of original bits or
plaintext and m is the number of redundant bits. The ciphertext is an (n+m)-bit data obtained by
insertion of redundant bits among plaintext bits. The location of redundant bits inside the
ciphertext defines the secret key. Therefore, the secret key is simply an (n+m)-bit string where
“1” in this string represents the location of redundant bit and “0” represents the location of
plaintext bit in the ciphertext.
The size of key space (s) or the number of possible locations of redundant bits in the ciphertext
depends on n and m and is expressed by Equation (1).
=
+
=
( + )!
! !
=
∏ ( + )=1
!
(1)
In Equation (1), m and n are interchangeable. In other words, increasing either the number of
redundant bits or the number of plaintext bits has the same effect on the key space size. As a
result, fixing one of them, the size of key space can be adjusted to the desired security level by
5. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
17
changing the other parameter. However, increasing one of the factors and decreasing the
other one results in different way as depicted in Figure 1.
0
20
40
60
80
100
120
0 20 40 60 80 100 120
LOG2ofKeySpace
Number of Redundant bits
Figure 1. Size of key space vs. number of plaintext bits (n) and redundant bits (m) when n + m is fixed
In this figure n and m are changing while the total number of bits is constant (n + m =
100). It shows that when these two factors are far from each other, the key space will
reach to its minimum size. The maximum size of key space happens when the number of
redundant bits is equal with the size of plaintext. Based on this graph, high security level
for small block of plaintexts is not possible unless with large number of redundant bits.
Likewise, it is not possible to provide high security level with low number of redundant
bits.
Figure 2 exhibits how big the key space can be for different n, and m when (n = m) which helps in
finding the desired number of plaintext bits and redundant bits.
0
20
40
60
80
100
120
140
160
180
0 20 40 60 80 100
LOG2ofKeySpace
Number of redundant bits
Figure 2. Size of key space vs. number of plaintext bits (n) and redundant bits (m) when n=m
As mentioned before, there is a relation between the size of the key space of an encryption
algorithm and its security level against possible attacks. The question is how big the space key
should be to guarantee the desired security. The Brute-Force attack has been studied for finding
the boundary of the key space for RBS algorithm. In this attack the attacker performs a complete
search through all possible keys of the key space to find the right key.
6. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
18
The 2128
key space size is computationally secure against Brute-Force attack [22]. Applying this
number in Equation (1), there will be a variety of choices for m and n. Figure 3 demonstrates the
relation between size of key space and m for (n=64). Increasing m from 0 to 128; the key space
(s) will exponentially increase from 1 to 2172
.
0
20
40
60
80
100
120
140
160
180
200
0 50 100 150
LOG2ofKeyspace
# of redundant bits
Figure 3. Size of key space vs. number of redundant bits (m) when plaintext size (n) is fixed (n=64)
Table-1 shows a possible set of m ad n for s=2128
. Considering the fact that the required energy for
transmitting the message increases by the length of ciphertext, m and n should be chosen
regarding this fact. Referring to Table 1, this happens when (n,m) ∈ {(64,68), (65,67), (66,66),
(67,65), (68,64)} which is highlighted in Table 1. The best choice is (64, 68) as data blocks are
processed and stored normally in multiples of 8-bits.
Table 1. The number of bits required in ciphertext to have s=2128
M 50 55 57 60 63 64 65 66 67 68 70 73 78 91
N 91 81 78 73 70 68 67 66 65 64 63 60 57 50
c* 140 136 135 133 133 132 132 132 132 132 133 133 135 140
c* : # of bits in the ciphertext
4. RBS ALGORITHM
In proposed RBS algorithm, one 64-bit data block is encrypted into a 132-bit ciphertext using a
132-bit secret key. In other words, 68-bit redundant data is distributed among 64 bits of plaintext.
Since the number of redundant bits, their locations and their values are all important in the
security level of the algorithm; this section is dedicated to find the relation between these
parameters and the security level.
4.1 Location of the redundant bits inside the ciphertext
The distribution of redundant bits inside the ciphertext should not follow any linear mathematic
or non-linear mathematic function, otherwise i) the size of the key space will be reduced, ii) a
dependency will be constructed among redundant bits and iii) redundant bits will be distributed
uniformly among plaintext bits. Therefore, the position of every redundant bit must be
independent of other bits’ positions. This way, if one of the redundant bits being exposed it will
7. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
19
just shrink the key space while location of other redundant bits is still secret. The solution is
random distribution of redundant bit inside the ciphertext.
4.2 The value of redundant bits inside the ciphertext
In addition to providing confidentiality of the sent data, the injected redundant bits can carry
some additional information about the original data as well. For generating these redundant bits,
there are three options:
• Choosing constant values. In this case, the redundant bits are the same for different
plaintexts. Comparing different ciphertexts, the attacker can easily figure the location of
the redundant bits.
• Choosing random values. In this case there would be several ciphertexts for one plaintext.
This way the attacker can find the location of the redundant bits by comparing the
different resulted ciphertexts for the same plaintext.
• Values of redundant bits are injective functions of the plaintext. So, there is a unique
redundant data per each plaintext. As a result, plaintext and redundant data cannot be
distinguished easily in the ciphertext.
Among these three approaches, the third one is chosen as it has potential to provide both attack
prevention and authentication. This algorithm can be implemented by splitting the plaintext into
small blocks and performing mathematical functions on each of blocks individually. At the end,
all block are combined while it is encrypted by a secret key. The pseudo program of this
algorithm is presented in Figure 4.
1. Split the plaintext into several small segments Si.
2. for each Si
Shift/rotate/add/XOR (Si , a constant number Ni)
3. Combine all segments Si to a single segment S
4. Encrypt (S, secret key K) using a symmetric algorithm
//K will be used in the receiver side for authenticating the sender
Figure 4. Redundant data generation algorithm
One applicable implementation for the presented algorithm in Figure 4 is MAC algorithm as a
very small change in the plaintext will produce a very different output. Using MAC algorithm for
generating the redundant bits, integrity and authentication will be provided as well as
confidentiality which will be discussed in the following subsection.
4.2.1 Message authentication and Data Integrity
Data integrity is defined as maintaining correctness and consistency of a message. Since the
message is sent via wireless network, the message is in danger of being altered in transmission by
an adversary or environmental hazards, such as heat, dust, and electrical surges. Therefore,
the receiver should validate the received data.
Message authentication guarantees that the received message has been sent by an eligible user. It
is crucial for a party – tag or reader - which receives a message to be sure who has sent it.
8. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
20
Message Authentication Code or MAC is a piece of information which is used for both data
integrity and authentication purposes. It is generated by a MAC algorithm which has two inputs i)
an arbitrary-length message and ii) a shared key between two parties. Typical MAC algorithms
such as HMAC and MD-5 guarantee that no collusion will happen in their outputs for different
input messages.
In general, there are three protocols for embedding the MAC inside the ciphertext.
• After generating the MAC using the authentication key, Kmac, MAC will be attached to
the original message and then the new message is encrypted by encryption key, Kenc
(Figure 5.a) [20]. In the receiver side, after decrypting the received data, the MAC part
will be regenerated and then compared with the received one. Generating the same MAC
means that the message is intact and it is sent by an authorized user. Otherwise the
received message will be discarded.
• The generated MAC will be attached to the end of the encrypted message before
transmission (Figure 5.b). Grain [16] and HB-2 [18] use this protocol.
• Instead of the plaintext, the MAC of the encrypted plaintext is attached to encrypted
message before transmission (Figure 5.c).
(a) First authentication protocol
(b) second authentication protocol
(c) third authentication protocol
(d) proposed authentication protocol
Figure 5. Embedding tag inside the ciphertext in different protocols
9. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
21
In the second and third protocols, the boundary between the MAC and message is clear. Hence,
the MAC algorithms used in these protocols are required to be very secure against the substitution
attack. In this attack, the adversary tries to replace the legitimate message with his own plaintext
and MAC assuming it will be accepted by the receiver. In the other side, the first protocol is more
secure against this attack because MAC is encrypted along with the plaintext and there is no
direct access to it.
4.2.2 Message authentication and Redundant Bits
The second and third MAC generation protocols shown in Figure 5 are not used in RBS algorithm
as we want to distribute the MAC output or redundant data among plaintext bits. Instead, we have
used the first protocol with a slight modification (Figure 5.d). Here, the MAC part is inserted
between message bits instead of being appended to the message. In other words, merging the
MAC with plaintext is itself a part of encryption process. The distribution pattern of the MAC
part inside the ciphertext is based on the encryption key. At the receiver side, the received data is
broken into two parts based on the encryption key: the altered plaintext and redundant bits or
MAC. Regenerating the MAC at the receiver side and comparing it with the received MAC, the
receiver decides to keep the data or discard it.
4.3 Plaintext manipulation
How the plaintext appears inside the ciphertext is directly related to the confidentiality of the
algorithm. Three possible scenarios for this issue will be discussed in the following subsections.
4.3.1 Direct appearance inside the ciphertext
In this approach, the original plaintext bits will be merged with redundant bits. Likewise, in
decryption process, the plaintext can easily be extracted from the ciphertext by removing the
redundant bits. Despite the simplicity of this method, it shrinks the key space and makes the
algorithm vulnerable to some attacks like known plaintext attack and chosen plaintext attack. In
these attacks, since the attacker knows the plaintext, those bits of ciphertext which have the same
value of the plaintext will be potential locations for plaintext in the secret key. For example, if the
plaintext is a string of zeros, all corresponding zeros in the ciphertext might be zero in the secret
key too.
There are some ways to increase the key space size such as increasing the number of redundant
bits or having separate encryption keys based on the plaintext pattern. Increasing the number of
redundant bits introduces more overhead of MAC implementation and so more power for
transmitting the ciphertext. Generating a new key based on the plaintext pattern and exchanging it
with receiver are also challenging tasks in symmetric encryption algorithms.
4.3.2 Bitwise addition with constant-value keystream
In this approach, some fixed bits of the plaintext will always be altered in the ciphertext
regardless of the pattern of the plaintext. It makes the algorithm secure against known
plaintext attack because the attacker does not know which bits of plaintext are altered in
the ciphertext. However, it is still vulnerable to chosen plaintext attack. For example, if the
attacker changes only one bit of the plaintext, all bits of the plaintext except the changed one will
appear in the ciphertext. Comparing two ciphertexts of two almost same embedded plaintexts
shrinks the key space and makes it easier to find approximate location of the changed bit in the
plaintext.
10. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
22
4.3.3 Bitwise addition with variable-value keystream
In this approach, the plaintext bits are XOR-ed with a keystream which is a function of the
plaintext. In other words, there is a unique keystream per each plaintext. This approach is
somehow similar to one-time pad where the plaintext is altered with a variable keystream.
However in one-time pad method, the keystream is a random generated number and it is
independent of the plaintext so for two same plaintexts it may generate different keystreams.
The dependency between the keystream and plaintext makes this approach more secure against
known-plaintext and chosen-plaintext attacks as a small change in plaintext changed the number
of altered bits and their locations as well. This feature motivates us to apply this approach in RBS.
One applicable mean for implementing this approach is through MAC function. As mentioned
before, the redundant bits are generated through MAC as well. For the sake of resource sharing,
the same MAC hardware is used for generating both redundant bits and keystream.
Instead of using the MAC(P) as a keystream, the MAC(redundant bits) which is equivalent to
MAC(MAC(P)) will be used for generating the keystream as illustrated in Figure 6(a). As this
figure shows, the generated keystream is XOR-ed with the plaintext and eventually is merged
with redundant data.
The decryption process is illustrated in Figure 6(b). Knowing the key, the receiver extracts the
redundant part from the ciphertext. Afterwards, the keystream will be generated through
MAC(redundant) which then will be used for recovering the original plaintext bits.
(a) RBS Encryption (b) RBS Decryption
Figure 6. Block diagram of encryption and decryption
5. IMPLEMENTATION
The hardware implementation of RBS is composed of three main parts: MAC generator,
encryption part, and decryption part which will be discussed in detail in the following
subsections.
M MAC
Generator
Redundant
Bits
MAC
Generator
Keystream
Encryption
CipherText
Altered
Plaintext
11. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
23
5.1 MAC Generator
The applied MAC system in RBS is a special case as it must be flexible at the size of MAC which
is typically fixed for most MAC algorithms. For example, SHA-0 and MD5 algorithms generate
160-bit and 128-bit MACs respectively. The MAC algorithm proposed in [21] is from universal
hash function family and supports variable-size output MAC digest which motivated us to use it
in RBS.
The MAC algorithm in [21] is composed of one linear shift register (LFSR), one non-linear shift
register (NFSR) and one accumulator (Figure 7). LFSR and NFSR together build up a pseudo
random number generator (PRNG). The output of this PRNG, s(x), is the result of performing
bitwise addition of LFSR with the result of NFSR function which feeds back into the NFSR. The
value of s(x) depends on the initialized value of these two registers.
The accumulator register bits are XOR-ed by NFSR’s value if (mi = 1). The input mi, is the input
message which is checked by accumulator bit by bit.
Figure 7. Hardware implementation of MAC algorithm in [21]
[LFSR,NFSR] registers are both initialized to authentication key and the accumulator register is
initialized to zero. Then, the message enters bit by bit at each clock cycle. When all bits of input
message are checked, the MAC will be ready in accumulator register.
Applying this hardware in RBS, the size of the accumulator and the NFSR registers must be equal
to the length of the MAC or redundant data. In order to have the same key for both authentication
and encryption, the size of LFSR key is set to n which forms a (n+m)-bit key when combined
with m-bit NFSR key (Equation 2).
Kauthentication = {KLFSR , KNFSR}
KLFSR={K0,…,Kn-1}, KNFSR={Kn,…,Kn+m-1} (2)
This MAC algorithm is inherently designed for stream ciphers and LFSR plays a major role in the
process because its present state will be referred for refreshing the authentication key in the next
communication step. Since RBS is a block cipher and it uses fixed authentication key for each
communication step, so keeping LFSR register is not required anymore. However, the LFSR key
is required in generating pseudo-random numbers. Therefore, the LFSR key enters to NFSR
register bit by bit.
Similar to all universal hash functions, chosen MAC algorithm is guaranteed to be collision free
as long as there is a unique key per each message [23]. So, there must be unique KNFSR and KLFSR
per each message. To satisfy this condition in RBS, KNFSR and KLFSR are generated through
performing bitwise addition on plaintext and initial key. The adapted MAC with RBS is shown in
figure 8.
12. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
24
Accumulator
NFSR
mi
mi
ki
s(x)
Figure 8- Adapted MAC with RBS
5.2 Encryption part
The encryption process completes in two phases. First, the plaintext bits are altered through
bitwise addition with keystream which itself is the MAC(redundant data). In the second phase,
the altered message is merged with redundant bits during data transmission. Figure 9 illustrates
the process, where the altered plaintext bit (pi), redundant bit (rj), and encryption key bit (kl) enter
the cipher bit by bit and based on (kl) value, either pi or rj will be transmitted.
Figure 9. Encryption Part
5.3 Decryption part
At the first step of decryption process, redundant bits and altered plaintext bits will be extracted
from the received ciphertext. The received bit will be considered as either altered plaintext bit or
redundant bit based on the value of key. The keystream will be reconstructed using extracted
redundant bits and the key. Performing bitwise addition on regenerated keystream and altered
plaintext data, the original plaintext will be recovered. Eventually, the redundant data is
regenerated by calculating MAC of the recovered plaintext and if it is different from received
redundant data, the message will be discarded. The block diagram of the hardware
implementation is presented in Figure 10.
Figure 10. Decryption Part
13. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
25
5.4 Overall system
Figure 11 demonstrates the encryption and decryption parts together. Since the system is half-
duplex; encryption and decryption do not happen at the same time; the En/De signal determines
which process must be activated.
Figure 11. Cipher plus transmitter and receiver
#Encryption Algorithm
counter = 0
for i in range (n + m)
{
if (key[i] = 0)
{
shift right plaintext register
send LSB(plaintext) to Enc module
}
else
{
shift right redundant register
send LSB(redundant) to Enc module
}
shift right key register
}
#Decryption Algorithm
counter = 0
for i in range (n + m)
{
if (key[i] = 0)
{
Send data to MSB(plaintext)
shift right plaintext register
}
else
{
send data to MSB(redundant)
shift right redundant register
}
shift right key register
}
m: plaintext data length n: redundant data length
Figure 12. Encryption and Decryption algorithms
14. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
26
The encryption and decryption algorithms are shown in Figure 12. These algorithms are
composed of successive steps of shifting and selection operations which allows encryption and
decryption processes to be performed during sending and receiving data which makes the RBS
implementation very efficient in terms of timing and power consumption. The only considerable
overhead part is MAC function’s implementation which is used for authentication, generation of
redundant bits and keystream. The overhead details will be discussed in the next section.
6. EXPERIMENTAL RESULTS
The different components of RBS implementation are synthesized by Synopsys Design Compiler
in 90nm technology mode and the clock frequency is set to 10 MHz. The operating conditions are
set to typical, the supply voltage is fixed at 1V, and the temperature is set to 25°C. Table 2
summarizes the reported area and power figures.
Table 2. Area and power reports of modules
Area (GE) Total Power (μW)
MAC Generation 1051 30.2
Enc/Dec Cipher 10 0.26
Total 1061 30.46
The RBS algorithm is compared with five other encryption algorithms in i) required key and
initial vector size, ii) data block size, iii) the required number of clock cycles for completing the
encryption process, iv) 2-input NAND GE equivalent area, v) and total power consumption for
clk=10MHz. Table 3 summarizes the comparison results. All other compared methods’ reports
are for 130nm technology whereas RBS is synthesized in newer 90nm technology which has
considerable effect on area and power. However, area reports are given in GE (Gate equivalent)
which is independent of used technology. Considering the effect of technology scaling (α) on
power consumption, static power and dynamic power will be decreased by α2
. Therefore, it can be
estimated that the power report in RBS must be doubled in order to be comparable with other
compared designs in 130nm which is still lower than other designs’ power consumption.
RBS like Trivium, Grain, and HB-2 ciphers have used initial vectors (IV) for refreshing key
which imposes extra clock cycles for initializing cipher process during the algorithm startup or
whenever the key changes. These initial clock cycles are distinguished in parenthesis in Table 3.
Regarding the message authentication service, this service is optional for Grain and HB-2
algorithms while AES, PRESENT, and Trivium do not provide authentication service. In other
words, they must be integrated with other algorithms to provide this service. The timing, area and
power consumption reports in Table 3 for AES, PRESENT, Trivium, Grain, and HB-2 algorithms
are calculated without considering implementation overhead of authentication part.
RBS algorithm provides authentication service as mentioned before. Besides, the timing, area,
and power reports for RBS algorithm listed in Table 3 include the MAC generator part’s
area/power overheads which are still better than other compared designs.
15. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
27
Table 3. Comparing RBS with other encryption methods
Mode
Key/IV
(bits)
Block
Size(bits)
Clock
Cycles
Area
(GE)
Total
Power (μW)
Freq.
(MHz)
Tech.
AES[14] En 128/- 128 160 3200 300 10 130nm
PRESENT[15] En 128/- 64 32 1884 7.34 0.1 180nm
Grain[16] En/De 128/(128) 1 (512)* + 1 1857 167.73 10 130nm
Trivium[17] En/De 80/(80) 1 (1333)*+ 1 2599 181.18 10 130nm
HB-2[18] En 128/64 16 (80)* + 16 2332 156.8 10 130nm
RBS
En/De/
Authent
132/- 64
(68)* +
136
1061 30.46 10 90nm
* Cycles required for initialization
Concerning the clock cycles, encryption/decryption in RBS algorithm is performed along with
data send/receive and the performance of RBS is only limited by the time required for generating
MAC output which is 65 clock cycles for generating redundant bits, and 68 clock cycles for
generating keystream. Another one clock cycle is also required for bitwise addition of keystream
with plaintext and 2 cycles for generating authentication keys. Altogether, 136 clock cycles is the
timing overhead for encryption/decryption plus authentication. Similar to area and power
overheads, RBS timing overhead is still comparable with other algorithms while their reported
timing overhead just considers encryption/decryption process.
7. CONCLUSION
A new lightweight symmetric authenticated cipher for RFID systems is proposed in this paper.
This cipher is based on inserting redundant bits among altered plaintext bits. Besides
confidentiality, redundant bits provide authentication and integrity services as well. The
implemented RBS algorithm requires less power and area compared to other known symmetric
algorithms proposed for RFID systems. In addition to the location of bits, changing their order in
the ciphertext provides more security which is a part of our future work.
REFERENCES
[1] S.E. Sarma, S.A. Weis, D.W. Engels, “RFID systems and security and privacy implications” in Proc.
Workshop on Cryptographic Hardware and Embedded Systems (CHES), August 2002, pp. 454-470.
[2] H. Sitlia, H. Hamam, S.A. Selouani, “Technical Solutions for Privacy Protection in RFID”, European
Journal of Scientific Research, Volume 38, Number 3, 2009, pp.500-508.
[3] H. Eberle, N. Gura, S.C. Shantz, V. Gupta, L. Rarick, S. Sundaram, “A Public-key Cryptographic
Processor for RSA and ECC”, Application-Specific Systems, Architectures and Processors, 2004.
Page(s): 98 – 110.
[4] M. I. Faisal, Z. Jeddi, E. Amini and M. Bayoumi, “An Architecture for Variable Dimensional Finite
Field GF(2m) Arithmetic Operations for Elliptic Curve Cryptography”, Journal of Low Power
Electronics, Volume 7, Number 3, August 2011 , pp. 314-327.
[5] E. Amini, Z. Jeddi, A. Khattb and M. Bayoumi, “A Low-Power Parallel Architecture for Finite Galois
Field GF(2m) Arithmetic Operations for Elliptic Curve Cryptography”, Journal of Low Power
Electronics, Volume 8, Number 4, August 2012 , pp. 440-451.
[6] P. Luo; X. Wang; J. Feng; Y. Xu ,“Low-power hardware implementation of ECC processor suitable
for low-cost RFID tags”, Solid-State and Integrated-Circuit Technology, ICSICT 2008.
16. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
28
[7] Y. K. Lee, K. Sakiyama, L. Batina, I. Verbauwhede, “Elliptic-Curve-Based Security Processor for
RFID“, IEEE Transactions on Computers, Volume: 57, Issue: 11, 2008 , Page(s): 1514 - 1527 .
[8] E. S. Kumar and C. Paar, “Are standards compliant Elliptic Curve Cryptosystems feasible on RFID”,
In Proceedings of Workshop on RFID Security, page 19, Graz, Austria, July 2006.
[9] L. Batina, N. Mentens, K. Sakiyama, B. Preneel, and I. Verbauwhede, “Public-Key Cryptography on
the Top of a Needle”, In Proceedings of the IEEE International Symposium on Circuits and Systems,
ISCAS 2007, pp. 1831-1834, May 2007.
[10] G. Gaubatz, J.P. Kaps, E. Ozturk, B. Sunar, “State of the Art in Ultra-Low Power Public Key
Cryptography for Wireless Sensor Networks”, PerCom Workshops 2005, pp. 146-150.
[11] E. Ozturk, B. Sunar, “Low-Power Elliptic Curve Cryptography Using Scaled Modular Arithmetic” In
Proceedings of the 6th International Workshop on Cryptographic Hardware in Embedded Systems
(CHES), volume 3156 of Lecture Notes in Computer Science, pp. 92-106. Springer-Verlag, Aug
2004.
[12] G. Gaubatz, J.P. Kaps, E. Ozturk, B. Sunar, “State of the Art in Ultra-Low Power Public Key
Cryptography for Wireless Sensor Networks”, In Proceedings of the 3rd IEEE international
conference on pervasive computing and communications workshops, PerCom 2005, Page(s): 146 –
150.
[13] S. Ray and G. P. Biswas, “Design of Mobile Public Key Infrastructure (M-PKI) Using Elliptic Curve
Cryptography”, International Journal on Cryptography and Information Security (IJCIS), Vol.3, No.1,
March 2013.
[14] P. Hamalainen, T. Alho, M. Hannikainen, T.D. Hamalainen, “Design and Implementation of Low-
Area and Low-Power AES Encryption Hardware Core”, 9th Euromicro Conference on Digital System
Design: Architectures, Methods and Tools, IEEE Computer Society, DSD 2006.
[15] C. Rolfes, A. Poschmann, G. Leander and C. Paar, “Ultra-lightweight implementations for smart
devices security for 1000 gate equivalents”, International Conference on Smart Card Research and
Advanced Applications, CARDIS 2008, pp. 89-103.
[16] M. Agren, M. Hell, T. Johansson, W. Meier, “A New Version of Grain-128 with authentication”,
Symmetric Key Encryption Workshop, SKEW 2011.
[17] C. De Canniere. “Trivium: A stream cipher construction inspired by block cipher design principles”,
Information Security Conference, pages 171–186, ISC 2006.
[18] D. Engels, M.J.O. Saarinen, P. Schweitzer E.M. Smith. “The Hummingbird-2 Lightweight
Authenticated Encryption Algorithm”, RFIDSec 2011.
[19] M.J.O. Saarinen, “Cryptanalysis of Hummingbird-1”, 18th International Workshop Fast Software
Encryption, FSE 2011, pp. 328-341.
[20] D. Hankerson, A. Menezes, S. Vanstone, “Guide to Elliptic curve cryptography”, book, springer-
verlag 2004.
[21] M. Agren, M. Hell, T. Johansson, “On Hardware-Oriented Message Authentication with Applications
towards RFID”, Lightweight Security & Privacy (LightSec), 2011.
[22] http://en.wikipedia.org/wiki/Brute-force_attack.
[23] L.H. Nguyen, A.W. Roscoe, “New combinatorial bounds for universal hash functions”, IACR
Cryptology ePrint Archive, 2009, p.153
17. International Journal on Cryptography and Information Security (IJCIS), Vol. 4, No. 1, March 2014
29
Authors
Zahra Jeddi received her BS degree in electrical engineering from Iran University of Science and
Technology and her MS degree in Computer Engineering from Amirkabir University of Technology. She
is currently a Ph. D. candidate at the Center for Advanced Computer Studies (CACS) at the University of
Louisiana at Lafayette. Her research interests include low power design, computer architecture and
security.
Esmaeil Amini received his BS degree from Sharif University of Technology and MS degree from
Amirkabir University of Technology both in Computer Engineering. He is a Ph. D. graduate at the Center
for Advanced Computer Studies (CACS) at the University of Louisiana at Lafayette. His research interests
include computer architecture, security and low power design.
Magdy Bayoumi received the B.Sc. and M.Sc. degrees in electrical engineering from Cairo University,
Egypt. He received the M.Sc. degree in computer engineering from Washington University, St. Louis, MO,
and the Ph.D. degree in electrical engineering from the University of Windsor, ON, Canada.
He is currently Director of the Center for Advanced Computer Studies (CACS) and Department Head of
the Computer Science Department, University of Louisiana, Lafayette. He is also the Edmiston Professor of
Computer Engineering and Lamson Professor of Computer Science at the Center for Advanced Computer
Studies, University of Louisiana at Lafayette, where he has been a faculty member since 1985. He is editor
or coeditor of three books in the area of VLSI Signal Processing. His research interests include VLSI
design methods and architectures, low-power circuits, and systems, digital signal processing architectures,
parallel algorithm design, computer arithmetic, image and video signal processing neural networks, and
wideband network architectures.