Recently, handful amount of S-boxes, using the various
methods such as affine transformations, gray coding,
optimization, chaotic systems, etc, have been suggested. It is
prudent to use cryptographically strong S-boxes for the design
of powerful ciphers. In this paper, we sampled some widely
used 8×8 S-boxes which are recently synthesized and security
analysis and evaluation is executed to uncover the best
candidate(s). The performance analysis is exercised against
the crucial measures like nonlinearity, linear approximation
probability, algebraic immunity, algebraic complexity,
differential uniformity. These parameters are custom selected
because their scores decide the security strength against
cryptographic assaults like linear cryptanalysis, algebraic
attacks, and differential cryptanalysis. The anticipated
analysis in this work facilitates the cryptographers, designers,
researchers to choose suitable candidate decided over many
parameters and can be engaged in modern block encryption
systems that solely rely on 8×8 S-box. Moreover, the analysis
assists in articulating efficient S-boxes and to evaluate the
attacks resistivity of their S-boxes.
Different Attacks on Selective Encryption in RSA based Singular Cubic Curve w...IDES Editor
In this paper, the security of Selective Encryptionin
RSA based Singular Cubic Curve with Automatic Variable Key
(AVK) for some well known attacks are analysed. It is proved
that this cryptosystem is more secure than Koyama scheme
from which the algorithm has been generated. The proposed
cryptographic algorithm makes justified use of Koyama
Schemes. Koyama scheme is not semantically secure. The
proposed Scheme is efficient and semantically secure public
key cryptosystem based on Singular Cubic Curve with AVK.
Further, the partially known attacks, linearly related plain text
attacks, isomorphism attacks, low exponent attacks, Wiener’s
attack and Hastad’s attack are analyzed for effect with the
proposed scheme. The Selective Encryption in RSA based
Singular Cubic Curve with AVK for text based documents is
found to be robust enough to encounter all these attacks.
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.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
a performance analysis of generalized key scheme block cipher (gksbc) algorit...INFOGAIN PUBLICATION
Information is a commodity. Information has economic value and production of it incurs cost. Securing the information is posing a considerable challenge. The cryptographic technology plays a leading role in securing the owners right on produced information. A continuous development of new encryption systems are necessitated with the advancement in security and efficiency needs. Cryptanalytic studies have demonstrated the superior capability of recently developed Generalized Key Scheme Block Cipher (GKSBC) algorithm in terms of stability, execution time and encryption quality compared to standard security algorithms. This paper proposes to evaluate the enduring capacity of GKSBC to various cryptanalytic attacks viz., Brute – Force Attack, Differential Cryptanalysis, Integral Cryptanalysis, Linear Cryptanalysis and Rectangle attack. None of the traditional attacks are designed to decrypt GKSBC encryption as the use of key scheme is different in it and therefore robust to the conventional cryptanalytic attacks.
RMAC – A LIGHTWEIGHT AUTHENTICATION PROTOCOL FOR HIGHLY CONSTRAINED IOT DEVICESijcisjournal
Nowadays, highly constrained IoT devices have earned an important place in our everyday lives. These devices mainly comprise RFID (Radio-Frequency Identification) or WSN (Wireless Sensor Networks) components. Their adoption is growing in areas where data security or privacy or both must be guaranteed. Therefore, it is necessary to develop appropriate security solutions for these systems. Many papers have proposed solutions for encryption or authentication. But it turns out that sometimes the proposal has security flaw or is ill-suited for the constrained IoT devices (which has very limited processing and storage capacities).In this paper, we introduce a new authentication protocol inspired by Mirror-Mac (MM) which is a generic construction of authentication protocol proposed by Mol et al. Our proposal named RMAC is well suited for highly constrained IoT devices since its implementation uses simple and lightweight algorithms. We also prove that RMAC is at least as secure as the MM protocol and thus secure against man-in-the-middle attacks.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
This document summarizes a novel tokenization scheme that offers excellent security without needing to synchronize vaults or risk collisions. It uses fully randomized tables in a distributed approach. The scheme can achieve a very high security level if the number of plaintexts encrypted with a single key is limited. It is proven to have security equal to an ideal tokenization scheme under realistic constraints. The document also provides biographical information about Prof. Dr. Ir. Bart Preneel, the author and expert in cryptography and information security.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
Different Attacks on Selective Encryption in RSA based Singular Cubic Curve w...IDES Editor
In this paper, the security of Selective Encryptionin
RSA based Singular Cubic Curve with Automatic Variable Key
(AVK) for some well known attacks are analysed. It is proved
that this cryptosystem is more secure than Koyama scheme
from which the algorithm has been generated. The proposed
cryptographic algorithm makes justified use of Koyama
Schemes. Koyama scheme is not semantically secure. The
proposed Scheme is efficient and semantically secure public
key cryptosystem based on Singular Cubic Curve with AVK.
Further, the partially known attacks, linearly related plain text
attacks, isomorphism attacks, low exponent attacks, Wiener’s
attack and Hastad’s attack are analyzed for effect with the
proposed scheme. The Selective Encryption in RSA based
Singular Cubic Curve with AVK for text based documents is
found to be robust enough to encounter all these attacks.
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.
A NOVEL SECURE COSINE SIMILARITY COMPUTATION SCHEME WITH MALICIOUS ADVERSARIESIJNSA Journal
Similarity coefficients play an important role in many aspects. Recently, several schemes were proposed, but these schemes aimed to compute the similarity coefficients of binary data. In this paper, a novel scheme
which can compute the coefficients of integer is proposed. To the best knowledge of us, this is the first scheme which canesist malicious adversaries attack.
a performance analysis of generalized key scheme block cipher (gksbc) algorit...INFOGAIN PUBLICATION
Information is a commodity. Information has economic value and production of it incurs cost. Securing the information is posing a considerable challenge. The cryptographic technology plays a leading role in securing the owners right on produced information. A continuous development of new encryption systems are necessitated with the advancement in security and efficiency needs. Cryptanalytic studies have demonstrated the superior capability of recently developed Generalized Key Scheme Block Cipher (GKSBC) algorithm in terms of stability, execution time and encryption quality compared to standard security algorithms. This paper proposes to evaluate the enduring capacity of GKSBC to various cryptanalytic attacks viz., Brute – Force Attack, Differential Cryptanalysis, Integral Cryptanalysis, Linear Cryptanalysis and Rectangle attack. None of the traditional attacks are designed to decrypt GKSBC encryption as the use of key scheme is different in it and therefore robust to the conventional cryptanalytic attacks.
RMAC – A LIGHTWEIGHT AUTHENTICATION PROTOCOL FOR HIGHLY CONSTRAINED IOT DEVICESijcisjournal
Nowadays, highly constrained IoT devices have earned an important place in our everyday lives. These devices mainly comprise RFID (Radio-Frequency Identification) or WSN (Wireless Sensor Networks) components. Their adoption is growing in areas where data security or privacy or both must be guaranteed. Therefore, it is necessary to develop appropriate security solutions for these systems. Many papers have proposed solutions for encryption or authentication. But it turns out that sometimes the proposal has security flaw or is ill-suited for the constrained IoT devices (which has very limited processing and storage capacities).In this paper, we introduce a new authentication protocol inspired by Mirror-Mac (MM) which is a generic construction of authentication protocol proposed by Mol et al. Our proposal named RMAC is well suited for highly constrained IoT devices since its implementation uses simple and lightweight algorithms. We also prove that RMAC is at least as secure as the MM protocol and thus secure against man-in-the-middle attacks.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
This document summarizes a novel tokenization scheme that offers excellent security without needing to synchronize vaults or risk collisions. It uses fully randomized tables in a distributed approach. The scheme can achieve a very high security level if the number of plaintexts encrypted with a single key is limited. It is proven to have security equal to an ideal tokenization scheme under realistic constraints. The document also provides biographical information about Prof. Dr. Ir. Bart Preneel, the author and expert in cryptography and information security.
The document proposes a novel secure scheme for computing the cosine similarity between two integer vectors with malicious adversaries. The scheme uses distributed ElGamal encryption and zero-knowledge proofs to privately compute the cosine coefficient between two parties' vector inputs while preserving privacy. Security analysis shows the scheme can resist attacks from malicious adversaries by simulating the ideal functionality using the encryption scheme and zero-knowledge proofs.
n-Tier Modelling of Robust Key management for Secure Data Aggregation in Wire...IJECEIAES
Security problems in Wireless Sensor Network (WSN) have been researched from more than a decade. There are various security approaches being evolving towards resisting various forms of attack using different methodologies. After reviewing the existing security approaches, it can be concluded that such security approaches are highly attack-specific and doesnt address various associated issues in WSN. It is essential for security approach to be computationally lightweight. Therefore, this paper presents a novel analytical modelling that is based on n-tier approach with a target to generate an optimized secret key that could ensure higher degree of security during the process of data aggregation in WSN. The study outcome shows that proposed system is computationally lightweight with good performance on reduced delay and reduced energy consumption. It also exhibits enhanced response time and good data delivery performance to balance the need of security and data forwarding performance in WSN.
IRJET- A Survey on Quantum Key Distribution and Huffman Coding Compression Al...IRJET Journal
This document discusses a proposed technique for more securely and efficiently transmitting data that uses quantum key distribution (QKD), one-time pad encryption, and Huffman encoding compression. QKD is used to randomly generate encryption keys that provide unconditional security. Huffman encoding compresses the data to reduce transmission overhead. The one-time pad technique encrypts the data with the randomly generated keys, ensuring secrecy over the classical channel. Experimental results show that encryption and decompression times increase with larger data sizes as expected. The proposed technique is concluded to provide better secrecy and efficiency than related methods by making decryption difficult without the proper keys.
Here is my B.Sc. thesis back in 2010. I should not consider this reading as up-to-date, but it's worth as basic start-up on the topic of Web Application Security. Please, note the two tables are meant as attachments to this paper. Your critics are welcome. Enjoy!
The thesis is presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
Here's the abstract:
The presented thesis in this paper is another discussion on the problem or problem-
complex: What is Web 2.0? How it works? Is it vulnerable to its security scope? How can
one utilize and share Web 2.0, knowing in this interactive collaboration, how to protect
himself?
In this bachelor work the reader will find history information, discussion on the evolu-
tion of the Web standards and most common Web 2.0 attacking classes. Two examples of
important Web 2.0 attacking vectors shall be discussed in depth, in such manner as an ana-
lysis and examples on the attacking techniques, deliberation on the trends in attack preven-
tion methods, discussion on the tools according to these.
This paper should give a good classification on the proposed examples of Web 2.0 at-
tacks, make a conclusion on behalf of the Life Cycle and security standards for the modern
Web 2.0 implementations, and perhaps offer some interesting proposals.
1) The document proposes a more secure implementation of the AES encryption algorithm by making the S-box structure nonlinear and dynamic.
2) A biometrics scheme is combined with the AES encryption and decryption to improve authentication security. Fingerprints are used in both encryption and decryption processes.
3) The implementation generates a random virtual S-box for each input by XORing the default AES S-box with a derived S-box, making the S-box structure nonlinear and dynamic. This improves security against attacks on the AES algorithm.
Automated Validation of Internet Security Protocols and Applications (AVISPA)...Krassen Deltchev
These are the slides to my first B.Sc. term paper- AVISPA, 2006.
These slides are presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...ijwmn
This document describes a new technique called GSMLPSA for secure group key exchange and encryption in wireless communication. It uses a multilayer perceptron neural network to generate a session key shared between parties. Plaintext is encrypted in multiple levels using a metamorphosed code table, comparison-based encryption, and a keystream generated by simulated annealing. The keystream is further encrypted using a finite state automaton before being XORed with the session key and sent. This allows secure key exchange among a group of parties with only logarithmic complexity. Experimental results show the technique provides comparable security to existing methods.
Secure Network Discovery for Risk-Aware Framework in ManetIOSR Journals
This document summarizes a research paper that proposes an adaptive risk-aware response mechanism for secure network discovery in mobile ad hoc networks (MANETs). The mechanism uses an extended Dempster-Shafer theory that introduces importance factors to combine multiple evidence sources, like intrusion detection alerts and routing table changes, and assess overall risk. It then employs adaptive decision making to dynamically isolate malicious nodes and recover routing tables. The proposed approach aims to address limitations of existing binary and naive fuzzy isolation techniques by enabling more flexible and weighted responses to routing attacks in MANETs.
Cryptography is the science of securing messages through encryption and decryption techniques to ensure confidentiality, integrity, and authentication. There are two main categories of cryptography - symmetric key cryptography where the same key is used by the sender and receiver, and asymmetric key cryptography where different public and private keys are used. Common techniques include substitution ciphers which replace letters with other letters or symbols, and transposition ciphers which rearrange the positions of letters in a message. The keys and algorithms used aim to protect data from unauthorized parties.
Detection of Various Attacks using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks.
Detection of Various Attacks Using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks
The document describes a thesis submitted by Amogh Mahapatra and Rajballav Dash for their Bachelor of Technology degree. It examines using the Hill cipher technique and self-repetitive matrices for data encryption and decryption. Specifically, it proposes an innovation to the conventional Hill cipher method using the concept of self-repetitive matrices. This approach is mathematically derived and implemented to simulate a communication channel with compression techniques. The method aims to address issues with inverting the Hill cipher's multiplicative matrix by using periodically repeating matrices.
A Robust Cryptographic System using Neighborhood-Generated KeysIJORCS
The document discusses various cryptographic techniques for encrypting data, including symmetric, asymmetric, stream ciphers, block ciphers, and hashing. Symmetric cryptography uses the same key for encryption and decryption, while asymmetric cryptography uses public and private key pairs. Common attacks on cryptographic systems are also outlined, such as known-plaintext attacks where an attacker has plaintext and ciphertext, chosen-plaintext attacks where an attacker can select plaintext to encrypt, and side-channel attacks which analyze power consumption or timing. The document provides background information on existing cryptographic techniques and attacks.
Automated Validation of Internet Security Protocols and Applications (AVISPA) Krassen Deltchev
This is my first B.Sc. term paper, 2006. Back in the days my English was bad, which is obvious, while reading the paper, but i still love it, cuz this was my academic starting point on the topic of IT-Security. Enjoy!
This B.Sc. term paper is presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
Abstract:
The AVISPA Model Checker is a tool for automated validation and verification of security
protocols. It provides a push-button web-based software- and hardware-independent interface and
installation binaries for UNIX-based Operating Systems.
It belongs to the group of the state-of-the-art Model Checkers and uses a modular and descriptive
formal language for specifying industrial-scale security protocols.
The different back-ends of the AVISPA tool implement new optimized analysing techniques for
automated protocol verification.
Therefore the researcher/scientist can prove even bigger in their specification protocols in a short
time and in a user-friendly way.
New cryptographic attacks are explored using the AVISPA tool and the Model-Checker covers
widest range of the modern authentication internet protocols, regarding their security validation.
SPACE-EFFICIENT VERIFIABLE SECRET SHARING USING POLYNOMIAL INTERPOLATIONNexgen Technology
The document presents a new approach for space-efficient verifiable secret sharing using polynomial interpolation. It introduces verification algorithms that provide arbitrary secret sharing schemes with cheater detection capabilities while being more space efficient than other schemes. One of the schemes introduced a new computational problem called the Exponentiating Polynomial Root Problem (EPRP) that is believed to be difficult. The verification algorithms are non-interactive, only require a one-time honest dealer, and use commitments to verify shares independently of the secret.
Secrecy and Performance Analysis of Symmetric Key Encryption AlgorithmsTharindu Weerasinghe
The document analyzes the secrecy and performance of symmetric key encryption algorithms including block ciphers (DES, TripleDES, AES), stream ciphers (RC2, RC4) and hybrid algorithms combining block and stream ciphers (TripleDES+RC4, AES+RC4). The analysis is conducted based on two measurement criteria (secrecy of ciphers and encryption time) under two circumstances (variable input plaintext size and variable input plaintext length representing passwords). Results are presented in a table showing average secrecy values for each algorithm over varying input data sizes. The tool created allows users to select an algorithm and see corresponding performance and secrecy results.
Performance Analysis of Application for Security Enhancements using Cryptanal...IRJET Journal
The document discusses performance analysis of applications for security enhancements using cryptanalysis. It begins with an introduction to cryptography and the Advanced Encryption Standard (AES). It then discusses using dynamic S-boxes generated by the RC4 algorithm to increase the security and complexity of AES. The proposed system uses a round structure and dynamic S-boxes to enhance AES security. Performance is evaluated based on randomness tests including strict avalanche criteria, differential approximation probability, and linear approximation probability. Results show encryption with the enhanced AES using dynamic S-boxes increases security and takes slightly longer than standard AES.
This document discusses the design and analysis of a new stream cipher for network security. It aims to improve upon existing stream ciphers which are vulnerable to algebraic and other attacks. The proposed design uses nonlinear S-boxes, linear feedback shift registers (LFSRs), and Boolean functions with high algebraic immunity to securely encrypt data transmitted over networks and wireless communications like GSM. Analysis shows the new stream cipher can securely send information over networks by resisting common attacks.
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
The document proposes three novel methods to prevent selective jamming attacks in wireless networks:
1. Strong Hiding Commitment Scheme (SHCS) which uses asymmetric cryptography to commit a sender to a value while keeping it hidden.
2. Cryptographic Puzzle Hiding Scheme which generates puzzles that force attackers to spend time solving before obtaining secret keys.
3. Hiding based on All-Or-Nothing Transformation which partitions messages into blocks that are meaningless individually, preventing selective jamming until all blocks are received.
Many internet of things (IoT) devices and integrated circuit (IC) cards have been compromised by side-channel attacks. Power-analysis attacks, which identify the secret key of a cryptographic circuit by analyzing the power traces, are among the most dangerous side-channel attacks. Generally, there is a trade-off between execution time and circuit area. However, the correlation between security and performance has yet to be determined. In this study, we investigate the cor-relation between side-channel attack resistance and performance
(execution time and circuit area) of advanced encryption
standard (AES) circuits. Eleven AES circuits with different performances are designed by high-level synthesis and logic synthesis. Of the eleven AES circuits, six are circuits with no side-channel attack
countermeasures and five are circuits with masking countermeasures. We employ four metrics based on a T-test to evaluate the side-channel attack resistance. The results based on the correlation coefficient show the correlation between side-channel attack resistance and performance. The correlation varies according to four metrics or masking countermeasure. We argue that designers should change their
attitudes towards circuit design when considering security.
This document provides a tutorial on linear and differential cryptanalysis. It summarizes the attacks and applies them to a simple substitution-permutation network cipher as an example. The tutorial explains how to construct linear expressions to exploit the nonlinear properties of the cipher's S-boxes. It also introduces the "piling-up principle", which shows that combining independent biased variables results in a cumulative bias according to a simple formula. The overall goal is to provide an intuitive explanation of these cryptanalysis techniques for novice cryptanalysts.
n-Tier Modelling of Robust Key management for Secure Data Aggregation in Wire...IJECEIAES
Security problems in Wireless Sensor Network (WSN) have been researched from more than a decade. There are various security approaches being evolving towards resisting various forms of attack using different methodologies. After reviewing the existing security approaches, it can be concluded that such security approaches are highly attack-specific and doesnt address various associated issues in WSN. It is essential for security approach to be computationally lightweight. Therefore, this paper presents a novel analytical modelling that is based on n-tier approach with a target to generate an optimized secret key that could ensure higher degree of security during the process of data aggregation in WSN. The study outcome shows that proposed system is computationally lightweight with good performance on reduced delay and reduced energy consumption. It also exhibits enhanced response time and good data delivery performance to balance the need of security and data forwarding performance in WSN.
IRJET- A Survey on Quantum Key Distribution and Huffman Coding Compression Al...IRJET Journal
This document discusses a proposed technique for more securely and efficiently transmitting data that uses quantum key distribution (QKD), one-time pad encryption, and Huffman encoding compression. QKD is used to randomly generate encryption keys that provide unconditional security. Huffman encoding compresses the data to reduce transmission overhead. The one-time pad technique encrypts the data with the randomly generated keys, ensuring secrecy over the classical channel. Experimental results show that encryption and decompression times increase with larger data sizes as expected. The proposed technique is concluded to provide better secrecy and efficiency than related methods by making decryption difficult without the proper keys.
Here is my B.Sc. thesis back in 2010. I should not consider this reading as up-to-date, but it's worth as basic start-up on the topic of Web Application Security. Please, note the two tables are meant as attachments to this paper. Your critics are welcome. Enjoy!
The thesis is presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
Here's the abstract:
The presented thesis in this paper is another discussion on the problem or problem-
complex: What is Web 2.0? How it works? Is it vulnerable to its security scope? How can
one utilize and share Web 2.0, knowing in this interactive collaboration, how to protect
himself?
In this bachelor work the reader will find history information, discussion on the evolu-
tion of the Web standards and most common Web 2.0 attacking classes. Two examples of
important Web 2.0 attacking vectors shall be discussed in depth, in such manner as an ana-
lysis and examples on the attacking techniques, deliberation on the trends in attack preven-
tion methods, discussion on the tools according to these.
This paper should give a good classification on the proposed examples of Web 2.0 at-
tacks, make a conclusion on behalf of the Life Cycle and security standards for the modern
Web 2.0 implementations, and perhaps offer some interesting proposals.
1) The document proposes a more secure implementation of the AES encryption algorithm by making the S-box structure nonlinear and dynamic.
2) A biometrics scheme is combined with the AES encryption and decryption to improve authentication security. Fingerprints are used in both encryption and decryption processes.
3) The implementation generates a random virtual S-box for each input by XORing the default AES S-box with a derived S-box, making the S-box structure nonlinear and dynamic. This improves security against attacks on the AES algorithm.
Automated Validation of Internet Security Protocols and Applications (AVISPA)...Krassen Deltchev
These are the slides to my first B.Sc. term paper- AVISPA, 2006.
These slides are presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
GROUP SESSION KEY EXCHANGE MULTILAYER PERCEPTRON BASED SIMULATED ANNEALING GU...ijwmn
This document describes a new technique called GSMLPSA for secure group key exchange and encryption in wireless communication. It uses a multilayer perceptron neural network to generate a session key shared between parties. Plaintext is encrypted in multiple levels using a metamorphosed code table, comparison-based encryption, and a keystream generated by simulated annealing. The keystream is further encrypted using a finite state automaton before being XORed with the session key and sent. This allows secure key exchange among a group of parties with only logarithmic complexity. Experimental results show the technique provides comparable security to existing methods.
Secure Network Discovery for Risk-Aware Framework in ManetIOSR Journals
This document summarizes a research paper that proposes an adaptive risk-aware response mechanism for secure network discovery in mobile ad hoc networks (MANETs). The mechanism uses an extended Dempster-Shafer theory that introduces importance factors to combine multiple evidence sources, like intrusion detection alerts and routing table changes, and assess overall risk. It then employs adaptive decision making to dynamically isolate malicious nodes and recover routing tables. The proposed approach aims to address limitations of existing binary and naive fuzzy isolation techniques by enabling more flexible and weighted responses to routing attacks in MANETs.
Cryptography is the science of securing messages through encryption and decryption techniques to ensure confidentiality, integrity, and authentication. There are two main categories of cryptography - symmetric key cryptography where the same key is used by the sender and receiver, and asymmetric key cryptography where different public and private keys are used. Common techniques include substitution ciphers which replace letters with other letters or symbols, and transposition ciphers which rearrange the positions of letters in a message. The keys and algorithms used aim to protect data from unauthorized parties.
Detection of Various Attacks using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks.
Detection of Various Attacks Using Zero Knowledge Protocol in Wireless Securityijceronline
The security mechanism are not used directly in wireless sensor networks compare to wired networks, there is no user control and insufficient energy resources. In wireless environment, proposing the scheme of detection of distributed sensor cloning attacks and Zero knowledge protocols (ZKP) are used to verifying authenticity of the sender sensor nodes. Cloning attack is concentrate on by attaching fingerprint which is unique that depends on the set of neighboring nodes and itself. Every message contains a finger print which sensor node sends.ZKP is used to avoid man in the middle attack and reply attacks from the important cryptographic information in wireless networks
The document describes a thesis submitted by Amogh Mahapatra and Rajballav Dash for their Bachelor of Technology degree. It examines using the Hill cipher technique and self-repetitive matrices for data encryption and decryption. Specifically, it proposes an innovation to the conventional Hill cipher method using the concept of self-repetitive matrices. This approach is mathematically derived and implemented to simulate a communication channel with compression techniques. The method aims to address issues with inverting the Hill cipher's multiplicative matrix by using periodically repeating matrices.
A Robust Cryptographic System using Neighborhood-Generated KeysIJORCS
The document discusses various cryptographic techniques for encrypting data, including symmetric, asymmetric, stream ciphers, block ciphers, and hashing. Symmetric cryptography uses the same key for encryption and decryption, while asymmetric cryptography uses public and private key pairs. Common attacks on cryptographic systems are also outlined, such as known-plaintext attacks where an attacker has plaintext and ciphertext, chosen-plaintext attacks where an attacker can select plaintext to encrypt, and side-channel attacks which analyze power consumption or timing. The document provides background information on existing cryptographic techniques and attacks.
Automated Validation of Internet Security Protocols and Applications (AVISPA) Krassen Deltchev
This is my first B.Sc. term paper, 2006. Back in the days my English was bad, which is obvious, while reading the paper, but i still love it, cuz this was my academic starting point on the topic of IT-Security. Enjoy!
This B.Sc. term paper is presented to the
Department of Electrical Engineering and Information Sciences
of the Ruhr-University of Bochum
Chair of Network and Data Security
of the Ruhr-University of Bochum,
Horst-Görtz Institute,
Prof. Jörg Schwenk
Abstract:
The AVISPA Model Checker is a tool for automated validation and verification of security
protocols. It provides a push-button web-based software- and hardware-independent interface and
installation binaries for UNIX-based Operating Systems.
It belongs to the group of the state-of-the-art Model Checkers and uses a modular and descriptive
formal language for specifying industrial-scale security protocols.
The different back-ends of the AVISPA tool implement new optimized analysing techniques for
automated protocol verification.
Therefore the researcher/scientist can prove even bigger in their specification protocols in a short
time and in a user-friendly way.
New cryptographic attacks are explored using the AVISPA tool and the Model-Checker covers
widest range of the modern authentication internet protocols, regarding their security validation.
SPACE-EFFICIENT VERIFIABLE SECRET SHARING USING POLYNOMIAL INTERPOLATIONNexgen Technology
The document presents a new approach for space-efficient verifiable secret sharing using polynomial interpolation. It introduces verification algorithms that provide arbitrary secret sharing schemes with cheater detection capabilities while being more space efficient than other schemes. One of the schemes introduced a new computational problem called the Exponentiating Polynomial Root Problem (EPRP) that is believed to be difficult. The verification algorithms are non-interactive, only require a one-time honest dealer, and use commitments to verify shares independently of the secret.
Secrecy and Performance Analysis of Symmetric Key Encryption AlgorithmsTharindu Weerasinghe
The document analyzes the secrecy and performance of symmetric key encryption algorithms including block ciphers (DES, TripleDES, AES), stream ciphers (RC2, RC4) and hybrid algorithms combining block and stream ciphers (TripleDES+RC4, AES+RC4). The analysis is conducted based on two measurement criteria (secrecy of ciphers and encryption time) under two circumstances (variable input plaintext size and variable input plaintext length representing passwords). Results are presented in a table showing average secrecy values for each algorithm over varying input data sizes. The tool created allows users to select an algorithm and see corresponding performance and secrecy results.
Performance Analysis of Application for Security Enhancements using Cryptanal...IRJET Journal
The document discusses performance analysis of applications for security enhancements using cryptanalysis. It begins with an introduction to cryptography and the Advanced Encryption Standard (AES). It then discusses using dynamic S-boxes generated by the RC4 algorithm to increase the security and complexity of AES. The proposed system uses a round structure and dynamic S-boxes to enhance AES security. Performance is evaluated based on randomness tests including strict avalanche criteria, differential approximation probability, and linear approximation probability. Results show encryption with the enhanced AES using dynamic S-boxes increases security and takes slightly longer than standard AES.
This document discusses the design and analysis of a new stream cipher for network security. It aims to improve upon existing stream ciphers which are vulnerable to algebraic and other attacks. The proposed design uses nonlinear S-boxes, linear feedback shift registers (LFSRs), and Boolean functions with high algebraic immunity to securely encrypt data transmitted over networks and wireless communications like GSM. Analysis shows the new stream cipher can securely send information over networks by resisting common attacks.
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
The document proposes three novel methods to prevent selective jamming attacks in wireless networks:
1. Strong Hiding Commitment Scheme (SHCS) which uses asymmetric cryptography to commit a sender to a value while keeping it hidden.
2. Cryptographic Puzzle Hiding Scheme which generates puzzles that force attackers to spend time solving before obtaining secret keys.
3. Hiding based on All-Or-Nothing Transformation which partitions messages into blocks that are meaningless individually, preventing selective jamming until all blocks are received.
Many internet of things (IoT) devices and integrated circuit (IC) cards have been compromised by side-channel attacks. Power-analysis attacks, which identify the secret key of a cryptographic circuit by analyzing the power traces, are among the most dangerous side-channel attacks. Generally, there is a trade-off between execution time and circuit area. However, the correlation between security and performance has yet to be determined. In this study, we investigate the cor-relation between side-channel attack resistance and performance
(execution time and circuit area) of advanced encryption
standard (AES) circuits. Eleven AES circuits with different performances are designed by high-level synthesis and logic synthesis. Of the eleven AES circuits, six are circuits with no side-channel attack
countermeasures and five are circuits with masking countermeasures. We employ four metrics based on a T-test to evaluate the side-channel attack resistance. The results based on the correlation coefficient show the correlation between side-channel attack resistance and performance. The correlation varies according to four metrics or masking countermeasure. We argue that designers should change their
attitudes towards circuit design when considering security.
This document provides a tutorial on linear and differential cryptanalysis. It summarizes the attacks and applies them to a simple substitution-permutation network cipher as an example. The tutorial explains how to construct linear expressions to exploit the nonlinear properties of the cipher's S-boxes. It also introduces the "piling-up principle", which shows that combining independent biased variables results in a cumulative bias according to a simple formula. The overall goal is to provide an intuitive explanation of these cryptanalysis techniques for novice cryptanalysts.
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.
This document is the solutions manual for the textbook "Cryptography and Network Security, Fourth Edition" by William Stallings. It contains solutions to all review questions and homework problems from the textbook organized by chapter. The author, William Stallings, requests that any errors found in solutions or wording of problems be reported to help improve the accuracy of the manual.
MESSAGE EMBEDDED CIPHER USING 2-D CHAOTIC MAPijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values.
The methods are found to have good key sensitivity and possess identifiable keys thus concluding that they can resist linear attacks and brute-force attacks.
Message Embedded Cipher Using 2-D Chaotic Mapijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for
their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force
attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a
necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a
basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be
more suitable. This work is accompanied with analysis results obtained from these developed cipher.
Moreover, identifiable keys are searched for different input texts at various key values.
A SECURITY ANALYSIS OF IOT ENCRYPTION: SIDECHANNEL CUBE ATTACK ON SIMECK32/64 IJCNCJournal
This document describes a security analysis of the Simeck32/64 block cipher against side-channel cube attacks. The analysis uses a Hamming weight leakage model to extract linearly independent equations involving key bits. It is able to obtain 32 linearly independent equations in 32 key variables by considering the second bit from the least significant bit of the Hamming weight leakage of the internal state after the fourth encryption round. This improves previous attacks on Simeck32/64 in the side-channel attack model, reducing the time complexity from 248 to 235 computations.
comparisonofcost of protectionof selected ciphers.pdfARPriyarenjini
This document discusses a study that evaluated the effectiveness of threshold implementations (TI) as a countermeasure against differential power analysis (DPA) attacks for several authenticated ciphers. The researchers implemented TI countermeasures for ACORN, Ascon, CLOC, SILC, JAMBU, Ketje Jr., and AES-GCM and evaluated their resistance to DPA attacks using a methodology called test vector leakage assessment (TVLA). They found that the countermeasures protected the implementations against first-order DPA attacks. The researchers then compared the protected implementations in terms of hardware resources, performance, throughput, power, and energy efficiency to determine the relative costs and advantages of protection for each cipher.
A dynamic S-box generation based on a hybrid method of new chaotic system and...TELKOMNIKA JOURNAL
S-box is one of the most significant structures used to construct encryption that is strong and resistant to attacks in encryption algorithms. The new 4D-hyper chaotic system and deoxyribonucleic acid (DNA) computing are used in this paper to provide a new dynamic S-box generating approach. The 4D generated numbers are processed to generate a hexadecimal number that will encode using the DNA coding method and using addition, subtraction, and exclusive-or operations to produce the final DNA string decoded to make the S-Box. The dynamic form of s-boxes is represented by a minor change in the initial conditions of the proposed chaotic method that will generate dynamic sequences of numbers. The proposed method enhances the security criteria of the block ciphers. The S-box testing criteria were done like strict avalanche, balanced, and bit independence criteria, in addition to differential approximation probability and linearity approximation probability, to test the security of the new S-Box. The results show that the new S-box has good security and is resistant to attacks.
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A METHOD OF TRUST MANAGEMENT IN WIRELESS SENSOR NETWORKSijsptm
The research problem considered in this paper is how to protect wireless sensor networks (WSN) against cyber-threats by applying trust management and how to strengthen network resilience to attacks targeting the trust management mechanism itself. A new method, called WSN Cooperative Trust Management Method (WCT2M), of distributed trust management in multi-layer wireless sensor networks is proposed and its performance is evaluated. The method is specified by giving its class model in UML and by
explaining the related attributes and methods. Different attacks against the network and against WCT2M deployed in the network are considered. The experimental evaluation of WCT2M involves laboratory experiments and simulations using a dedicated simulator. The evaluation focuses on efficiency of detecting and isolating the malicious nodes that implement different attack scenarios in the network and on the
method’s sensitivity to the changes in effectiveness of the security mechanisms deployed in the network nodes.
Color Cryptography using Substitution Methodijtsrd
In world of computer network, fears come in many different forms. Some of the most common fears today are software attacks. If we want to secure any type of data then we can use encryption method. All traditional encryption methods use substitution and switch. Substitution methods map plain text into ciphertext in which characters, numbers and special symbols are substituted with other characters, numbers and special symbols. In this paper, we are using a creative cryptographic replacement method is to generate a stronger cipher than the existing replacement algorithms. This method focuses on the replacement of characters, numbers and special symbols with color blocks. This algorithm of substitution is based on Play Color Cipher. Yashvanth. L | Dr. N. Shanmugapriya "Color Cryptography using Substitution Method" Published in International Journal of Trend in Scientific Research and Development (ijtsrd), ISSN: 2456-6470, Volume-4 | Issue-1 , December 2019, URL: https://www.ijtsrd.com/papers/ijtsrd29360.pdfPaper URL: https://www.ijtsrd.com/engineering/computer-engineering/29360/color-cryptography-using-substitution-method/yashvanth-l
PERFORMANCE ANALYSIS OF SYMMETRIC KEY CIPHERS IN LINEAR AND GRID BASED SENSOR...cscpconf
The linear and grid based Wireless Sensor Networks (WSN) are formed by applications where
objects being monitored are either placed in linear or grid based form. E.g. monitoring oil,
water or gas pipelines; perimeter surveillance; monitoring traffic level of city streets, goods
warehouse monitoring. The security of data is a critical issue for all such applications and as
the devices used for the monitoring purpose have several resource constraints (bandwidth,
storage capacity, battery life); it is significant to have a lightweight security solution. Therefore,
we consider symmetric key based solutions proposed in the literature as asymmetric based
solutions require more computation, energy and storage of keys. We analyse the symmetric
ciphers with respect to the performance parameters: RAM, ROM consumption and number of
CPU cycles. We perform this simulation analysis in Contiki Cooja by considering an example
scenario on two different motes namely: Sky and Z1. The aim of this analysis is to come up with
the best suited symmetric key based cipher for the linear and grid based WSN.
A new hybrid text encryption approach over mobile ad hoc network IJECEIAES
This document summarizes a research paper that proposes a new hybrid text encryption approach combining elliptic curve cryptography and the Hill cipher algorithm for use on mobile ad hoc networks. The approach aims to address security weaknesses in the Hill cipher by converting it from a symmetric to an asymmetric technique. It generates public and private keys using elliptic curve cryptography so the secret key does not need to be shared over unsecured channels. The approach also allows direct encryption and decryption of characters from the full 128-character ASCII table using their numeric values, avoiding the need for a character mapping table. The advantages are seen as improved security, efficiency and faster computation compared to other techniques.
A Secure Encryption Technique based on Advanced Hill Cipher For a Public Key ...IOSR Journals
This document presents a secure encryption technique based on an advanced Hill cipher for a public key cryptosystem. The technique uses an involutory matrix and permuted key to encrypt plaintext into ciphertext. It further encrypts the ciphertext through two levels of scrambling and adds tamper detection by calculating and transmitting the determinant of the ciphertext matrix. The decryption process reverses these steps to recover the original plaintext. The technique aims to make the cipher highly secure against cryptanalytic attacks by introducing multiple transformations and ensuring the integrity of the ciphertext through determinant verification.
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
4.report (cryptography & computer network)JIEMS Akkalkuwa
This document discusses network security and cryptography. It begins by defining network security and explaining the key areas of secrecy, authentication, non-repudiation, and integrity control. It then discusses what cryptography is, explaining that it uses mathematics to encrypt and decrypt data to provide security. The document provides an overview of symmetric and asymmetric key encryption techniques as well as hash functions. It also discusses some existing network security systems and their use of symmetric encryption with periodic key distribution and refresh.
Similar to Security Strength Evaluation of Some Chaos Based Substitution-Boxes (20)
Performance of Wideband Mobile Channel with Perfect Synchronism BPSK vs QPSK ...Editor Jacotech
Direct-sequence code-division multiple access (DS-CDMA) is
currently the subject of much research as it is a promising
multiple access capability for third and fourth generations
mobile communication systems. The synchronous DS-CDMA
system is well known for eliminating the effects of multiple
access interference (MAI) which limits the capacity and
degrades the BER performance of the system. In this paper,
we investigate the bit error rate (BER) performance of a
synchronous DS-CDMA system over a wideband mobile
radio channel. The BER performance is affected by the
difference in path length ΔL and the number of arriving
signals N. Furthermore, the effect of these parameters is
examined on the synchronous DS-CDMA system for different
users’ number as well as different processing gain Gp. In this
environment and under the above conditions the performances
of the BPSK (Binary Phase Shift Keying) and the QPSK
(Quadrature Phase Shift Keying) modulations are compared.
The promising simulation results showed the possibility of
applying this system to the wideband mobile radio channel.
MOVIE RATING PREDICTION BASED ON TWITTER SENTIMENT ANALYSISEditor Jacotech
With microblogging platforms such as Twitter generating
huge amounts of textual data every day, the possibilities of
knowledge discovery through Twitter data becomes
increasingly relevant. Similar to the public voting mechanism
on websites such as the Internet Movie Database (IMDb) that
aggregates movies ratings, Twitter content contains
reflections of public opinion about movies. This study aims to
explore the use of Twitter content as textual data for
predicting the movie rating. In this study, we extract number
of tweets and compiled to predict the rating scores of newly
released movies. Predictions were done with the algorithms,
exploring the tweet polarity. In addition, this study explores
the use of several different kinds of tweet classification
Algorithm and movie rating algorithm. Results show that
movie rating developed by our application is compared to
IMDB and Rotten Tomatoes.
Non integer order controller based robust performance analysis of a conical t...Editor Jacotech
The design of robust controller for any non linear process is a
challenging task because of the presence of various types of
uncertainties. In this paper, various design methods of robust
PID controller for the level control of conical tank are
discussed. Uncertainties are of different types, among that
structured uncertainty of 30% is introduced to the nominal
plant for analysing the robustness. As a first step, the control
of level is done by using conventional integer order controller
for both nominal and uncertain system. Then, the control is
done by means of Fractional Order Proportional Integral
Derivative (FOPID) controller for achieving robustness. With
the help of time series parameters, a comparison is made
between conventional PID and FOPID with respect to the
simulated output using MATLAB and also analyzed the
robustness.
FACTORS CAUSING STRESS AMONG FEMALE DOCTORS (A COMPARATIVE STUDY BETWEEN SELE...Editor Jacotech
This document summarizes a research study that examined factors causing stress among female doctors working in public and private sector hospitals in India. The study aimed to identify whether there were associations between hospital sector (public or private) and 12 different stress measures among 300 female doctors. A survey was administered to collect data. Chi-square tests found statistically significant associations (p < 0.05) between hospital sector and 11 of the 12 stress measures, including stress due to workload, working conditions, physical exertion, emotional exhaustion, job security, organizational support, work-family conflict, family adjustment, task demands, patient expectations, and working hours. Only the association between sector and stress due to psychosomatic problems was not statistically significant. The results indicate
ANALYSIS AND DESIGN OF MULTIPLE WATERMARKING IN A VIDEO FOR AUTHENTICATION AN...Editor Jacotech
Watermarking technique be employ instance & for a second time for
validation and protection of digital data (images, video and audio
files, digital repositories and libraries, web publishing). It is helpful
to copyright protection and illegal copying of digital data like video
frames and making digital data more robust and imperceptible. With
the advent of internet, creation and delivery of digital data has grown
many fold. In that Scenario has to need a technique for transferring
digital data securely without changing their originality and
robustness. In this paper proposed a plan of latest watermarking
method which involves inserting and adding two or more digital data
or pictures in a single video frame for the principle of protection and
replicate the similar procedure for N no video frames for
authentication of entire digital video. After that digital video is
encrypted and decrypted by using motion vector bit-xor encryption
and decryption technique.
The Impact of Line Resistance on the Performance of Controllable Series Compe...Editor Jacotech
In recent years controllable FACTS devices are increasingly
integrated into the transmission system. FACTS devices that
provide series control such as Controllable Series Compensator
(CSC) has significant effect on the voltage stability of Electric
Power system. In this work impact of line resistance on the
performance of CSC in a single-load infinitive-bus (SLIB)
model is investigated. The proposed framework is applied to
SLIB model and obtained results demonstrates that line
resistance has considerable effect on voltage stability limits and
performance of CSC.
Traffic Detection System is an Android application that aims at determining the behavior of traffic in a particular location. It calculates the speed of the vehicle and the level of congestion or the amount of traffic is determined on the basis of the values of sensors. If any such obstruct found, then the driver is provided an option to send messages regarding high traffic to his/her friends. After a distinct number of repeated low speed and breaks, the location of the vehicle (latitude and longitude) send to a pre-specified contact (selected in case of traffic congestion) through an SMS. This application uses the features of the Global positioning system. The Latitude, as well as the longitude of the location where traffic jams are formed, is sent to the friends of the user. The Goggle map of the location also sends to the friends. It uses the SMS Manager a functionality of Android. The friends receiving the messages will thereby avoid taking the congested route and hence the level of traffic on the congested road will decrease, and the friends will reach the destination in comparatively less time.
Performance analysis of aodv with the constraints of varying terrain area and...Editor Jacotech
Mobile Ad Hoc Networks (MANETs) are wireless networks,
where there is no requirement for any infrastructure support to
transfer data packets between mobile nodes. These nodes
communicate in a multi-hop mode; each mobile node acts
both as a host and router. The main job of Quality of Service
(QoS)[1][2] routing in MANETs is to search and establish
routes among different mobile nodes for satisfying QoS
requirements of wireless sensor networks as PDR, Average
end-to-end delay, Average Throughput. The QoS routing
protocols efficient for commercial, real-time and multimedia
applications are in demand for day to day activities[2].
Modeling of solar array and analyze the current transient response of shunt s...Editor Jacotech
Spacecraft bus voltage is regulated by power
conditioning unit using switching shunt voltage regulator having
solar array cells as the primary source of power. This source
switches between the bus loads and the shunt switch for fine
control of spacecraft bus voltage. The effect of solar array cell
capacitance [5][6] along with inductance and resistance of the
interface wires between solar cells and power conditioning
unit[1], generates damped sinusoidal currents superimposed on
the short circuit current of solar cell when shunted through
switch. The peak current stress on the shunt switch is to be
considered in the selection of shunt switch in power conditioning
unit. The analysis of current transients of shunt switch in PCU
considering actual spacecraft interface wire length by
illumination of solar panel (combination of series and parallel
solar cells) is difficult with hardware simulation. Software
simulation by modeling solar cell is carried out for a single string
(one parallel) in Pspice [6]. Since in spacecrafts number of
parallels and interface cable length are variable parameters the
analysis of current transients of shunt switch is carried out by
modeling solar array with the help of solar cell model[6] for the
actual spacecraft condition.
License plate recognition an insight to the proposed approach for plate local...Editor Jacotech
License Plate Recognition (LPR) system for vehicles is an innovative and a very challenging area for research due to the innumerous plate formats and the nonuniform outdoor illumination conditions during which images are acquired. Thus, most approaches developed, work under certain restrictions such as fixed illumination, stationary background and limited speed. Algorithms developed for LPR systems are generally composed of three significant stages: 1] localization of the license plate from an entire scene image; 2] segmentation of the characters on the plate; 3] recognition of each of the segmented characters. A simple approach for preprocessing of the images, localization and extraction phase has been described in this paper. Numerous procedures have been developed for LPR systems and are assessed in this paper taking into consideration issues like processing time, computational power and recognition rate wherever available.
Design of airfoil using backpropagation training with mixed approachEditor Jacotech
Levenberg-Marquardt back-propagation training method has some limitations associated with over fitting and local optimum problems. Here, we proposed a new algorithm to increase the convergence speed of Backpropagation learning to design the airfoil. The aerodynamic force coefficients corresponding to series of airfoil are stored in a database along with the airfoil coordinates. A feedforward neural network is created with aerodynamic coefficient as input to produce the airfoil coordinates as output. In the proposed algorithm, for output layer, we used the cost function having linear & nonlinear error terms then for the hidden layer, we used steepest descent cost function. Results indicate that this mixed approach greatly enhances the training of artificial neural network and may accurately predict airfoil profile.
Ant colony optimization based routing algorithm in various wireless sensor ne...Editor Jacotech
Wireless Sensor Network has several issues and challenges due to limited battery backup, limited computation capability, and limited computation capability. These issues and challenges must be taken care while designing the algorithms to increase the Network lifetime of WSN. Routing, the act of moving information across an internet world from a source to a destination is one of the vital issue associated with Wireless Sensor Network. The Ant Colony Optimization (ACO) algorithm is a probabilistic technique for solving computational problems that can be used to find optimal paths through graphs. The short route will be increasingly enhanced therefore become more attractive. The foraging behavior and optimal route finding capability of ants can be the inspiration for ACO based algorithm in WSN. The nature of ants is to wander randomly in search of food from their nest. While moving, ants lay down a pheromone trail on the ground. This chemical pheromone has the ability to evaporate with the time. Ants have the ability to smell pheromone. When selecting their path, they tend to select, probably the paths that has strong pheromone concentrations. As soon as an ant finds a food source, carries some of it back to the nest. While returning, the quantity of chemical pheromone that an ant lay down on the ground may depend on the quantity and quality of the food. The pheromone trails will lead other ants towards the food source. The path which has the strongest pheromone concentration is followed by the ant which is the shortest paths between their nest and food source. This paper surveys the ACO based routing in various Networking domains like Wireless Sensor Networks and Mobile Ad Hoc Networks.
An efficient ant optimized multipath routing in wireless sensor networkEditor Jacotech
Today, the Wireless Sensor Network is increasingly gaining popularity and importance. It is the more interesting and stimulating area of research. Now, the WSN is applied in object tracking and environmental monitoring applications. This paper presents the self-optimized model of multipath routing algorithm for WSN which considers definite parameters like delay, throughput level and loss and generates the outcomes that maximizes data throughput rate and minimizes delay and loss. This algorithm is based on ANT optimization technique that will bring out an optimal and organized route for WSN and is also to avoid congestion in WSN, the algorithm incorporate multipath capability..
A mobile monitoring and alert sms system with remote configuration – a case s...Editor Jacotech
One of the parent´s main concerns nowadays it to know their children´s whereabouts. Some applications exist to address this issue and most of them rely on internet connection which makes the solution expensive. In this paper we present a low cost solution, based on SMS, and with the ability to remotely configure the child monitoring process. We also present the architecture and the full flowchart of the child application whenever a SMS is received. This case study uses Android and the more recent location API – the Fused Location Provider. For obvious reasons, the security issue has been a concern, which resulted in a configuration module in the child application to specify authorized senders
Leader Election Approach: A Comparison and SurveyEditor Jacotech
In distributed system, the coordinator is needed to manage the use of the resources in the shared environment. Many algorithms have been proposed for the same. They have various positive and negative parts. Here we will discuss those issues which ensure the efficiency of the algorithm for election leader. Here a comparison will be provided to show the advantages and disadvantages of different election algorithms. The comparison would be based on the number of messages passing and the order of time complexity.
Leader election approach a comparison and surveyEditor Jacotech
This document summarizes and compares several leader election algorithms in distributed systems. It discusses the Bully algorithm and some modifications, including using two successors, dividing nodes into sets, and using max-heap and Fibonacci heap data structures. The algorithms are compared based on time complexity, number of messages required, and memory usage. The Fibonacci heap approach is identified as the most efficient with O(log n) time complexity and minimum message passing of log(n).
Modeling of solar array and analyze the current transientEditor Jacotech
Spacecraft bus voltage is regulated by power
conditioning unit using switching shunt voltage regulator having
solar array cells as the primary source of power. This source
switches between the bus loads and the shunt switch for fine
control of spacecraft bus voltage. The effect of solar array cell
capacitance [5][6] along with inductance and resistance of the
interface wires between solar cells and power conditioning
unit[1], generates damped sinusoidal currents superimposed on
the short circuit current of solar cell when shunted through
switch. The peak current stress on the shunt switch is to be
considered in the selection of shunt switch in power conditioning
unit. The analysis of current transients of shunt switch in PCU
considering actual spacecraft interface wire length by
illumination of solar panel (combination of series and parallel
solar cells) is difficult with hardware simulation. Software
simulation by modeling solar cell is carried out for a single string
(one parallel) in Pspice [6]. Since in spacecrafts number of
parallels and interface cable length are variable parameters the
analysis of current transients of shunt switch is carried out by
modeling solar array with the help of solar cell model[6] for the
actual spacecraft condition.
Traffic Detection System is an Android application that aims at determining the behavior of traffic in a particular location. It calculates the speed of the vehicle and the level of congestion or the amount of traffic is determined on the basis of the values of sensors. If any such obstruct found, then the driver is provided an option to send messages regarding high traffic to his/her friends. After a distinct number of repeated low speed and breaks, the location of the vehicle (latitude and longitude) send to a pre-specified contact (selected in case of traffic congestion) through an SMS. This application uses the features of the Global positioning system. The Latitude, as well as the longitude of the location where traffic jams are formed, is sent to the friends of the user. The Goggle map of the location also sends to the friends. It uses the SMS Manager a functionality of Android. The friends receiving the messages will thereby avoid taking the congested route and hence the level of traffic on the congested road will decrease, and the friends will reach the destination in comparatively less time.
Performance analysis of aodv with the constraints ofEditor Jacotech
This document summarizes a research paper that analyzed the performance of the AODV routing protocol in wireless sensor networks under different terrain area sizes and pause times using the NS-3 simulator. The researchers found that packet delivery ratio remained nearly constant for small terrain areas but decreased for larger areas. Average throughput decreased with larger terrain areas, while average delay remained nearly constant for small areas but increased for larger ones. The paper concludes that AODV has better performance in networks with high mobility and size and is preferred for real-time traffic over other protocols like DSR and DSDV.
License plate recognition an insight to the proposed approach for plate local...Editor Jacotech
This document summarizes a journal article that proposes an approach for license plate localization and binarization in license plate recognition systems. The article describes the typical three-stage process of license plate recognition including localization, character segmentation, and character recognition. It then discusses challenges with existing localization approaches for Indian license plates due to variations in formats. The proposed approach exploits features like aspect ratio, texture, and color similarity to localize and extract license plates from images as a preprocessing step before character segmentation and recognition.
KuberTENes Birthday Bash Guadalajara - K8sGPT first impressionsVictor Morales
K8sGPT is a tool that analyzes and diagnoses Kubernetes clusters. This presentation was used to share the requirements and dependencies to deploy K8sGPT in a local environment.
DEEP LEARNING FOR SMART GRID INTRUSION DETECTION: A HYBRID CNN-LSTM-BASED MODELgerogepatton
As digital technology becomes more deeply embedded in power systems, protecting the communication
networks of Smart Grids (SG) has emerged as a critical concern. Distributed Network Protocol 3 (DNP3)
represents a multi-tiered application layer protocol extensively utilized in Supervisory Control and Data
Acquisition (SCADA)-based smart grids to facilitate real-time data gathering and control functionalities.
Robust Intrusion Detection Systems (IDS) are necessary for early threat detection and mitigation because
of the interconnection of these networks, which makes them vulnerable to a variety of cyberattacks. To
solve this issue, this paper develops a hybrid Deep Learning (DL) model specifically designed for intrusion
detection in smart grids. The proposed approach is a combination of the Convolutional Neural Network
(CNN) and the Long-Short-Term Memory algorithms (LSTM). We employed a recent intrusion detection
dataset (DNP3), which focuses on unauthorized commands and Denial of Service (DoS) cyberattacks, to
train and test our model. The results of our experiments show that our CNN-LSTM method is much better
at finding smart grid intrusions than other deep learning algorithms used for classification. In addition,
our proposed approach improves accuracy, precision, recall, and F1 score, achieving a high detection
accuracy rate of 99.50%.
A SYSTEMATIC RISK ASSESSMENT APPROACH FOR SECURING THE SMART IRRIGATION SYSTEMSIJNSA Journal
The smart irrigation system represents an innovative approach to optimize water usage in agricultural and landscaping practices. The integration of cutting-edge technologies, including sensors, actuators, and data analysis, empowers this system to provide accurate monitoring and control of irrigation processes by leveraging real-time environmental conditions. The main objective of a smart irrigation system is to optimize water efficiency, minimize expenses, and foster the adoption of sustainable water management methods. This paper conducts a systematic risk assessment by exploring the key components/assets and their functionalities in the smart irrigation system. The crucial role of sensors in gathering data on soil moisture, weather patterns, and plant well-being is emphasized in this system. These sensors enable intelligent decision-making in irrigation scheduling and water distribution, leading to enhanced water efficiency and sustainable water management practices. Actuators enable automated control of irrigation devices, ensuring precise and targeted water delivery to plants. Additionally, the paper addresses the potential threat and vulnerabilities associated with smart irrigation systems. It discusses limitations of the system, such as power constraints and computational capabilities, and calculates the potential security risks. The paper suggests possible risk treatment methods for effective secure system operation. In conclusion, the paper emphasizes the significant benefits of implementing smart irrigation systems, including improved water conservation, increased crop yield, and reduced environmental impact. Additionally, based on the security analysis conducted, the paper recommends the implementation of countermeasures and security approaches to address vulnerabilities and ensure the integrity and reliability of the system. By incorporating these measures, smart irrigation technology can revolutionize water management practices in agriculture, promoting sustainability, resource efficiency, and safeguarding against potential security threats.
Advanced control scheme of doubly fed induction generator for wind turbine us...IJECEIAES
This paper describes a speed control device for generating electrical energy on an electricity network based on the doubly fed induction generator (DFIG) used for wind power conversion systems. At first, a double-fed induction generator model was constructed. A control law is formulated to govern the flow of energy between the stator of a DFIG and the energy network using three types of controllers: proportional integral (PI), sliding mode controller (SMC) and second order sliding mode controller (SOSMC). Their different results in terms of power reference tracking, reaction to unexpected speed fluctuations, sensitivity to perturbations, and resilience against machine parameter alterations are compared. MATLAB/Simulink was used to conduct the simulations for the preceding study. Multiple simulations have shown very satisfying results, and the investigations demonstrate the efficacy and power-enhancing capabilities of the suggested control system.
Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapte...University of Maribor
Slides from talk presenting:
Aleš Zamuda: Presentation of IEEE Slovenia CIS (Computational Intelligence Society) Chapter and Networking.
Presentation at IcETRAN 2024 session:
"Inter-Society Networking Panel GRSS/MTT-S/CIS
Panel Session: Promoting Connection and Cooperation"
IEEE Slovenia GRSS
IEEE Serbia and Montenegro MTT-S
IEEE Slovenia CIS
11TH INTERNATIONAL CONFERENCE ON ELECTRICAL, ELECTRONIC AND COMPUTING ENGINEERING
3-6 June 2024, Niš, Serbia
Electric vehicle and photovoltaic advanced roles in enhancing the financial p...IJECEIAES
Climate change's impact on the planet forced the United Nations and governments to promote green energies and electric transportation. The deployments of photovoltaic (PV) and electric vehicle (EV) systems gained stronger momentum due to their numerous advantages over fossil fuel types. The advantages go beyond sustainability to reach financial support and stability. The work in this paper introduces the hybrid system between PV and EV to support industrial and commercial plants. This paper covers the theoretical framework of the proposed hybrid system including the required equation to complete the cost analysis when PV and EV are present. In addition, the proposed design diagram which sets the priorities and requirements of the system is presented. The proposed approach allows setup to advance their power stability, especially during power outages. The presented information supports researchers and plant owners to complete the necessary analysis while promoting the deployment of clean energy. The result of a case study that represents a dairy milk farmer supports the theoretical works and highlights its advanced benefits to existing plants. The short return on investment of the proposed approach supports the paper's novelty approach for the sustainable electrical system. In addition, the proposed system allows for an isolated power setup without the need for a transmission line which enhances the safety of the electrical network
Harnessing WebAssembly for Real-time Stateless Streaming PipelinesChristina Lin
Traditionally, dealing with real-time data pipelines has involved significant overhead, even for straightforward tasks like data transformation or masking. However, in this talk, we’ll venture into the dynamic realm of WebAssembly (WASM) and discover how it can revolutionize the creation of stateless streaming pipelines within a Kafka (Redpanda) broker. These pipelines are adept at managing low-latency, high-data-volume scenarios.
ACEP Magazine edition 4th launched on 05.06.2024Rahul
This document provides information about the third edition of the magazine "Sthapatya" published by the Association of Civil Engineers (Practicing) Aurangabad. It includes messages from current and past presidents of ACEP, memories and photos from past ACEP events, information on life time achievement awards given by ACEP, and a technical article on concrete maintenance, repairs and strengthening. The document highlights activities of ACEP and provides a technical educational article for members.
Security Strength Evaluation of Some Chaos Based Substitution-Boxes
1. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No. 5, Issue No. 2, April 2017
11
Security Strength Evaluation of Some Chaos Based
Substitution-Boxes
By
Hamed D. AlSharari
College of Engineering, Aljouf University,
Sakaka, Aljouf, Kingdom of Saudi Arabia,
hamed_100@hotmail.com
ABSTRACT
Recently, handful amount of S-boxes, using the various
methods such as affine transformations, gray coding,
optimization, chaotic systems, etc, have been suggested. It is
prudent to use cryptographically strong S-boxes for the design
of powerful ciphers. In this paper, we sampled some widely
used 8×8 S-boxes which are recently synthesized and security
analysis and evaluation is executed to uncover the best
candidate(s). The performance analysis is exercised against
the crucial measures like nonlinearity, linear approximation
probability, algebraic immunity, algebraic complexity,
differential uniformity. These parameters are custom selected
because their scores decide the security strength against
cryptographic assaults like linear cryptanalysis, algebraic
attacks, and differential cryptanalysis. The anticipated
analysis in this work facilitates the cryptographers, designers,
researchers to choose suitable candidate decided over many
parameters and can be engaged in modern block encryption
systems that solely rely on 8×8 S-box. Moreover, the analysis
assists in articulating efficient S-boxes and to evaluate the
attacks resistivity of their S-boxes.
General Terms
Security, Block Ciphers, Chaotic maps.
Keywords
Substitution-boxes, Nonlinearity, Linear cryptanalysis,
Differential cryptanalysis, Algebraic attacks, Algebraic
immunity.
1. INTRODUCTION
The protection of data during transmission through open
channels has always been an indispensable part of secure
communication and sharing. The data security issues are
attracting increasing attention of researchers, scholars,
academicians all over the world; this is due to the rapid and
vast advancement in network communication and e-business
innovation. The strength of data encryption systems binds
back to properties of confusion and diffusion coined and
explicated by Claude E. Shannon's in his seminal paper
published in 1976 [1]. The property of confusion is
fundamentally characterized as complicatedness of the liaison
between the encryption key and output ciphertext. The
diffusion is featured as the extent to which the impact of a bit
of plaintext is spread all through the subsequent ciphertext. In
developments of symmetric cryptosystems, the Shannon's
confusion and diffusion properties are actualized by
employing effective nonlinear transformations and mappings.
The Substitution-Permutation Network is the famous and
prominent architecture which are opted by most of the modern
block symmetric systems [2]. The S-P network involves
utilization of efficient substitution-boxes during substitution
operation in their rounds that improves the substantial level of
confusion and nonlinearity as an output of the cryptosystem.
Thus, ample research has been dedicated to enhancing the
quality and usage productivity of S-boxes in order to restrict
cryptanalysis assaults that endeavor imperfect designs.
A cryptographic substitution-box is one-to-one mapping that
nonlinearly transforms n-bit input data to m-bit output data. It
is also be thought as a multi-input and multi-output Boolean
function. Meaning that an 8×8 S-box consists of eight
functions where each Boolean function takes 8-bit data as
input and generates 1-bit as output, all eight functions
collectively yields 8-bit output data. As a result, the
performance features and characteristics meant for Boolean
functions can be easily considered and extended to quantify
the performance of the S-boxes. To date, most of the S-box
work carried out is dedicated to the design of 8×8 S-boxes
which is due to the success of AES block cipher and its S-box
introduced by NIST in 2001 [3, 4]. Almost all of them were
balanced and whose design primarily based on the concepts
such as affine transformations, gray coding, poor mapping,
optimization, chaotic systems, etc. Substitution-boxes are the
merely nonlinear component and have a central role to play to
decide the security strength of most modern block ciphers.
The cryptographic features of S-boxes are of immense
significance for the security of cipher systems. In particular,
the S-boxes are vulnerable to two kinds of attacks namely,
algebraic attack and side channel attack. In the former kind of
attacks, the algebraic structure of S-boxes are targeted; while
in the latter, the attackers use other measures such as its
power consumption, electromagnetic radiation, timing attacks,
etc, [5]. Two altogether different cryptanalyses to attack S-
boxes have been suggested by Biham et. al. and M. Matsui
known as: linear cryptanalysis and differential cryptanalysis
[6, 7]. They showed that the S-boxes having low nonlinear
nature and high input to output differential uniformity are
susceptible to these two kinds of attacks. Therefore, it is
prudent for S-boxes to have ample amount of resistivity
against these types of attacks in addition of good nonlinearity
to thwart linear attacks too. It has been observed in the recent
studies that some of these attacks are actually practical on
some weak S-boxes. The cryptographically good nature and
2. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No. 5, Issue No. 2, April 2017
12
strength of these S-boxes is of utmost grandness and need to
thwart various attacks.
In this paper, we sampled some widely used S-boxes which
are recently synthesized and security analysis and evaluation
is executed. The performance measures such as nonlinearity,
linear approximation probability, algebraic immunity,
algebraic complexity, differential uniformity, and
transparency order are quantified to carry out the analysis and
study. These measures are associated with linear attacks,
algebraic attacks, side-channel attacks, etc. The scores of
these measures give the resistivity of the S-box under study
against the attacks in some way or the other. The analysis
carried out in this paper will help the designers and the
researchers to choose suitable 8x8 S-box, which can be
employed in modern block encryption algorithms which rely
on the S-box. Apart from this, it will also help us in
understanding what particular change in the design parameter
of the S-boxes will leads to, which will help us in designing
new S-boxes. So, it’s very important to ensure that the design
of the S-box should be robust for a good encryption
algorithm. Hence, we analyze the strength and attack
resistivity of some popular and recent 8x8 S-boxes. The
analysis is focused on the quality of these S-boxes and to find
the appropriate candidate for the design of block encryption
systems.
The structure of the paper is prepared as follows: Section II
describes in brief the different attacks on S-boxes. The
security parameters selected for study are discussed in Section
III. The strength evaluation of some popular S-boxes is
explicated in Section IV. Section V draws the conclusion of
the study.
2. ASSAULTS on S-BOXES
A strong encryption system should have considerably high
resistivity to make different kind of cryptographic attacks
infeasible. Following are the four prominent attacks that are
applied by the cryptanalysts to break ciphers based
substitution-boxes.
2.1 Linear Attack
As a fact, the substitution-boxes are the main informant of
nonlinearity and thereby the confusion in a block ciphers. It is
critical to comprehend the extent to which they can be
proximated as linear equations [7]. With regards to linear
cryptanalysis, for every input variable Xi having n-dimension
of an S-box and for every output variable Yi of n-dimension
of S-box. These variables Xi and Yi are not particularly
independent from each other, because the likelihood of the
output relies on upon the input is always exists. The aim of
linear cryptanalysis is to discover the linear combination of Xi
which is exactly as linear combination of Yi that is fulfilled
by finite probability. For a perfect S-P network, such
connections will be fulfilled precisely 50% of the ideal
opportunity for any choice of Xi and Yi variables [5]. It
should estimate and find that there exists some determination
of linear combinations such that the chance of fulfilling the
relation is not 0.5, if so then this bias from the relationship can
be utilized in the attack.
2.2 Algebraic Attacks
The algebraic attacks consist of an intense class of attacks
which may undermine block ciphers. The goal is to set up an
arithmetic system of conditions and equations that are tested
by the key values with an aim to solve them [8]. The purpose
behind this is that it guarantees such scenario is of low degree,
which is a fundamental for having the capacity to solve them.
This raises the key issue of finding out if or not a given
function has non-insignificant low degree. The lowest degree
for which this happens is known as the algebraic immunity.
Hence, it is sufficient for processing the algebraic immunity to
probe regardless of whether an S-box has a measure of level
of resistance against the algebraic attack. The algebraic
complexity is regarded to gauge the susceptibility against such
arithmetical assaults.
2.3 Differential Attack
The Differential cryptanalysis is a chosen plaintext attacks
that endeavors to discover and misuse certain events of input
and output differences and deviations in ciphers that takes
place with high probabilities [10]. For a perfect block cipher
having an efficient S-box, the likelihood that a specific output
difference of ΔY = YiYj will happen with an input
difference of ΔX = XiXj is precisely 1/2n
, where n indicates
the bits in input X of S-box. The pair (ΔX, ΔY) is termed as a
differential. By evaluating the output difference that take
place with high probability, the relationship between the
plaintext and input can be set up. These relationships are
technically termed as differential trails [4]. The attacker can
figure the key by counting the quantity of times a specified
differential trail holds for a given key.
3. S-BOX PARAMETERS
In this section, the S-box parameters that are carefully
selected for security strength evaluation of different
substitution-boxes are discussed. The selection involves the
parameters of nonlinearity, linear approximation probability,
algebraic immunity, algebraic attack, transparency order, and
differential uniformity.
3.1 Nonlinearity
An 8×8 S-box consists of eight Boolean functions, each one
maps from Galois field GF(28
) to GF(2). The nonlinearity of
an S-box can be evaluated by finding the nonlinearity of all its
components functions. For a Boolean function f(x), it is
accounted as the minimum distance of it to all respective
affine functions. The set of affine functions for f(x) includes
all its functions which are linear and corresponding
complements of them. It is mandatory for cryptographically
potent S-boxes to have a high nonlinearity score as S-box
having poor nonlinearities tend to show weak resistance to
linear cryptanalysis and related approximation attacks. The
measure nonlinearity NLf for a function f(x) is determined as
[11]:
|))(|max21(2 1
wSNL f
nn
f
)2(
.)(
)1()(
n
GFw
wxxf
f wS
Where, S<f>(w) is the Walsh spectrum of f(x) and x.w denotes
the dot-product of x and w. To thwart the linear cryptanalysis,
all the Boolean functions of the employed S-box should
provide pretty large nonlinearity scores, or the S-box should
provide a high score of average nonlinearity.
3.2 LP
The linear probability (LP) is termed as the maximum value
of the deviation of an event. The parity of the input bits
selected by the mask Γx is equal to the parity of the output
bits selected by the mask Γy. A linear probability of
probability bias of an S-box is computed as [12]:
3. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No. 5, Issue No. 2, April 2017
13
nyyx
xxfxxXx
LAP
2
})(|{#
max
0,
Where, Γx and Γy are input and output masks, respectively; X
is the set of all possible inputs variables; and 2n
is the number
of its elements. The maximum linear approximation
probability corresponding to an S-box should be as low as
possible to not to leakage any information for the attacker that
makes the linear cryptanalysis easier and feasible.
3.3 Differential Uniformity
Differential cryptanalysis, originally introduced by Biham and
Shamir, is concerned with exploiting of imbalance on the
input/output distribution to attack S-boxes. The S-boxes
resistance to differential assaults can be done if the eXOR
value of an output has equal uniformity with the Exclusive-
OR value of the respective input [6]. If the substitution-box is
lying in input and output likelihood distribution, the S-box is
able to resist the differential cryptanalysis. A strong S-box
should hold as low as possible the largest value of differential
uniformity (DU). The differential uniformity for a component
Boolean function f(x) is quantified as:
})()(|{#max
,0
yxxfxfXxDU
yx
f
Where X is the set of all possible input values with 2n
(n = 8
for 8x8 S-box) as the number of its total elements. It also one
of the practical attacks that have been successfully utilized to
break the DES bock ciphers. The maximum score of the
differential uniformity in an 8x8 S-box should be as low
enough to resist the differential cryptanalysis and prevailing
attack procedure.
3.4 Algebraic Immunity
The algebraic immunity of an S-box is a measure of the
complexity of general algebraic attacks. It depends on the
count and kind of linearly independent multivariate equations
it satisfies [13]. The AI of a Boolean function f is the
minimum value of d such that f or f + 1 admits a function g of
degree d such that f×g = 0 [14]. Algebraic immunity is aspired
to evaluate Boolean resistive strengths to attacks that takes
into account the annihilators, which are used to deduce a
multivariate equation in the output of the function that have a
sufficiently low degree to solve them proficiently. Utilizing
low-degree annihilators, it is conceivable to diminish the level
of a Boolean function in system of multivariate conditions to a
small enough value such that the system of equations relating
the Boolean function and state bits of a cryptosystem can be
solved in a reasonable amount of time [5]. The AI metrics
denotes the resistance of an S-box, used in block ciphers,
against the algebraic attacks and inversely the effectiveness of
the XSL attack on a particular S-box. The procedure of
computing the algebraic immunity is explained in [13]. A high
score of algebraic immunity is desired to complicate the
algebraic attacks on S-box. Meaning, an S-Box having high
algebraic immunity will be better.
3.5 Algebraic Complexity
Algebraic complexity is counted as the number of terms
appearing in the algebraic expression of an S-box. Algebraic
expression can be calculated using Lagrange interpolation of
an S-box, but it has to be done in Galois field GF(28
). The
algebraic complexity of an S-box is the number of non-zero
coefficients of terms in the corresponding linearized
polynomial. Daemen and Rijmen pointed out that a function
in finite galois field onto itself is expressible as a linear
polynomial [3]. In fact, given a tabular form of the function, it
is possible to generate the Lagrange polynomial and then
simplify to have algebraic expression. AES and similar S-
boxes S-boxes are based of power (inverse) mappings of the
form xd
for exponents d. In case of AES proposal, Fermat’s
Little Theorem provides that d = 254 = -1 in galois field
GF(28
) [15]. The power mapping used in AES S-box is
followed by the affine transformation. The algebraic
complexity for AES S-box is just 9. The researchers consider
that this score is too low and may render varieties of
interpolation attacks fertile [16]. As such, there has been
ample work carried out to improve the algebraic complexity
to higher values. The method to apply Lagrangian
interpolation to find algebraic complexity of an S-box is
detailed in [17].
In this study, a number of recent 8x8 S-boxes have been
collected, the selected set has S-boxes that are designed by
employing different concepts and primitives such as power
mapping techniques, affine transformation, number theoretic
approaches, chaos, etc and investigated in [20-29]. Most of
them are popular that have been extensively cited and referred
in the literature for S-boxes synthesis and study. These S-
boxes are analyzed and assessed against the following
performance measures pertinent to the strength of S-boxes.
The performance measures include average nonlinearity NL
(denotes the mean of nonlinearity scores of all 8 Boolean
functions inherent to the S-box under consideration, higher
score is appreciated), linear approximation probability
(maximum value is reported for the analysis, it is preferable to
have the maximum score of LAP as low as possible),
algebraic immunity AI and algebraic complexity AC (an S-
box should have high scores of algebraic immunity and
algebraic complexity as well), and differential uniformity
(lower score of maximum values of DU is appraised). The
scores of security parameters for selected 8x8 substitution-
boxes are carefully computed by using their refereed
algorithms and procedures available in the literature are listed
conjointly in Table I. The comparison study has the findings
which are discussed subsequently.
It is evident from the study that the algebraic immunity alone
cannot be considered as a good parameter for commenting on
the resistivity against the algebraic attacks. For that matter,
the algebraic complexity has a significance as well to compare
S-boxes over resistivity to algebraic attacks. There exists
some sort of direct relationship between the non-linearity and
transparency order.
The study unveils that the S-box in Ref. [29] tend to show
excellent nonlinearity scores of 112 along with lowest
achievable LAP of 16/256 = 0.0625 for 8x8 S-boxes. Thereby,
it can be claimed that these three S-boxes has the ability to
resist the linear cryptanalysis as they provide sufficiently
enough nonlinearity structure to the block ciphers. In this
regard, the S-box in Ref. [34] offers lowest nonlinearity score
of 99.5 and S-box in Ref. [36] shows the poorest LAP score of
160/256 = 0.625 among all S-boxes in the set.
As far as analysis against the differential cryptanalysis is
concern, the performance through differential uniformity is
portrayed in Table 1. Again, the S-box in Ref. [29] has DU =
4, thereby offers splendid resistance to the differential
cryptanalysis. However, the S08 and S09 failed to provide
sufficient susceptibility unlike the other S-boxes of the set.
The resistivity of S-boxes under consideration have somewhat
similar tendency to handle the algebraic attacks. Almost all S-
boxes (except in Ref. [33] for AI and S01 for AC) provide
decent potentiality against algebraic attacks. Deciding over all
performance measures, the S-boxes in decreasing order in
4. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No. 5, Issue No. 2, April 2017
14
Ref. [29] → in Ref. [30] tends to exhibits the best features and
appeared as best among the others of the set. However,
depending upon the use cases we can choose one of the S-box
from our observations, for instance if we are shipping a
hardware which uses algorithms like AES for encryption.
Similarly, if we are to use AES implementation on the
software, where there is no possibility of SCA attacks, it will
be better to choose S-boxes which are resilient toward
algebraic attacks. But in all cases, we must try to make sure
that the S-box chosen always satisfies basic properties up to
higher extend as possible.
TABLE I. COMPARISON OF SECURITY STRENGTHS OF SOME
8×8 S-BOXES
S-Box NL LP AI AC DU
Ref. [29] 112 0.0625 4 255 4
Ref. [30] 108 0.1406 4 255 10
Ref. [31] 103.75 0.0625 4 255 10
Ref. [32] 102.75 0.1328 4 254 12
Ref. [33] 104 0.1250 3 253 32
Ref. [34] 99.5 0.1328 4 254 72
Ref. [35] 104 0.1328 4 253 64
Ref. [36] 105.25 0.6250 4 255 10
Ref. [37] 107 0.1484 4 255 10
Ref. [38] 105.25 0.1328 4 254 10
Ref. [39] 100 0.1796 3 253 16
As a future work, there is a great scope of research in finding
an optimal S-box particular for higher input-output bits. For
instances, considering an 8x8 S-box, mathematically 256!
different bijective S-boxes are possible. It is computationally
infeasible to evaluate all such possibilities and finding out the
optimal S-box(es) out of the total 256! cases. So, it raises a
direction for finding optimal or sub-optimal S-boxes, if one
can develop an approach which decides the optimal S-box by
giving some weightage to each of the properties. This will be
certainly beneficial for picking up the optimal S-box when we
could develop S-boxes dynamically.
4. CONCLUSION
In this communication, the security strength evaluation of
some widely used 8×8 S-boxes which are recently synthesized
is studied to uncover the optimal candidate(s). The strength
comparison is done through measures like nonlinearity, linear
approximation probability, algebraic immunity, algebraic
complexity, and differential uniformity. These parameters are
directly or indirectly decide the security strength of S-boxes
against cryptographic assaults like linear cryptanalysis,
algebraic attacks, and differential cryptanalysis. The analysis
highlighted few practical findings and suggested optimal/sub-
optimal S-box(es) based on the study. The anticipated analysis
in this work facilitates the cryptographers, designers,
researchers to choose suitable S-boxes decided over many
parameters that can be applied in modern block encryption
systems for desired confusion and diffusion of plaintext data.
5. REFERENCES
[1] C. E. Shannon, "Communication theory of secrecy
systems", Bell Systems Technical Journal, vol. 28, no.
4, pp. 656-715, 1949.
[2] M. Ahmad, S. Alam, "A Novel Approach for Efficient
S-Box Design Using Multiple High-Dimensional
Chaos." International Conference on Advanced
Computing & Communication Technologies, pp. 95-99,
2014.
[3] Specification for the Advanced Encryption Standard
(AES), Federal Information Processing Standards
Publication 197, 2001.
http://csrc.nist.gov/publications/fips/fips197/fips-
197.pdf.
[4] J. Daemen, V. Rijmen, The design of Rijndael: AES –
the Advanced Encryption Standard, Information
Security and Cryptography, Springer, 2002.
[5] C. A. Wood, "Large Substitution Boxes with Efficient
Combinational Implementations", M.S. Thesis,
Rochester Institute of Technology, 2013.
[6] E. Biham, A. Shamir, "Differential cryptanalysis of
DES-like cryptosystems", Journal of Cryptology, vol 4,
no. 1, pp. 3-72, 1991.
[7] M. Matsui, "Linear Cryptanalysis Method of DES
Cipher", Advances in Cryptology: EuroCrypt-1993
Proceedings, Lecture Notes in Computer Science, vol.
765, pp. 386-397, 1994.
[8] J.H. Cheon, D. H. Lee, “Resistance of S-Boxes against
Algebraic Attacks”, Lecture Notes in Computer Science
vol. 3017, pp. 83–93, 2004.
[9] K. P. Stjepan, "Confused by Confusion: Systematic
Evaluation of DPA Resistance of Various S-boxes",
INDOCRYPT-2014, Lecture Notes in Computer
Science, vol. 8885, pp 374-390, 2014.
[10] D. R. Stinson, Cryptography: Theory and Practice,
Chapman & Hall/CRC, 2005.
[11] T. Cusick, P. Stanica, Cryptographic boolean functions
and applications, Elsevier, 2009.
[12] F. Özkaynak, A. B. Özer, "A method for designing
strong S-boxes based on chaotic Lorenz system",
Physics Letters A, vol. 374,no. 36, pp. 3733–3738,
2010.
[13] F. Didier, J.P. Tillich, "Computing the algebraic
immunity efficiently", International Workshop on Fast
Software Encryption, Lecture Notes in Computer
Science, vol. 4047, pp. 359-374, 2006.
[14] F. Armknecht, C. Claude, G. Philippe, K. Simon, M.
Willi. R. Olivier, "Efficient computation of algebraic
immunity for algebraic and fast algebraic attacks",
Advances in Cryptology – EUROCRYPT-2006, Lecture
Notes in Computer Science, vol. 4004, pp. 147-164,
2006.
[15] J. Liu, B. Wai, X. Cheng, X. Wang, “An AES S-box to
increase complexity and cryptographic analysis”, 19th
International Conference on Advanced Information
Networking and Applications, vol. 1, pp. 724–728,
2005.
5. Journal of Advanced Computing and Communication Technologies (ISSN: 2347 - 2804)
Volume No. 5, Issue No. 2, April 2017
15
[16] J. Cui, L. Huang, H. Zhong, C. Chang, W. Yang, “An
improved AES S-Box and its performance analysis”,
International Journal of Innovative Computing,
Information and Control, vol. 7, no. 5, pp. 2291-2302,
2011.
[17] C. Cid, S. Murphy, M. Robshaw, “Computational and
algebraic aspects of the advanced encryption standard”,
Seventh International Workshop on Computer Algebra
in Scientific Computing, vol. 2004, pp. 1-11, 2004.
[18] E. Prou, "DPA Attacks and S-Boxes", Proceedings of
FSE-2005, Lecture Notes in Computer Science, vol.
3557, pp 424-441, 2005.
[19] M. Ahmad, "Cryptanalysis of chaos based secure
satellite imagery cryptosystem", In International
Conference on Contemporary Computing, pp. 81-91,
2011.
[20] P.K. Sharma, M. Ahmad and P.M. Khan,
"Cryptanalysis of image encryption algorithm based on
pixel shuffling and chaotic S-box transformation",
International Symposium on Security in Computing and
Communication, pp. 173-181, 2014.
[21] O.P. Verma, M. Nizam and M. Ahmad, "Modified
multi-chaotic systems that are based on pixel shuffle for
image encryption", Journal of Information Processing
Systems, vol. 9, no. 2, pp. 271-286, 2013.
[22] M. Ahmad, P.M. Khan, and M.Z. Ansari, "A simple and
efficient key-dependent S-box design using fisher-yates
shuffle technique,", International Conference on
Security in Computer Networks and Distributed
Systems, pp. 540-550, 2014.
[23] M. Ahmad, N. Mittal, P. Garg and M.M. Khan,
"Efficient cryptographic substitution box design using
travelling salesman problem and chaos", Perspectives in
Science, vol. 8, pp. 465-468, 2016.
[24] M. Ahmad and M. Malik, "Design of chaotic neural
network based method for cryptographic substitution
box", International Conference on Electrical,
Electronics, and Optimization Techniques, pp. 864-868,
2016.
[25] M. Ahmad, Hitesh Chugh, Avish Goel, and Prateek
Singla, "A chaos based method for efficient
cryptographic S-box design." In International
Symposium on Security in Computing and
Communication, pp. 130-137. Springer Berlin
Heidelberg, 2013.
[26] M. Ahmad, F. Ahmad, Z. Nasim, Z. Bano and S. Zafar,
"Designing chaos based strong substitution box."
International Conference on Contemporary Computing,
pp. 97-100, 2015.
[27] M. Ahmad, D.R. Rizvi and Z. Ahmad, "PWLCM-Based
Random Search for Strong Substitution-Box Design",
International Conference on Computer and
Communication Technologies, pp. 471-478. 2016.
[28] L. Cui, Y. Cao, "A new S-box structure named Affine-
Power-Affine", International Journal of Innovative
Computing, Information and Control, vol. 3, no. 3, pp.
751-759, 2007.
[29] M.T. Tran, D.K. Bui, A.D. Duong, "Gray S-box for
advanced encryption standard", International
Conference on Computational Intelligence and Security,
vol. 1, pp. 253-258, 2008.
[30] Y. Wang, K.K. Wong, C. Li, Y. Li, "A novel method to
design S-box based on chaotic map and genetic
algorithm", Physics Letters A, vol. 376, no. 6, pp. 827-
833, 2012.
[31] M. Dara, K. Manochehri, "A Novel Method for
Designing S-Boxes Based on Chaotic Logistic Maps
Using Cipher Key", World Applied Sciences Journal,
vol. 28, no. 12, pp. 2003-2009, 2013.
[32] Peng, Jun, et al. "A Novel Method for Designing
Dynamical Key-Dependent S-Boxes based on
Hyperchaotic System." International Journal of
Advancements in Computing Technology, vol. 28, no.
12, pp. 2003-2009, 2013.
[33] I. Hussain, T. Shah, M.A. Gondal, W.A. Khan,
"Construction of cryptographically strong 8× 8 S-
boxes", World Applied Sciences Journal vol. 13, no. 11,
pp. 2389-2395, 2011.
[34] E.S. Abuelyman, A.A.S. Alsehibani, "An optimized
implementation of the S-Box using residue of prime
numbers", International Journal of Computer Science
and Network Security, vol. 8, no. 4, pp. 304-309, 2008.
[35] I. Hussain, T. Shah, M.A. Gondal, M. Khan, W.A.
Khan, "Construction of new S-box using a linear
fractional transformation." World Applied Science
Journal, vol. 14, no. 12, pp. 1779-1785, 2011.
[36] A. H. Alkhaldi, I. Hussain, M.A. Gondal, "A novel
design for the construction of safe S-boxes based on
TDERC sequence", Alexandria Engineering Journal,
vol. 54, no. 1, pp. 65-69, 2015.
[37] M. Ahmad, D. Bhatia, Y. Hassan. "A Novel Ant Colony
Optimization Based Scheme for Substitution Box
Design", Procedia Computer Science, vol. 57, pp. 572-
580, 2015.
[38] M. Ahmad, H. Haleem, P. M. Khan. "A new chaotic
substitution box design for block ciphers." International
Conference on Signal Processing and Integrated
Networks, pp. 255-258, 2014.
[39] M. Khan, T. Shah and S. I. Batool, "Construction of S-
box based on chaotic Boolean functions and its
application in image encryption", Neural Computation
and Applications, vol 27, no. 3, pp. 677-685, 2016.