This document summarizes a research paper on using randomized chained linear codes for digital signatures. The summary is:
1) Randomized chained linear codes are proposed to address attacks on previous signature schemes that used regular chained codes. Random vectors are concatenated to the generator matrix of a chained code to create randomized chained codes.
2) A digital signature scheme is presented that uses randomized chained codes. The private key consists of the generator matrix and randomization matrices. The public key is the randomized parity check matrix. Signatures are created using the chain code decoding algorithm.
3) Security analysis shows the scheme is secure if the code length is over 1350 bits, preventing an attacker from determining the private key from the public information
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Presentation on Cryptography_Based on IEEE_PaperNithin Cv
The document summarizes a seminar report on a hybrid cryptography architecture that uses multiple cryptographic algorithms. It discusses Elliptic Curve Cryptography (ECC), Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA), and Dual-RSA. ECC is used to encrypt data onto an elliptic curve. ECDH generates shared secret keys between two parties for use in symmetric encryption. ECDSA allows digital signatures using elliptic curve parameters. Dual-RSA improves decryption efficiency using the Chinese Remainder Theorem to split computations between prime factors p and q. The hybrid architecture combines the strengths of these algorithms to provide secure encryption, authentication, and key exchange.
Evaluation of Performance Characteristics of Polynomial based and Lattice bas...IDES Editor
In order to achieve the security for the e-business
application, generally, the organizations follow the
cryptographic methods. The two widely accepted and used
cryptographic methods are symmetric and asymmetric. The
DES ideally belongs to the category of symmetric key
cryptosystem and RSA, NTRU[3] belongs to the category of
asymmetric key cryptosystem. NTRU (Nth degree truncated
polynomial ring units) is a collection of mathematical
algorithms based on manipulating lists of very small integers.
NTRU is the first secure public key cryptosystem not based on
factorization or discrete logarithmic problems. The keys are
generated by having small potent polynomials from the ring
of truncated polynomials. NTRU can also be implemented
using matrices instead of polynomials [4, 5]. We proceed with
the encryption and decryption of the plain text required by
implementing the algorithms of both the approaches of NTRU
cryptosystems. It is already shown that the matrix approach is
algorithmically better than the polynomial approach of NTRU
cryptosystem [5]. We propose and test both the methods for
variable sized text files, using polynomial and matrix
cryptosystems. This paper presents the comparative study of
polynomial NTRU and matrix NTRU algorithms for variable
sized text files as input. The final results were observed using
Mathematica5.1, analyzed and compared so as to identify which
method is appropriate to the business needs.
This document is a worksheet for a cryptography and network security course. It contains definitions of key terms like cryptography, encryption, decryption, and types of attacks. It also outlines classical encryption techniques like the Caesar cipher, Playfair cipher, Hill cipher, Vigenere cipher, and transposition techniques. Finally, it covers number theory topics such as prime numbers, factorization, Fermat's theorem, Euler's theorem, and primitive roots as they relate to cryptography.
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
Combined Implementation of Robust Cryptosystem for Non-invertible Matrices ba...IDES Editor
In this paper, we have combined the Robust
Cryptosystem for Non-invertible matrices based on Hill Cipher
technique with steganography method in order to securely
transmit text message. The steganography method used is LSB
insertion technique. The encryption and steganography
methods are used subsequently along with two randomization
technique: one of XOR the encrypted text and another of
randomized LSB insertion in any cover image. These two layers
of shuffling of text at different stages of encryption and
steganography provide two extra layers of security and make
the system robust against cryptanalytic attacks.
A PAIRING-FREE IDENTITY BASED TRIPARTITE SIGNCRYPTION SCHEMEijcisjournal
The certificate-based cryptosystems is traditional way in providing the system parameters. Identity-based
cryptography is more efficient than certificate-based cryptosystems. Each user in identity-based
cryptography uses any arbitrary string that uniquely identifies him as his public key. This paper proposes
a new identity-based tripartite signcryption scheme based on the elliptic curve discrete logarithm problem.
The proposed id-based tripartite signcryption scheme does not use the bilinear pairings in both the
Signcryption and unsigncryption phases. The proposed scheme used to reduce the communication over
head when three entities wants to communicate securely as in authentication protocol in GSM and in ecommerce.
The proposed scheme satisfies various desirable security properties. Also, the performance of
the proposed scheme is tested.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
WEAKNESS ON CRYPTOGRAPHIC SCHEMES BASED ON REGULAR LDPC CODESIJNSA Journal
We propose a method to recover the structure of a randomly permuted chained code and how to cryptanalyse cryptographic schemes based on these kinds of error coding. As application of these methods is a cryptographic schema using regular Low Density Parity Check (LDPC) Codes. This result prohibits the use of chained code and particularly regular LDPC codes on cryptography
Presentation on Cryptography_Based on IEEE_PaperNithin Cv
The document summarizes a seminar report on a hybrid cryptography architecture that uses multiple cryptographic algorithms. It discusses Elliptic Curve Cryptography (ECC), Elliptic Curve Diffie-Hellman (ECDH), Elliptic Curve Digital Signature Algorithm (ECDSA), and Dual-RSA. ECC is used to encrypt data onto an elliptic curve. ECDH generates shared secret keys between two parties for use in symmetric encryption. ECDSA allows digital signatures using elliptic curve parameters. Dual-RSA improves decryption efficiency using the Chinese Remainder Theorem to split computations between prime factors p and q. The hybrid architecture combines the strengths of these algorithms to provide secure encryption, authentication, and key exchange.
Evaluation of Performance Characteristics of Polynomial based and Lattice bas...IDES Editor
In order to achieve the security for the e-business
application, generally, the organizations follow the
cryptographic methods. The two widely accepted and used
cryptographic methods are symmetric and asymmetric. The
DES ideally belongs to the category of symmetric key
cryptosystem and RSA, NTRU[3] belongs to the category of
asymmetric key cryptosystem. NTRU (Nth degree truncated
polynomial ring units) is a collection of mathematical
algorithms based on manipulating lists of very small integers.
NTRU is the first secure public key cryptosystem not based on
factorization or discrete logarithmic problems. The keys are
generated by having small potent polynomials from the ring
of truncated polynomials. NTRU can also be implemented
using matrices instead of polynomials [4, 5]. We proceed with
the encryption and decryption of the plain text required by
implementing the algorithms of both the approaches of NTRU
cryptosystems. It is already shown that the matrix approach is
algorithmically better than the polynomial approach of NTRU
cryptosystem [5]. We propose and test both the methods for
variable sized text files, using polynomial and matrix
cryptosystems. This paper presents the comparative study of
polynomial NTRU and matrix NTRU algorithms for variable
sized text files as input. The final results were observed using
Mathematica5.1, analyzed and compared so as to identify which
method is appropriate to the business needs.
This document is a worksheet for a cryptography and network security course. It contains definitions of key terms like cryptography, encryption, decryption, and types of attacks. It also outlines classical encryption techniques like the Caesar cipher, Playfair cipher, Hill cipher, Vigenere cipher, and transposition techniques. Finally, it covers number theory topics such as prime numbers, factorization, Fermat's theorem, Euler's theorem, and primitive roots as they relate to cryptography.
Image Encryption Using Advanced Hill Cipher AlgorithmIDES Editor
The Hill cipher algorithm is one of the symmetric
key algorithms that have several advantages in data
encryption. But, the inverse of the key matrix used for
encrypting the plaintext does not always exist. Then if the
key matrix is not invertible, then encrypted text cannot be
decrypted. In the Involutory matrix generation method the
key matrix used for the encryption is itself invertible. So, at
the time of decryption we need not to find the inverse of the
key matrix. The objective of this paper is to encrypt an
image using a technique different from the conventional Hill
Cipher. In this paper a novel advanced Hill (AdvHill)
encryption technique has been proposed which uses an
involutory key matrix. The scheme is a fast encryption
scheme which overcomes problems of encrypting the images
with homogeneous background. A comparative study of the
proposed encryption scheme and the existing scheme is
made. The output encrypted images reveal that the
proposed technique is quite reliable and robust.
Combined Implementation of Robust Cryptosystem for Non-invertible Matrices ba...IDES Editor
In this paper, we have combined the Robust
Cryptosystem for Non-invertible matrices based on Hill Cipher
technique with steganography method in order to securely
transmit text message. The steganography method used is LSB
insertion technique. The encryption and steganography
methods are used subsequently along with two randomization
technique: one of XOR the encrypted text and another of
randomized LSB insertion in any cover image. These two layers
of shuffling of text at different stages of encryption and
steganography provide two extra layers of security and make
the system robust against cryptanalytic attacks.
A PAIRING-FREE IDENTITY BASED TRIPARTITE SIGNCRYPTION SCHEMEijcisjournal
The certificate-based cryptosystems is traditional way in providing the system parameters. Identity-based
cryptography is more efficient than certificate-based cryptosystems. Each user in identity-based
cryptography uses any arbitrary string that uniquely identifies him as his public key. This paper proposes
a new identity-based tripartite signcryption scheme based on the elliptic curve discrete logarithm problem.
The proposed id-based tripartite signcryption scheme does not use the bilinear pairings in both the
Signcryption and unsigncryption phases. The proposed scheme used to reduce the communication over
head when three entities wants to communicate securely as in authentication protocol in GSM and in ecommerce.
The proposed scheme satisfies various desirable security properties. Also, the performance of
the proposed scheme is tested.
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
This document contains a question bank for the subject Cryptography and Network Security. It includes questions grouped under different units of the subject: Introduction and Number Theory, Block Ciphers and Public Key Cryptography, Hash Functions and Digital Signatures. For each question, it provides the question number, question, marks allotted, knowledge level and number of times the question may appear in the assessment. The document also provides details of the subject code, name, class, staff in-charge and course code.
What is cryptography,its types,two algorithms i.e RSA and DES.
explained well and referenced the slide share too to give more precise presentation. Thank you.
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.
This document discusses enhancing security in DNA-based cryptography. It describes how DNA can be used to store encrypted data by encoding messages in DNA strands using an alphabet of short DNA sequences. The document outlines several methods for DNA-based cryptography including DNA steganography systems that hide encrypted messages within collections of DNA strands. It also summarizes the RSA encryption algorithm and describes challenges in DNA-based cryptography systems like preventing unauthorized access and protecting against cryptanalysis. The document concludes that initial investigations show DNA cryptography methods can in principle be unbreakable but also discusses ways to improve security.
Survey on asymmetric key cryptography algorithmsEditor Jacotech
The document summarizes and compares several asymmetric key cryptography algorithms. It begins by introducing the concept of public key cryptography and describing some of its advantages. It then provides brief overviews of the following algorithms: RSA, Diffie-Hellman key exchange, Digital Signature Algorithm, Elliptic Curve Cryptography, Elliptic Curve Diffie-Hellman, ElGamal Encryption Algorithm, and the Knapsack Algorithm. For each algorithm, it outlines the key generation, encryption, and decryption processes. It concludes by comparing the advantages and disadvantages of the different approaches.
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.
An Advance Approach of Image Encryption using AES, Genetic Algorithm and RSA ...IJEACS
In current scenario the entire world is moving towards digital communication for fast and better communication. But in this a problem rises with security i.e. when we have to store information (either data or image) at any casual location or transmit information through internet. As internet is an open transmission medium, security of data becomes very important. To defend our information from piracy or from hacking we use a technique and i.e. known as Encryption Technique. In this paper, we use image as information and use an advance approach of well-known encryption techniques like AES, Genetic Algorithm, and RSA algorithm to encrypt it and keep our information safe from hackers or intruders making it highly difficult and time consuming to decipher the image without using the key.
Blind Signature Scheme Based On Elliptical Curve Cryptography (ECC)IOSR Journals
This document summarizes a blind signature scheme based on elliptic curve cryptography. It begins with an introduction to cryptography and the history of cryptography. It then discusses symmetric key cryptography, asymmetric key cryptography including public and private key pairs. It describes digital signatures, how they are generated and verified. It introduces the concept of blind signatures, how a message can be signed without revealing its contents to the signer. It discusses the mathematics behind elliptic curves and elliptic curve cryptography. It describes how to represent points on an elliptic curve and perform operations like point addition. The document focuses on implementing a blind digital signature scheme using elliptic curve cryptography.
BLIND SIGNATURE SCHEME BASED ON CHEBYSHEV POLYNOMIALSIJNSA Journal
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair.This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms of Chebyshev polynomials.
IRJET-Triple Layered Security on Android Based SMS TransactionIRJET Journal
The document proposes a triple layer encryption technique for SMS on Android that securely encrypts messages. The technique applies bit manipulation, hill cipher encryption, and AES encryption sequentially to the SMS. At each stage of encryption, the output is converted to a new format before the next technique is applied. For decryption, the process is reversed, applying AES decryption first before hill cipher decryption and bit manipulation to recover the original SMS message. The technique aims to provide robust security for SMS transactions by encrypting data multiple times with different algorithms.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
This document presents an improved asymmetric key encryption algorithm using MATLAB. It begins with an introduction to asymmetric key cryptography and the RSA cryptosystem. It then describes a modified RSA algorithm using multiple public and private keys to increase security. Next, it explains how to implement RSA using the Chinese Remainder Theorem to reduce computational time. The document implements the original, modified, and CRT-based RSA algorithms in MATLAB and analyzes computation time versus number of prime numbers. It concludes the modified and CRT-based approaches provide more security than the original RSA algorithm with reduced computational time.
Lightweight Cryptography for Distributed PKI Based MANETSIJCNCJournal
This document proposes a lightweight cryptography solution for secure communication in mobile ad hoc networks (MANETs). It describes creating a distributed public key infrastructure (PKI) using Shamir's secret sharing to decentralize the certificate authority role among MANET nodes. Each node holds a share of the private key. It then proposes using Tiny Encryption Algorithm (TEA), an efficient symmetric-key cipher, along with elliptic curve Diffie-Hellman key exchange to establish secure communication between nodes with limited resources. The system initializes by having founding MANET nodes act as dealers to distribute secret shares. Nodes then use Diffie-Hellman to independently derive a secret key to encrypt communications.
Cryptosystem An Implementation of RSA Using Verilogijcncs
This document describes an implementation of the RSA cryptosystem using Verilog for an FPGA. It presents the design of modules for key generation, encryption, and decryption. For key generation, it generates random prime numbers using an LFSR and primality tester, then calculates the public and private keys. Encryption and decryption are performed through modular exponentiation implemented with a right-to-left binary method. The modules are coded in Verilog and synthesized for an FPGA to provide a secure cryptosystem.
The document discusses stream ciphers and block ciphers. It explains that stream ciphers encrypt data bit-by-bit or byte-by-byte, requiring a randomly generated keystream, while block ciphers encrypt fixed-length blocks, allowing for broader applications. It then focuses on the Feistel cipher structure for block ciphers, proposed by Feistel to approximate an ideal block cipher for large block sizes. The Feistel structure uses a product cipher approach involving substitutions and permutations to provide diffusion and confusion and resist statistical cryptanalysis.
Two children, Ikaika and Nani, go swimming in the ocean but wander too far out. The Great Puhi, a giant eel, captures Ikaika and hides him in a cave. Nani asks various sea creatures for help but they say the Puhi is too big. She cries on the shore and two tiny limpets called 'opihi offer to help. They climb onto the Puhi's body and eyes, blinding him. This allows Nani to rescue Ikaika while the 'opihi distract the Puhi. Though small, the 'opihi bravely save the children through their courageous actions.
Lessons Learned from PhD Process ExperienceHemant Purohit
This document summarizes lessons learned from the speaker's Ph.D. experience. It recommends preparing for the long journey by learning to communicate, reading diverse content, and balancing breadth and depth. It also suggests intersecting work with fun, organizing for productivity and prioritization, finding mentors, networking, and using motivational resources when feeling down. The overall message is that a Ph.D. is a training process that requires preparation, organization, discussion with others, and networking to succeed.
This document contains a question bank for the subject Cryptography and Network Security. It includes questions grouped under different units of the subject: Introduction and Number Theory, Block Ciphers and Public Key Cryptography, Hash Functions and Digital Signatures. For each question, it provides the question number, question, marks allotted, knowledge level and number of times the question may appear in the assessment. The document also provides details of the subject code, name, class, staff in-charge and course code.
What is cryptography,its types,two algorithms i.e RSA and DES.
explained well and referenced the slide share too to give more precise presentation. Thank you.
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.
This document discusses enhancing security in DNA-based cryptography. It describes how DNA can be used to store encrypted data by encoding messages in DNA strands using an alphabet of short DNA sequences. The document outlines several methods for DNA-based cryptography including DNA steganography systems that hide encrypted messages within collections of DNA strands. It also summarizes the RSA encryption algorithm and describes challenges in DNA-based cryptography systems like preventing unauthorized access and protecting against cryptanalysis. The document concludes that initial investigations show DNA cryptography methods can in principle be unbreakable but also discusses ways to improve security.
Survey on asymmetric key cryptography algorithmsEditor Jacotech
The document summarizes and compares several asymmetric key cryptography algorithms. It begins by introducing the concept of public key cryptography and describing some of its advantages. It then provides brief overviews of the following algorithms: RSA, Diffie-Hellman key exchange, Digital Signature Algorithm, Elliptic Curve Cryptography, Elliptic Curve Diffie-Hellman, ElGamal Encryption Algorithm, and the Knapsack Algorithm. For each algorithm, it outlines the key generation, encryption, and decryption processes. It concludes by comparing the advantages and disadvantages of the different approaches.
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.
An Advance Approach of Image Encryption using AES, Genetic Algorithm and RSA ...IJEACS
In current scenario the entire world is moving towards digital communication for fast and better communication. But in this a problem rises with security i.e. when we have to store information (either data or image) at any casual location or transmit information through internet. As internet is an open transmission medium, security of data becomes very important. To defend our information from piracy or from hacking we use a technique and i.e. known as Encryption Technique. In this paper, we use image as information and use an advance approach of well-known encryption techniques like AES, Genetic Algorithm, and RSA algorithm to encrypt it and keep our information safe from hackers or intruders making it highly difficult and time consuming to decipher the image without using the key.
Blind Signature Scheme Based On Elliptical Curve Cryptography (ECC)IOSR Journals
This document summarizes a blind signature scheme based on elliptic curve cryptography. It begins with an introduction to cryptography and the history of cryptography. It then discusses symmetric key cryptography, asymmetric key cryptography including public and private key pairs. It describes digital signatures, how they are generated and verified. It introduces the concept of blind signatures, how a message can be signed without revealing its contents to the signer. It discusses the mathematics behind elliptic curves and elliptic curve cryptography. It describes how to represent points on an elliptic curve and perform operations like point addition. The document focuses on implementing a blind digital signature scheme using elliptic curve cryptography.
BLIND SIGNATURE SCHEME BASED ON CHEBYSHEV POLYNOMIALSIJNSA Journal
A blind signature scheme is a cryptographic protocol to obtain a valid signature for a message from a signer such that signer’s view of the protocol can’t be linked to the resulting message signature pair.This paper presents blind signature scheme using Chebyshev polynomials. The security of the given scheme depends upon the intractability of the integer factorization problem and discrete logarithms of Chebyshev polynomials.
IRJET-Triple Layered Security on Android Based SMS TransactionIRJET Journal
The document proposes a triple layer encryption technique for SMS on Android that securely encrypts messages. The technique applies bit manipulation, hill cipher encryption, and AES encryption sequentially to the SMS. At each stage of encryption, the output is converted to a new format before the next technique is applied. For decryption, the process is reversed, applying AES decryption first before hill cipher decryption and bit manipulation to recover the original SMS message. The technique aims to provide robust security for SMS transactions by encrypting data multiple times with different algorithms.
Comparative Analysis of Cryptographic Algorithms and Advanced Cryptographic A...editor1knowledgecuddle
Today is the era of Internet and networks applications. So,Information security is a challenging issue in today’s technological world. There is a demand for a stronger encryption which is very hard to crack. The role of Cryptography is most important in the field of network security. There is a broad range of cryptographic algorithms that are used for securing networks and presently continuous researches on the new cryptographic algorithms are going on for evolving more advanced techniques for secures
communication. In this study is made for the cryptography algorithms, particularly algorithms- AES, DES, RSA, Blowfishare compared and performance is evaluated. Also some enhanced algorithms are described and compared with the enhanced algorithms.
Keywords - AES, DES, BLOWFISH, Decryption, Encryption, Security
This document presents an improved asymmetric key encryption algorithm using MATLAB. It begins with an introduction to asymmetric key cryptography and the RSA cryptosystem. It then describes a modified RSA algorithm using multiple public and private keys to increase security. Next, it explains how to implement RSA using the Chinese Remainder Theorem to reduce computational time. The document implements the original, modified, and CRT-based RSA algorithms in MATLAB and analyzes computation time versus number of prime numbers. It concludes the modified and CRT-based approaches provide more security than the original RSA algorithm with reduced computational time.
Lightweight Cryptography for Distributed PKI Based MANETSIJCNCJournal
This document proposes a lightweight cryptography solution for secure communication in mobile ad hoc networks (MANETs). It describes creating a distributed public key infrastructure (PKI) using Shamir's secret sharing to decentralize the certificate authority role among MANET nodes. Each node holds a share of the private key. It then proposes using Tiny Encryption Algorithm (TEA), an efficient symmetric-key cipher, along with elliptic curve Diffie-Hellman key exchange to establish secure communication between nodes with limited resources. The system initializes by having founding MANET nodes act as dealers to distribute secret shares. Nodes then use Diffie-Hellman to independently derive a secret key to encrypt communications.
Cryptosystem An Implementation of RSA Using Verilogijcncs
This document describes an implementation of the RSA cryptosystem using Verilog for an FPGA. It presents the design of modules for key generation, encryption, and decryption. For key generation, it generates random prime numbers using an LFSR and primality tester, then calculates the public and private keys. Encryption and decryption are performed through modular exponentiation implemented with a right-to-left binary method. The modules are coded in Verilog and synthesized for an FPGA to provide a secure cryptosystem.
The document discusses stream ciphers and block ciphers. It explains that stream ciphers encrypt data bit-by-bit or byte-by-byte, requiring a randomly generated keystream, while block ciphers encrypt fixed-length blocks, allowing for broader applications. It then focuses on the Feistel cipher structure for block ciphers, proposed by Feistel to approximate an ideal block cipher for large block sizes. The Feistel structure uses a product cipher approach involving substitutions and permutations to provide diffusion and confusion and resist statistical cryptanalysis.
Two children, Ikaika and Nani, go swimming in the ocean but wander too far out. The Great Puhi, a giant eel, captures Ikaika and hides him in a cave. Nani asks various sea creatures for help but they say the Puhi is too big. She cries on the shore and two tiny limpets called 'opihi offer to help. They climb onto the Puhi's body and eyes, blinding him. This allows Nani to rescue Ikaika while the 'opihi distract the Puhi. Though small, the 'opihi bravely save the children through their courageous actions.
Lessons Learned from PhD Process ExperienceHemant Purohit
This document summarizes lessons learned from the speaker's Ph.D. experience. It recommends preparing for the long journey by learning to communicate, reading diverse content, and balancing breadth and depth. It also suggests intersecting work with fun, organizing for productivity and prioritization, finding mentors, networking, and using motivational resources when feeling down. The overall message is that a Ph.D. is a training process that requires preparation, organization, discussion with others, and networking to succeed.
This document appears to be a performance review for an employee named "JOHN SMITH" that includes the following information:
1) The reviewer appreciates the employee's flexibility, desire to work, and ability to achieve targeted goals.
2) The employee could be more effective by focusing more on their strengths and receiving effective coaching on their weaknesses. The reviewer also suggests motivating the employee with new challenges and opportunities.
3) The reviewer notes the employee effectively communicates objectives, sets compelling personal goals, and keeps employees focused on achieving goals.
O documento apresenta os resultados de uma pesquisa de preços de materiais escolares realizada em janeiro de 2016 em 10 estabelecimentos em Florianópolis. Foram pesquisados os preços de 57 itens como cadernos, pastas, papéis, lápis e canetas. A tabela mostra o preço mínimo, máximo e médio de cada item, além da variação percentual de preços entre os estabelecimentos.
Re-invigorated OMAC Packaging Working Group Needs Your ParticipationBryan Griffen
The document summarizes a meeting of the OMAC Packaging Working Group, which aims to develop standards for packaging machinery. The group has launched several new initiatives, including standards for machine connectivity (PackConnect), safety (PackSafe), software (PackSoft), and sustainability (PackAbility). It also aims to promote adoption of existing standards like PackML. Participation in initiatives is encouraged. Standards will help packaging manufacturers maintain efficient operations as requirements change and machinery becomes more global.
Twitter es un servicio de microblogging que permite a usuarios publicar mensajes de texto de hasta 140 caracteres conocidos como tweets. Se creó en 2006 y desde entonces ha ganado popularidad mundial con más de 500 millones de usuarios. Twitter permite a las personas compartir información e ideas brevemente, establecer conexiones con otros, y participar en conversaciones en tiempo real a nivel global.
A Havoc Proof for Secure and Robust Audio WatermarkingCSCJournals
The audio watermarking involves the concealment of data within a discrete audio file. Audio watermarking technology affords an opportunity to generate copies of a recording which are perceived by listeners as identical to the original but which may differ from one another on the basis of the embedded information. A highly confidential audio watermarking scheme using multiple scrambling is presented Superior to other audio watermarking techniques, the proposed scheme is self-secured by integrating multiple scrambling operations into the embedding stage. To ensure that unauthorized detection without correct secret keys is nearly impossible, the watermark is encrypted by a coded-image; certain frames are randomly selected from the total frames of the audio signal for embedding and their order of coding is further randomized. Adaptive synchronization is improves the robustness against hazardous synchronization attacks, such as random samples cropping/inserting and pitch-invariant time stretching. The efficient watermarking schemes make it impossible to be detected and robust even though the watermarking algorithm is open to the public.
The document reports on an experiment that investigated the effect of a naphthalene adlayer on the desorption energies of a homologous series of 1-chloroalkanes on α-alumina. The researchers found that the desorption energy of the chloroalkanes increased by approximately 3 kJ/mol per methylene bridge when naphthalene was deposited above the chloroalkanes. They attribute this trend to the gradual melting and formation of molecular clusters in the naphthalene adlayer at temperatures above 200K, which allowed the desorption of the larger chloroalkanes.
Según la empresa consultora norteamericana McKinsey & Company, los profesores de Singapur están entre los mejores pagados con sueldos que superan los de los abogados e ingenieros. Indica que el gobierno sondea cada año los salarios medios de la población para asegurarse que los maestros ganen el doble. Un profesor de secundaria con 10 años de experiencia y un buen currículum puede ganar 60 mil euros por año, adicionándole cursos gratuitos de formación y varios miles de euros en bonos. Esta bonificación por mérito oscila entre el 10% y el 30% del salario anual a partir de los resultados de la evaluación. Al inicio, en el nivel primario, el salario equivale al PIB por habitantes del país. Verónica Barrios, analista de la Biblioteca del Congreso Nacional de Chile, explica que “el Estado deposita en la cuenta de ahorro de cada joven singapurense dinero, para que cuando crezca pueda realizar estudios de postgrado tanto en el país como en el extranjero”. Añade que “si a alguien le queda alguna duda de la obsesión singapurense por la educación, es cosa de ver el reverso de sus billetes de dos dólares: un profesor, decenas de estudiantes que lo miran atentamente, de fondo una universidad y bajo ellos, 9 letras: E-D-U-C-A-T-I-O-N”.
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.
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.
The Security Problem
Program Threats
System and Network Threats
Cryptography as a Security Tool
User Authentication
Implementing Security Defenses
Firewalling to Protect Systems and Networks
Computer-Security Classifications
An Example: Windows XP
With increasing technology development in field of communication and Electronic devices, there is a need for better security service for information transfer in Medical Sectors, Banking, Financial and in other IoT applications etc. Fight against security attacks is of prime importance. Through Cryptographic techniques we can provide Authenticity as well as Confidentiality for the user data. In this paper, hardware implementation has been described for a real-time application of speech data encryption and decryption using AES algorithm along with the speech recognition using cross correlation technique. Verilog programming environment is used for AES cryptography whereas MATLAB is used for Speech recognition. ASIC design on AES core is implemented using Cadence tools. Number of gates, area and power used by AES core design has been drastically reduced by specifying wide range of constraints during front end designing. In Backend designing, layout of AES design, which is the physical geometric representation is also developed.
Elgamal signature for content distribution with network codingijwmn
This document proposes a scheme that uses ElGamal signature in network coding to enhance security. Network coding allows nodes to generate output packets as linear combinations of input packets. However, this makes the network vulnerable to pollution attacks where malicious nodes can insert corrupted packets. The proposed scheme signs data packets with ElGamal signatures. When nodes receive packets, they can verify the signatures' validity to check for corrupted packets without decoding. The scheme exploits the linearity of network coding and allows nodes to easily check packet integrity. An example is provided to demonstrate how the ElGamal signature scheme would work in the context of network coding for content distribution.
V design and implementation of network security using genetic algorithmeSAT Journals
Abstract Over the last few years, Secured transmission of data has been a major issue in data communication. This project mainly concerns about the security of confidential information and data transmission using public key cryptography with Genetic Algorithm in order to provide confidentiality, authentication, integrity and non-repudiation of the messages. First, an algorithm is developed and implemented to generate a key pair (Private and public Key).A plain text is encrypted using the Public Key of receiver to produce an intermediate cipher. The intermediate cipher is again encrypted using genetic algorithm to produce final cipher. The final cipher first decrypted to produce the intermediate cipher which in turn decrypted to get the plain text using the Private key of the receiver or vice versa. Index Terms: Network Security, Genetic Algorithm
Design and implementation of network security using genetic algorithmeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Symmetric cryptography will always produce the same ciphertext if the plaintext and the given key are the same repeatedly. This condition will make it easier for cryptanalysts to perform cryptanalysis. This research introduces a one-to-many cryptography scheme, which can produce different ciphertexts even if the input given is the same repeatedly. The one-to-many encryption scheme can produce several ciphertexts with differences of up to 50%. The avalanche effect test obtained an average of 52.20%, better than modern cryptography Blowfish by 25.46% and 6% better than advanced encryption standard (AES). One-to-many can produce different n-ciphertexts, which will certainly make it more difficult for cryptanalysts to perform cryptanalysis and require n-times longer to break than other symmetric cryptography.
This document summarizes security definitions for searchable symmetric encryption (SSE) schemes. It reviews the indistinguishability and semantic security game definitions, noting that attacks have succeeded against published schemes. It then proposes a new security game definition against distribution-based query recovery attacks, to better capture practical adversary capabilities. The goal is to define security in a way that implies the current indistinguishability and semantic security definitions.
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
This document discusses public key cryptography and the RSA encryption algorithm. It provides an overview of public key cryptography, how the RSA algorithm works using a public and private key pair, and some of its applications. The RSA algorithm is based on the difficulty of factoring large prime numbers and allows for secure communication without needing to share secret keys. Some advantages are convenience and enabling message authentication and non-repudiation using digital signatures, while disadvantages include slower performance and the need to authenticate public keys.
UNIT - 2
SYMMETRIC CIPHERS: Symmetric Cipher Model, Substitution Techniques,
Transposition Techniques, Simplified DES, Data encryption standard (DES), The strength of
DES, Differential and Linear Cryptanalysis, Block Cipher Design Principles and Modes of
Operation, Evaluation Criteria for Advanced Encryption Standard, The AES Cipher.
Novel Methods of Generating Self-Invertible Matrix for Hill Cipher Algorithm.CSCJournals
The document proposes novel methods for generating self-invertible matrices for use in the Hill cipher encryption algorithm. It discusses how the Hill cipher works and the issue that the encryption matrix may not be invertible, preventing decryption. It then presents three methods for generating self-invertible matrices of sizes 2x2, 3x3, and 4x4 that can be used as the encryption key matrix in Hill cipher to allow for decryption without needing to calculate the inverse matrix.
SCHEME OF ENCRYPTION FOR BLOCK CIPHERS AND MULTI CODE GENERATION BASED ON SEC...IJNSA Journal
In this paper we propose a scheme of encryption for Block ciphers in N-alphabet, where every member of any m-block of plain text is enciphered by different permutations which are generated by the help of a secret key word. Further we extend this method to multicode encryption using the fact that encrypting each member differently is the basis of multicode encryption.
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.
Performance Evaluation of Message Security Using Fractal Sieve with MMDijsptm
In this paper we measure the performance of proposed approach, message security using Fractal Sieve with Modified Message Digest with respect to response time and time complexity. In this method the authentication of the message is protected by the hash function MMD. The response time of the algorithm is implemented in java is calculated with user load and the different sizes of the data files. The results are compared with the performance measurements of Priya Dhawan and Aamer Nadeem and found to be efficient.
Improved Caesar Cipher with Random Number Generation Technique and Multistage...ijcisjournal
Secured Communication involves Encryption process at the sending end and Decryption process at the receiving end of the communication system. Many Ciphers have been developed to provide data security . The efficiency of the Ciphers that are being used depends mainly on their throughput and memory requirement. Using of large key spaces with huge number of rounds with multiple complex operations may provide security but at the same time affects speed of operation. Hence in this paper we have proposed a method to improve Caesar cipher with random number generation technique for key generation operations. The Caesar cipher has been expanded so as to include alphabets, numbers and symbols. The original Caesar cipher was restricted only for alphabets. The key used for Caesar Substitution has been derived using a key Matrix Trace value restricted to Modulo 94. The Matrix elements are generated using recursive random number generation equation, the output of which solely depends on the value of seed selected . In this paper, we made an effort to incorporate modern cipher properties to classical cipher. The second stage of encryption has been performed using columnar transposition with arbitrary random order column selection. Thus the proposed Scheme is a hybrid version of classical and modern cipher properties. The proposed method provides appreciable Security with high throughput and occupies minimum memory space. The Method is resistant against brute-force attack with 93! Combinations of keys, for Caesar encryption.
Improved Caesar Cipher with Random Number Generation Technique and Multistage...ijcisjournal
Secured Communication involves Encryption process at the sending end and Decryption process at the receiving end of the communication system. Many Ciphers have been developed to provide data security . The efficiency of the Ciphers that are being used depends mainly on their throughput and memory requirement. Using of large key spaces with huge number of rounds with multiple complex operations may provide security but at the same time affects speed of operation. Hence in this paper we have proposed a method to improve Caesar cipher with random number generation technique for key generation operations. The Caesar cipher has been expanded so as to include alphabets, numbers and symbols. The original Caesar cipher was restricted only for alphabets. The key used for Caesar Substitution has been derived using a key Matrix Trace value restricted to Modulo 94. The Matrix elements are generated using recursive random number generation equation, the output of which solely depends on the value of seed selected . In this paper, we made an effort to incorporate modern cipher properties to classical cipher. The second stage of encryption has been performed using columnar transposition with arbitrary random order column selection. Thus the proposed Scheme is a hybrid version of classical and modern cipher properties. The proposed method provides appreciable Security with high throughput and occupies minimum memory space. The Method is resistant against brute-force attack with 93! Combinations of keys, for Caesar encryption.
1. This work applies and extends the biclique attack framework to cryptanalyze the full 8.5 round IDEA cipher.
2. A biclique is constructed by partitioning the IDEA key schedule and mapping internal states in the forward and backward directions.
3. The authors find an optimal key partitioning that breaks the 128-bit IDEA key into subsets for the biclique attack. This allows them to recover the full IDEA key using bicliques and meet-in-the-middle techniques with significantly less than the expected 2^128 operations.
New Technique Using Multiple Symmetric keys for Multilevel EncryptionIJERA Editor
In a world of accelerating communications, cryptography has become an essential component of the modern
means of communication systems. The emergence of the webas a reliable medium for commerce and
communication has made cryptography an essential component. Many algorithms or ciphers are in use
nowadays. The quality of the cipher is judged byits ability to prevent an unrelated party fromknowingthe
original content of the encrypted message. The proposed “Multilevel Encryption Model” is a cryptosystem that
adopts the basic principles of cryptography. It uses five symmetric keys (multiple)
in floating point numbers, plaintext, substitution techniques and key combinations with unintelligible
sequence to produce the ciphertext. The decryption process is also designed to reproduce the plaintext
Similar to On the Usage of Chained Codes in Cryptography (20)
Executive Directors Chat Leveraging AI for Diversity, Equity, and InclusionTechSoup
Let’s explore the intersection of technology and equity in the final session of our DEI series. Discover how AI tools, like ChatGPT, can be used to support and enhance your nonprofit's DEI initiatives. Participants will gain insights into practical AI applications and get tips for leveraging technology to advance their DEI goals.
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
বাংলাদেশের অর্থনৈতিক সমীক্ষা ২০২৪ [Bangladesh Economic Review 2024 Bangla.pdf] কম্পিউটার , ট্যাব ও স্মার্ট ফোন ভার্সন সহ সম্পূর্ণ বাংলা ই-বুক বা pdf বই " সুচিপত্র ...বুকমার্ক মেনু 🔖 ও হাইপার লিংক মেনু 📝👆 যুক্ত ..
আমাদের সবার জন্য খুব খুব গুরুত্বপূর্ণ একটি বই ..বিসিএস, ব্যাংক, ইউনিভার্সিটি ভর্তি ও যে কোন প্রতিযোগিতা মূলক পরীক্ষার জন্য এর খুব ইম্পরট্যান্ট একটি বিষয় ...তাছাড়া বাংলাদেশের সাম্প্রতিক যে কোন ডাটা বা তথ্য এই বইতে পাবেন ...
তাই একজন নাগরিক হিসাবে এই তথ্য গুলো আপনার জানা প্রয়োজন ...।
বিসিএস ও ব্যাংক এর লিখিত পরীক্ষা ...+এছাড়া মাধ্যমিক ও উচ্চমাধ্যমিকের স্টুডেন্টদের জন্য অনেক কাজে আসবে ...
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
The simplified electron and muon model, Oscillating Spacetime: The Foundation...RitikBhardwaj56
Discover the Simplified Electron and Muon Model: A New Wave-Based Approach to Understanding Particles delves into a groundbreaking theory that presents electrons and muons as rotating soliton waves within oscillating spacetime. Geared towards students, researchers, and science buffs, this book breaks down complex ideas into simple explanations. It covers topics such as electron waves, temporal dynamics, and the implications of this model on particle physics. With clear illustrations and easy-to-follow explanations, readers will gain a new outlook on the universe's fundamental nature.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
Main Java[All of the Base Concepts}.docxadhitya5119
This is part 1 of my Java Learning Journey. This Contains Custom methods, classes, constructors, packages, multithreading , try- catch block, finally block and more.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
1. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 482
Manuscript Preparation Guidelines for International Journal of
Computer Science and Security
Omessaad Hamdi ohamdi@labri.fr
LABRI Laboratory,
Bordeaux 1, France.
Ammar Bouallegue ammar.bouallegue@enit.rnu.tn
SYSCOM Laboratory,
Ecole Nationale d’ingénieurs
De Tunis, Tunisia
Sami Harari harari@univ-tln.fr
USTV,
Toulon France
Abstract
We discuss the chained randomized linear code and their use in cryptography.
We show that the adoption of randomized chained codes in the framework of
McEliece cryptosystem expose the cryptosystem to some new attacks.
Key Words: Cryptography, Chained Codes, Attack, Complexity
1. INTRODUCTION
In this paper, a new variant of cryptographic schemes based on error coding is studied. Random
based techniques allow to design large families of chained codes. Therefore, in principle, such
codes can substitute Goppa codes, originally used by McEliece [2].The McEliece cryptosystem is
a public key cryptosystem based on coding theory that has successfully resisted cryptanalysis [1]
for thirty years. The original version, based on Goppa codes, is able to guarantee a high level of
security, and is faster than computing solutions, like RSA.
Despite this, it has not been considered in practical applications, due to the major drawbacks like
the large size of the public key, the low transmission rate. Moreover, there is no efficient signature
scheme based on error coding.
Several attempts have been made for overcoming such drawbacks, but the adoption of most
families of codes has not been possible without compromising the system security [2], [8], [9].
Chained codes are a particular class, able to join low complexity decoding techniques. One idea
consists in adopting this family of codes in some signature schemes.
Recently, however, new attacks have been found that are able to exploit the flaw in the
transmission from the private key to the public one [10]. Such attack seems to be effectively
countered by changing some constituent matrices like introducing some random vectors.
This works gives an overview of the chained code and weakness related to their structure. A
recent randomized version can be considered and its ability to counter the currently known
attacks is discussed.
2. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 483
To counter this weakness, we concatenate random rows to the generator matrix. This new
structure avoids minimum codewords. However, it does not modify the dual code. Consequently,
other attacks can be generated.
The details of chained code design are given in section 2.In sections 3 and 4, a digital signature
scheme using chained code and its security are discussed. In section 5, we introduce a digital
signature using randomized chained code and before concluding we study its security.
2. CHAINED CODE
A chained code C is defined as a direct sum of γ elementary codes ),( iii knC . This code is of
length ∑=
=
γ
1i
inN and of dimension ∑=
=
γ
1i
ikK .
( ){ }γγγ
γ
CuCuuuCC i
i
∈∈=⊕=
=
,...,;,..., 111
1
To encode an information ),...,( 1 γmmm = , where im is ik bits, we simply multiply it by the
generator matrix to obtain the codeword ( )γuuGmu ,...,. 1== with iu is the in bits codeword
obtained from im using the elementary code iC . So, G is a diagonal matrix in blocs and whose
diagonal is formed by elementary generator matrices iG of the code iC .
We assume that we have an efficient decoding algorithm for each elementary code iC . To
decode ( )γuuu ,...,1= , we apply for each codeword iu its correspondent decoding
algorithm ( )iCdec . The decoded word is ( )γmmm ,...,1= with ( )iCi udecm i
= .
We define the support of a non zero word ( )nxxx ,...,1= , denoted )sup(x , as the set of its non
zero positions. { }{ }0,,..,1)sup( ≠∈= ixnix and the support of a set { }γyyS ,...,1= as the
union of the supports of its words )sup()sup( i
Sy
yS
i
U∈
= . So the support of a code ),( KNC is
the union of its
k
2 codeword supports.
Two words x and y are said to be connected if their supports are not disjoints i.e
Θ=∩ )sup()sup( yx and two sets I and J are said to be disjoints if there is no connection
subset between them.
A non zero codeword x of C is said to be minimal support if there is no codeword Cy ∈ such
that )sup()sup( xy ⊂ .
Two codes ),( KNC and ),(' KNC are said to be equivalents if there is a permutation σ of
{ }N,..,1 such as: { })()1( ,..,)(' NccCC σσσ == . In other words, C and 'C are equivalents if there
is a permutation matrix such as for any generator matrix G of C , the matrix PGG .'= is a
generator matrix of 'C .
3. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 484
3. Chained codes and Cryptography
As we mentioned in the introduction, the drawback of the unique digital signature scheme based
on error coding is the high signature complexity which is due to Goppa decoding algorithm. One
idea to counter this drawback consists in replacing Goppa code by chained code which have
faster decoding algorithm.
Generally, the secret key of a cryptographic scheme based on error coding is the code itself, for
which an efficient decoding algorithm is known, and the public key is a transformation of the
generator or parity check matrices. We consider a digital signature scheme based on chained
code, and then we develop an algorithm to discover the private key from public key. This attack is
applicable for each cryptographic scheme since it is a structural attack.
Secret key:
− S is a random )( KK × non singular matrix called the scrambling matrix.
− G is a )( NK × generator matrix of a chained code
− P is a random )( NN × permutation matrix
Public key:
− PGSG ..'= is a randomly scrambled et permuted generator matrix. It is a
generator matrix of an equivalent non structured code to the chained code ∑i
ic is
the completed correction capacities calculated as [3].
− ( )h is a hash function.
Signature:
The signer, first, calculates
1
).( −
= PMhy , where )(Mh is the N bit message,
1−
P is the
inverse of P . Then he uses the completed decoding algorithm [3] for the original chained code
C to obtain σ.Sx = . Finally, the receiver obtains the signature by computing xS .1−
=σ where
1−
S is the inverse of S .
Verification:
The verifier calculates '.' Gσρ = and )(Mh=ρ
The signature is valid if ∑<
i
icd )',( ρρ
To avoid exhaustive attack, we use at least five different elementary codes and to avoid attack by
information set, we use a chained code with length at least equal to 1500 bits.
After developing a digital signature scheme, we discovered a weakness in this scheme. This
weakness is due to the fact that chained codes have an invariant. Code equivalence means that
one generator matrix is a permutation of the other, because matrix S does not change the code
but only performs a modification on the basis of the linear subspace. Canteaut showed that the
matrix S may be important to hide the systematic structure of the Goppa codes, therefore having
an important security role [6]. However, Heiman was the first to study this point and states that
the random matrix S used in the original McEliece scheme serves no security purpose
concerning the protection [7]. We confirm this argument and we show that the random matrix S
has no security role for cryptographic schemes based on linear codes. We state also that disjoint
elementary code supports is an invariant by permutation.
4. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 485
The attack explores the characteristics of the code transformation in order to identify its building
blocks. Its input is a generating matrix 'G of a randomly permuted chained code of length N and
dimension K . Its output is a structured chained code. The algorithm’s steps are:
- Apply a Gauss elimination to the rows of the matrix 'G to obtain the systematic form
( )ZIG d ,0 = .
Sendrier shows that rows of any systematic generator matrix of a code C are minimal support
codewords of C and that any minimal support codeword of C is a row of a systematic generator
matrix of C [4]. So, the systematic chained code support is formed by disjoint sets. Each set
represents the support of an elementary code. The transformation of any randomly permuted
chained code generator matrix into a systematic matrix by linear algebraic algorithms will allow us
to find these supports and thus elementary codes.
- Search the disjoint sets of rows of the systematic matrix 0G . Each set forms the elementary
code support. Use elementary decoding algorithms to decode every message. As application of
these codes, regular LDPC codes which represent chained repetition codes. Next sections
represent the proprieties of these codes.
The complexity of this attack is less than
45
2 even with so long codes (see FIGURE 1).
4. Randomized chained linear codes
To counter the attack introduced in previous section, one idea consists in concatenating random
vectors to the generator matrix. In this section, first, we define randomized chained codes then
we introduce a cryptographic scheme based on these codes.
4.1 Random vectors
The randomized chained linear code concatenates random vectors of length N to the chained
code. Using Information Theory, a N bit random binary vector is of weight closely to 2/N and
the distance between two random vectors is of order 4/N . These approximations are more
precise when N is large.
4.2 Construction of randomized chained codes
Lets consider a chained linear code generator matrix CLG as described in section 2. Each
elementary linear code is of length in and of size ik . Chained linear code is of length
∑=
=
γ
1i
inN and of dimension ∑=
=
γ
1i
ikK .
Lets consider a matrix rG formed by K random rows of length N .
The generator matrix G of the system using randomized linear chained code has the following
form: ),( rCL GGG = .
The weight of a row of the systematic generator matrix is about ipN +2/ where ip is the
weight of i
th
row of the chained code generator matrix CLG .
4.2.1 Encoding
m is a word of length K to be encoded. The codeword is obtained by multiplying m by the
generator matrix G of the randomized chained linear code.
Gmc .=
5. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 486
4.2.2 Decoding
r is the word to be decoded.
21 .,. eGmeGmecr rCL ++=+=
Note by ( )CLdec the chained linear decoding algorithm. Thus, ).( 1eGmdecm CLCL += . The
codeword closest to r is Gmc .= .
5. DIGITAL SIGNATURE USING RANDOMIZED CHAINED LINEAR CODES
5.1 Key generation
− Generate a sequence γ linear codes. Each code is of length in and of dimension
ik .
− Build the chained linear code generator matrix CLG . This matrix is of size
∑∑ ==
=×=
γγ
11 i
i
i
i kKnN
− Generate K random vectors iv of length N . These vectors will be stored in a
matrix rG of size NK × .
The obtained code is of length N2 and size K . It has the following generator
matrix's form ),( rCL GGG =
To hide the code structure, we also generate
− A random invertible matrix S of size ( )( ) ( )( )KNNN −×− .2.2 .
− A permutation matrix P of size ( ) ( )( )NN .2.2 ×
− Determine the check parity matrix H as follows ( ) 0.. =
t
PGH
Thus, the private key is formed by
− The generator matrix G of size NK .2×
− The random matrix S of size ( )( ) ( )( )KNNN −×− .2.2 .
− The permutation matrix P of size ( ) ( )( )NN .2.2 × .
The public key is formed by the hidden and permuted parity check Matrix HSH .'
= of size
( ) ( )NKN .2.2 ×−
5.2 Signature algorithm
Let m be a message to be signed. The signer has the private key formed by G , S and P and
the hash function ( )h whose result is of length N.2 .
− Compute ( )mh='
ρ of length N.2
− Compute
1'
. −
= Pρρ .
− Divide ρ in two parts 1ρ and 2ρ , each one is of length N .
6. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 487
21 ρρρ =
− Decode 1ρ using the decoding algorithm of chained linear code to obtain
information m of length K .
− Compute Gm.=ν which is a codeword.
− Compute νρ +='
e the error related to the secret code which is closer to
2/N .This error has the same syndrome as
ρ .
− Compute the error Pee .'
= and its weight ( )ewp = . The error e has the same
syndrome as ( )mh='
ρ relatively to the public code generated by PG.
The signature of m is formed by ( )pe,=σ .
5.3 Verification Algorithm
− The verifier has the matrix H and the hash function ( )h , the message m and
the signature σ .
− he checks that ( ) pew =
− he computes ( )mh='
ρ .
− he computes eHx .'
1 =
− he computes
''
2 .ρHx =
The signature is valid if
21 xx =
5.4 Soundness
( ) 2
'''
1 ..... xPHPHeHx ==+== ρνρ since P.ν is a codeword of the permuted code
having PG. as generator matrix.
5.5 Parameters
Forging a signature consists in determining the signature ( )pe,=σ message from m or
retrieving the secret key. An attacker who has the parity check matrix of size ( ) NNK .2.2 × ,
may proceed as follows:
− he transforms
'
H a systematic matrix ( ) ( )( )KNKN
t
IRH −−= .2,.20 ,
− he guess the corresponding matrix 0G of size NK .2× :
( )RIG K ,0 =
− he computes ( ) ( )21 ,ρρρ == Mh with K=1ρ and KN −= 22ρ
− he search the closest codeword ( )21,ccc = of length N.2 to ρ .
So, he will obtain
− ( ) 0, 11 =ρCd
− ( ) ( ) 2/.2, 22 KNCd −=ρ
To build a secure algorithm, the difference k between p
7. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 488
and ( ) 2/.2 NK should be large enough. The table 1 shows parameters for a signature scheme
based on randomized chained code. From Table 1, we show that is necessary that used code
must have a length N.2 greater than 1350.
N 990 1080 1170 1260 1350 1440 1530 1520 1710 1800 1890 1980
K 253 276 299 322 345 368 391 414 437 460 483 506
K 44 48 52 56 60 64 68 72 76 80 84 88
Table 1: Signature parameters
Table 2 shows performances of randomized chained code in terms of execution complexity and
public key size.
Signature Signature with randomized code
Public key size (ko) 123
Signature complexity 220
Verification Complexity 213
Table 2: Performance of signature based on randomized chained codes
5.6 Solidity
The strength of the scheme depends on the choice of parameters. There are two types of attacks
on asymmetric systems.
The starting point was to hide the structure of the chained codes. Possible attack of the new
structure consists in enumerating all matrices of size ( ) NKN .2.2 ×− and test their
equivalences with
'
H . The code is formed by γ elementary codes and K random vectors. So,
the number of randomized chained code is
( )( ) ν
2
!
!!2//!
2
K
NN
which is very large considering
chosen parameters in section 5. The concatenation of random vectors avoid minimal codewords
attack since a codeword is at least of weight 2/N . Moreover, the new structure avoids support
disjunction since the distance between two codewords is in order of N/4.
However, this new structure hides a weakness related to the dual code. In fact, concatenated
vectors do not modify the dual code. Consequently, an attacker may proceed as follows:
− Transform
'
H in a systematic matrix ( )., .20 KN
t
IRH −=
− Search minimal codewords of elementary linear codes which have weight smaller
than those of random vectors.
− Use the algorithm introduced in section 3 to recover dual code.
8. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 489
FIGURE 1: Attack Complexity
The security of cryptographic schemes based on error coding is highly dependent on the class of
used codes. Some class of codes reveal their characteristics even when they go through the
permutation used to construct the public code. It is the case with chained codes and randomized
chained codes. The starting point was the observation that any systematic matrix of a chained
code is formed by small weight codeword and that the code contains so many minimal support
codewords. These two properties lead to a structural attack of digital signature scheme based on
chained code.
We have tried to counter this attack by concatenating some random vectors to the generator
matrix. However, the added vectors avoid this attack but they do not modify the dual code.
Consequently, we discover another structural weakness related to this kind of codes.
Figure 1 shows the complexity of the attacks of some cryptosystems using chained codes and
randomized chained code. The complexity is always less than
45
2 even with so long codes
( )3000=N . This complexity prohibits using chained code in cryptography.
6. Conclusion
In this paper, we discussed the structure of a randomly permuted chained code. We explored
potential threats from systematic generator matrices that have particular structure. Chained code
generator matrices have the properties of disconnected elementary code supports. We have tried
to hide this property by concatenating some random vectors to the generator matrix.
Unfortunately, these vectors avoid attack by minimum codeword in the code itself. However, they
do not modify the dual code which makes weakness on cryptographic scheme based on chained
codes. This property is invariant by permutation, which make this kind of code useless in
cryptography.
9. O.Hamdi, A.Bouallegue & S.Harari
International Journal of Computer Science and Security (IJCSS), Volume (3): Issue (6) 490
7. REFERENCES
1. E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg, "On the inherent intractability of
certain coding problems", IEEE Transactions on Information Theory, Vol.24, No.3,1978,
pp.384-386.
2. R.J. McEliece, "A public-key cryptosystem based on algebraic coding theory"; DSN Prog.
Rep., Jet Propulsion Laboratory, California Inst. Technol., Pasadena, CA, pp. 114-
116,January 1978.
3. D. J. Bernstein, T. Lange, and C. Peters. Attacking and defending the McEliece
cryptosystem. In Post-Quantum Cryptography, volume 5299 of Lecture Notes in Computer
Science, pages 31-46. Springer Berlin Heidelberg, 2008.
4. N. Courtois, M. Finiasz, and N. Sendrier, "How to achieve a McEliece-based digital signature
scheme", In C. Boyd, editor, Asiacrypt 2001, volume 2248 of LNCS, pages 157-174.
Springer-Verlag, 2001.
5. N.Sendrier, "On the structure of a linear code"AAECC, Vol.9, n3, 1998, pp.221-242.
6. A. Canteaut "Attaques de cryptosystemes a mots de poids faible et construction de
fonctions t-resilientes" PhD thesis, Universite Paris 6, October 1996.
7. R. Heiman "On the security of Cryptosystems Based on Linear Error Correcting codes" MSc.
Thesis, Feinberg Graduate School of the Weizmann Institute of Science. August 1987.
8. M. Baldi and F. Chiaraluce. Cryptanalysis of a new instance of McEliece cryptosystem based
on QC-LDPC codes. In Proc. IEEE International Symposium on Information Theory (ISIT
2007), pages 2591-2595, Nice, France, June 2007.
9. A. Otmani, J. P. Tillich, and L. Dallot. Cryptanalysis of two McEliece cryptosystems based on
quasi- cyclic codes. In Proc. First International Conference on Symbolic Computation and
Cryptography (SCC 2008), Beijing, China, April 2008.
10. O. Hamdi, A. Bouallegue, S.Harari, Weakness on Cryptographic Schemes based on
Chained Codes, The First International Workshop on Wireless and Mobile Networks Security
(WMNS-2009) in conjunction with NSS 2009, October 19~21 2009, Gold Coast, Australia.