In this paper, a neural genetic key based technique for encryption (NGKRMSMC) has been proposed
through recursive modulo
-
2 substitution using mutated character code generation for online wireless
communication of data/information.
Both sender and receive
r get synchronized based on their final output
.
The length of the key depends on the number of input and output neurons. Coordinated matching weight
vectors assist to generate chromosomes pool. Genetic secret key is obtained using fitness function, which i
s
the hamming distance between two chromosomes. Crossover and mutation are used to add elitism of
chromosomes.
At first
mutated character code table
based encryption strategy get perform on plain text.
.
Then the intermediate cipher text is yet again encry
pted through recursive positional modulo
-
2 substitution
technique to from next level encrypted text. This 2nd level intermediate cipher text is again encrypted to
form the final cipher text through chaining and cascaded xoring of neuro genetic key with the
identical
length intermediate cipher text block.
Receiver will perform same symmetric operation to get back the plain
text using identical key
Secured transmission through multi layer perceptron in wireless communication...ijmnct
In this paper, a multilayer perceptron guided encryption/decryption (STMLP) in wireless communication
has been proposed for exchange of data/information. Multilayer perceptron transmitting systems at both
ends generate an identical output bit and the network are trained based on the output which is used to
synchronize the network at both ends and thus forms a secret-key at end of synchronizations of the
networks. Weights or hidden units of the hidden layer help to form a secret session key. The plain text is
encrypted through chaining , cascaded xoring of multilayer perceptron generated session key. If size of the
final block of plain text is less than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing deciphering process for getting the
plain text. Parametric tests have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows comparable results for the
proposed technique. Variation numbers of input vectors and hidden layers will increase the confusion
/diffusion of the schemeand hence increase the security. As a result variable energy based techniques may
be achieved which may be applicable devices/interface of the heterogeneous sizes of the network/device.
SECURED WIRELESS COMMUNICATION THROUGH SIMULATED ANNEALING GUIDED TRAINGULARI...cscpconf
In this paper, simulated annealing guided traingularized encryption using multilayer perceptron generated session key (SATMLP) has been proposed for secured wireless ommunication. Bothsender and receiver station uses identical multilayer perceptron and depending on the final output of the both side multilayer perceptron, weights vector of hidden layer get tuned in bothends. After this tunning step both perceptrons generates identical weight vectors which is consider as an one time session key. In the 1st level of encryption process traingularized sub key1 is use to encrypt the plain text. In 2nd level of encryption simulated annealing method helps to generates sub key 2 for further encryption of 1st level generated traingularized encrypted text. Finally multilayer perceptron generated one time session key is used to perform
3rd level of encryption of 2nd level generated encrypted text. Recipient will use same identical multilayer perceptron guided session key for performing deciphering process for getting the simulated annealing guided intermediate cipher text. Then using sub key 2 deciphering technique is performed to get traingularized encrypted text. Finally sub key 1 is used to generate the plain text. In this proposed technique session key is not transmitted over public channel apart from few data transfers are needed for weight simulation process. Because after synchronization process both multilayer perceptron generates identical weight vector which acts as a session key. Parametric tests are done and results are compared in terms of ChiSquare test, response time in transmission with some existing classical techniques, which shows comparable results for the proposed system.
Secured wireless communication through simulated annealing guided traingulari...csandit
In this paper, simulated annealing guided traingularized encryption using multilayer perceptron
generated session key (SATMLP) has been proposed for secured wireless communication. Both
sender and receiver station uses identical multilayer perceptron and depending on the final
output of the both side multilayer perceptron, weights vector of hidden layer get tuned in both
ends. After this tunning step both perceptrons generates identical weight vectors which is
consider as an one time session key. In the 1st level of encryption process traingularized sub
key1 is use to encrypt the plain text. In 2nd level of encryption simulated annealing method
helps to generates sub key 2 for further encryption of 1st level generated traingularized
encrypted text. Finally multilayer perceptron generated one time session key is used to perform
3rd level of encryption of 2nd level generated encrypted text. Recipient will use same identical
multilayer perceptron guided session key for performing deciphering process for getting the
simulated annealing guided intermediate cipher text. Then using sub key 2 deciphering
technique is performed to get traingularized encrypted text. Finally sub key 1 is used to
generate the plain text. In this proposed technique session key is not transmitted over public
channel apart from few data transfers are needed for weight simulation process. Because after
synchronization process both multilayer perceptron generates identical weight vector which
acts as a session key. Parametric tests are done and results are compared in terms of Chi-
Square test, response time in transmission with some existing classical techniques, which shows
comparable results for the proposed system.
Iaetsd implementation of lsb image steganography system using edge detectionIaetsd Iaetsd
This document proposes an image steganography system that uses edge detection, LZW compression, and hybrid encryption methods. It first encrypts the secret image using AES and ECC encryption. It then compresses the encrypted image using LZW compression. Next, it detects edges in the cover image using Canny edge detection. It then embeds the compressed encrypted image into the cover image by modifying the least significant bits of edge pixels. To decode, it extracts the embedded image, decompresses it, and decrypts it using ECC and AES decryption, recovering the original secret image. Evaluation results show the proposed method provides better security compared to existing methods while maintaining high quality of the stego image.
Elliptic Curve Cryptography (ECC) provides a secure
means of key exchange between communicating nodes using the
Diffie-Hellman (DH) Key Exchange algorithm. This work
presents an ECC encryption implementation using of the DH
key exchange algorithm. Both encryption and decryption of text
messages using this algorithm, have been attempted. In ECC,
encoding is carried out by mapping a message character to an
affine point on an elliptic curve. It can be observed from the
comparison of the proposed algorithm and Koblitz’s encoding
method, that the proposed algorithm is as secure as Koblitz’s
encoding method and the proposed algorithm has less
computational complexity as the encoding phase is eliminated
altogether. Hence, energy efficiency of the crypto system is
improved and the same can be used in resource constrained
applications, such as Wireless sensor networks (WSNs). It is
almost infeasible to attempt a brute force attack. The security
strength of the algorithm is proportional to the key length.
However, any increase in the key length results in more
communication overhead due to encryption.
A new dna based approach of generating keydependentmixcolumnsIJCNCJournal
The use of key-dependent MixColumns can be regarded as one of the applied techniques for changing the
quality of a cryptographic algorithm. This article explains one approach for altering the MixColumns
transformation engaged in the AES algorithm. The approach employed methods inspired from DNA
processes and structure, which relied on the key.The parameters of the proposedMixCloumns have
characteristics identical to those of the original algorithm AES besides increasing its resistance against
attack.The original transformation uses single static MDS matrix while the proposed methods used
dynamic MDS. The security of the new MixColumns was analyzed, and the NIST Test Suite tests were used
to test the randomness for the block cipher that used the new transformation.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...IJNSA Journal
In this technical paper a session based symmetric key cryptographic technique, termed as SBSKCT, has been proposed. This proposed technique is very secure and suitable for encryption of large files of any type. SBSKCT considers the plain text as a string with finite no. of binary bits. This input binary string is broken down into blocks of various sizes (of 2k
order where k = 3, 4, 5, ….). The encrypted binary string
is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string cipher text is formed. Combination of values of block length, no. of blocks and no. of iterations generates the session based key for SBSKCT. For decryption the cipher text is considered as
binary string. Using the session key information, this binary string is broken down into blocks. The decrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string plain text is reformed. A comparison of SBSKCT with existing and industrially accepted TDES and AES has been done.
Secured transmission through multi layer perceptron in wireless communication...ijmnct
In this paper, a multilayer perceptron guided encryption/decryption (STMLP) in wireless communication
has been proposed for exchange of data/information. Multilayer perceptron transmitting systems at both
ends generate an identical output bit and the network are trained based on the output which is used to
synchronize the network at both ends and thus forms a secret-key at end of synchronizations of the
networks. Weights or hidden units of the hidden layer help to form a secret session key. The plain text is
encrypted through chaining , cascaded xoring of multilayer perceptron generated session key. If size of the
final block of plain text is less than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing deciphering process for getting the
plain text. Parametric tests have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows comparable results for the
proposed technique. Variation numbers of input vectors and hidden layers will increase the confusion
/diffusion of the schemeand hence increase the security. As a result variable energy based techniques may
be achieved which may be applicable devices/interface of the heterogeneous sizes of the network/device.
SECURED WIRELESS COMMUNICATION THROUGH SIMULATED ANNEALING GUIDED TRAINGULARI...cscpconf
In this paper, simulated annealing guided traingularized encryption using multilayer perceptron generated session key (SATMLP) has been proposed for secured wireless ommunication. Bothsender and receiver station uses identical multilayer perceptron and depending on the final output of the both side multilayer perceptron, weights vector of hidden layer get tuned in bothends. After this tunning step both perceptrons generates identical weight vectors which is consider as an one time session key. In the 1st level of encryption process traingularized sub key1 is use to encrypt the plain text. In 2nd level of encryption simulated annealing method helps to generates sub key 2 for further encryption of 1st level generated traingularized encrypted text. Finally multilayer perceptron generated one time session key is used to perform
3rd level of encryption of 2nd level generated encrypted text. Recipient will use same identical multilayer perceptron guided session key for performing deciphering process for getting the simulated annealing guided intermediate cipher text. Then using sub key 2 deciphering technique is performed to get traingularized encrypted text. Finally sub key 1 is used to generate the plain text. In this proposed technique session key is not transmitted over public channel apart from few data transfers are needed for weight simulation process. Because after synchronization process both multilayer perceptron generates identical weight vector which acts as a session key. Parametric tests are done and results are compared in terms of ChiSquare test, response time in transmission with some existing classical techniques, which shows comparable results for the proposed system.
Secured wireless communication through simulated annealing guided traingulari...csandit
In this paper, simulated annealing guided traingularized encryption using multilayer perceptron
generated session key (SATMLP) has been proposed for secured wireless communication. Both
sender and receiver station uses identical multilayer perceptron and depending on the final
output of the both side multilayer perceptron, weights vector of hidden layer get tuned in both
ends. After this tunning step both perceptrons generates identical weight vectors which is
consider as an one time session key. In the 1st level of encryption process traingularized sub
key1 is use to encrypt the plain text. In 2nd level of encryption simulated annealing method
helps to generates sub key 2 for further encryption of 1st level generated traingularized
encrypted text. Finally multilayer perceptron generated one time session key is used to perform
3rd level of encryption of 2nd level generated encrypted text. Recipient will use same identical
multilayer perceptron guided session key for performing deciphering process for getting the
simulated annealing guided intermediate cipher text. Then using sub key 2 deciphering
technique is performed to get traingularized encrypted text. Finally sub key 1 is used to
generate the plain text. In this proposed technique session key is not transmitted over public
channel apart from few data transfers are needed for weight simulation process. Because after
synchronization process both multilayer perceptron generates identical weight vector which
acts as a session key. Parametric tests are done and results are compared in terms of Chi-
Square test, response time in transmission with some existing classical techniques, which shows
comparable results for the proposed system.
Iaetsd implementation of lsb image steganography system using edge detectionIaetsd Iaetsd
This document proposes an image steganography system that uses edge detection, LZW compression, and hybrid encryption methods. It first encrypts the secret image using AES and ECC encryption. It then compresses the encrypted image using LZW compression. Next, it detects edges in the cover image using Canny edge detection. It then embeds the compressed encrypted image into the cover image by modifying the least significant bits of edge pixels. To decode, it extracts the embedded image, decompresses it, and decrypts it using ECC and AES decryption, recovering the original secret image. Evaluation results show the proposed method provides better security compared to existing methods while maintaining high quality of the stego image.
Elliptic Curve Cryptography (ECC) provides a secure
means of key exchange between communicating nodes using the
Diffie-Hellman (DH) Key Exchange algorithm. This work
presents an ECC encryption implementation using of the DH
key exchange algorithm. Both encryption and decryption of text
messages using this algorithm, have been attempted. In ECC,
encoding is carried out by mapping a message character to an
affine point on an elliptic curve. It can be observed from the
comparison of the proposed algorithm and Koblitz’s encoding
method, that the proposed algorithm is as secure as Koblitz’s
encoding method and the proposed algorithm has less
computational complexity as the encoding phase is eliminated
altogether. Hence, energy efficiency of the crypto system is
improved and the same can be used in resource constrained
applications, such as Wireless sensor networks (WSNs). It is
almost infeasible to attempt a brute force attack. The security
strength of the algorithm is proportional to the key length.
However, any increase in the key length results in more
communication overhead due to encryption.
A new dna based approach of generating keydependentmixcolumnsIJCNCJournal
The use of key-dependent MixColumns can be regarded as one of the applied techniques for changing the
quality of a cryptographic algorithm. This article explains one approach for altering the MixColumns
transformation engaged in the AES algorithm. The approach employed methods inspired from DNA
processes and structure, which relied on the key.The parameters of the proposedMixCloumns have
characteristics identical to those of the original algorithm AES besides increasing its resistance against
attack.The original transformation uses single static MDS matrix while the proposed methods used
dynamic MDS. The security of the new MixColumns was analyzed, and the NIST Test Suite tests were used
to test the randomness for the block cipher that used the new transformation.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A Universal Session Based Bit Level Symmetric Key Cryptographic Technique to ...IJNSA Journal
In this technical paper a session based symmetric key cryptographic technique, termed as SBSKCT, has been proposed. This proposed technique is very secure and suitable for encryption of large files of any type. SBSKCT considers the plain text as a string with finite no. of binary bits. This input binary string is broken down into blocks of various sizes (of 2k
order where k = 3, 4, 5, ….). The encrypted binary string
is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string cipher text is formed. Combination of values of block length, no. of blocks and no. of iterations generates the session based key for SBSKCT. For decryption the cipher text is considered as
binary string. Using the session key information, this binary string is broken down into blocks. The decrypted binary string is formed by shifting the bit position of each block by a certain values for a certain number of times and from this string plain text is reformed. A comparison of SBSKCT with existing and industrially accepted TDES and AES has been done.
Aes cryptography algorithm based on intelligent blum blum-shub prn gs publica...zaidinvisible
This document summarizes a study that proposes enhancing the Advanced Encryption Standard (AES) algorithm by using an intelligent Blum-Blum-Shub (BBS) pseudo-random number generator to generate the initial encryption key. The AES algorithm is described along with its standard steps of sub-bytes, shift rows, mix columns, and add round key. Issues with the security of AES's public key are discussed. The study then introduces BBS and Iterated Local Search (ILS) metaheuristics and describes how combining them can generate strong cryptographic keys. An example is provided to demonstrate encrypting a message with the enhanced AES approach using an intelligent BBS-generated key. The study concludes the method increases encryption efficiency and
Improvement of Search Algorithm for Integral Distinguisher in Subblock-Based ...ijcisjournal
Integral distinguisher is the main factor of integral attack. Conventionally, higher order integral distinguisher is obtained as an extension of first order integral (conventional algorithm). The algorithm was applied to many subblock-based block ciphers, however, the conventional algorithm has some problems. We find other integral distinguisher of two sub block-based block ciphers, TWINE and LBlock, which are different from the conventional evaluations. As a solution, we propose a new algorithm to search for higher order integral distinguisher. The point of a proposal algorithm is exploitation of bijective and injective components of cipher functions. Applying the proposal algorithm to TWINE and LBlock, we confirm the results of the proposal algorithm are consistent with the results which are calculated from computer experiment. The results are the optimal distinguisher and the most advantageous one for the attackers. Our proposal algorithm contributes to development of stronger block ciphers by obtaining such integral distinguisher.
This document summarizes a research paper on a Probabilistic Data Encryption Scheme (PDES). The paper presents a probabilistic encryption scheme that combines the security of Goldwasser and Micali's probabilistic encryption with the efficiency of deterministic schemes. The scheme is based on the assumption that solving the quadratic residuacity problem is computationally infeasible without knowing the factorization of the composite integer. An example is provided to illustrate how the encryption and decryption algorithms work using quadratic residues modulo a composite integer. The paper concludes that the scheme provides semantic security similar to Goldwasser-Micali under the assumption that the quadratic residuacity problem is hard.
A new dna based approach of generating key dependent shift rows transformationIJNSA Journal
The use of key-dependent shiftRows can be considered as one of the applied methods for altering the quality of a cryptographic algorithm. This article describes one approach for changing the ShiftRows transformation employed in the algorithm AES. The approach employs methods inspired from DNA processes and structure which depended on the key while the parameters of the created new ShiftRows have characteristics identical to those of the original algorithm AES in addition to increase its resistance against attacks. The proposed new ShiftRows were tested for coefficient correlation for dynamic and static independence between the input and output. The NIST Test Suite tests were used to test the randomness for the block cipher that used the new transformation
DESIGN AND IMPLEMENTATION OF BINARY NEURAL NETWORK LEARNING WITH FUZZY CLUSTE...cscpconf
In this paper, Design and Implementation of Binary Neural Network Learning with Fuzzy
Clustering (DIBNNFC), is proposed to classify semisupervised data, it is based on the
concept of binary neural network and geometrical expansion. Parameters are updated
according to the geometrical location of the training samples in the input space, and each
sample in the training set is learned only once. It’s a semisupervised based approach, the
training samples are semi-labelled i.e. for some samples, labels are known and for some
samples data labels are not known. The method starts with classification, which is done by
using the concept of ETL algorithm. In classification process various classes are formed.
These classes classify samples in to two classes after that considers each class as a region and calculates the average of the entire region separately. This average is centres of the region which is used for the purpose of clustering by using FCM algorithm. Once clustering process over labelling of semi supervised data is done, then whole samples would be classify by (DIBNNFC). The method proposes here is exhaustively tested with different benchmark datasets and it is found that, on increasing value of training parameters number of hidden neurons and training time both are getting decrease. The result reported, using real character recognition data set and result will compare with existing semi-supervised classifier, the proposed approach learned with semi-supervised leads to higher classification accuracy.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A hybrid genetic algorithm and chaotic function model for image encryptionsadique_ghitm
The document proposes a hybrid genetic algorithm and chaotic function model for image encryption. It uses a genetic algorithm to optimize encrypted images initially constructed using a plain image and chaotic function. The initial population consists of encrypted images. The genetic algorithm then optimizes these images in iterations to produce an encrypted image with the highest entropy and lowest correlation between adjacent pixels. Experimental results found this approach improved encryption compared to other methods by increasing randomness and decreasing correlation between pixels.
Applying Deep Learning Machine Translation to Language ServicesYannis Flet-Berliac
Recurrent neural networks (RNNs) have been performing well for learning tasks for several decades now. The most useful benefit they present for this paper is their ability to use contextual information when mapping between input and output sequences.
A deep neural network for machine translation implies the use of a sequence-to-sequence model, consisting of two RNNs: an encoder that processes the input and a decoder that generates the output.
To meaningfully assess the model’s performances, texts from a translation company and thoughts from skilled experts about specialized topics will be tested.
1. Digital signatures provide authentication of digital documents by using asymmetric cryptography techniques. A digital signature is generated using a private key and can be verified by anyone using the corresponding public key.
2. There are various types of attacks against digital signature schemes like key-only attacks, generic chosen message attacks, and adaptive chosen message attacks. The security goals are to prevent total key breaks or the ability to forge signatures selectively or existentially.
3. A secure digital signature scheme must produce signatures that depend on the message, use secret information to prevent forgery and denial, be efficient to generate and verify, and make forgery computationally infeasible. Timestamps can be included to require message freshness.
An Efficient Interpolation-Based Chase BCH Decoderijsrd.com
This document describes an efficient interpolation-based Chase decoder for Bose-Chaudhuri-Hocquenghem (BCH) codes. BCH codes are error-correcting codes commonly used in applications such as flash memory and digital video broadcasting. The proposed Chase decoder uses an interpolation-based approach inspired by Chase decoders for Reed-Solomon codes but modified to leverage the binary properties of BCH codes. This allows it to correct up to t + η errors, where t is the number of errors the underlying BCH code can correct and η is the number of bits flipped in the Chase algorithm. The decoder consists of syndrome calculation, key equation solving, error location via Chien search, and error correction
Digital Watermarking through Embedding of Encrypted and Arithmetically Compre...IJNSA Journal
In this paper, we have encrypted a text to an array of data bits through arithmetic coding technique. For this, we have assigned a unique range for both, a number of characters and groups using those. Using unique range we may assign range only 10 characters. If we want to encrypt a large number of characters, then every character has to assign a range with their group range of hundred, thousand and so on. Long textual message which have to encrypt, is subdivided into a number of groups with few characters. Then the group of characters is encrypted into floating point numbers concurrently to their group range by using arithmetic coding, where they are automatically compressed. Depending on key, the data bits from text are placed to some suitable nonlinear pixel and bit positions about the image. In the proposed technique, the key length and the number of characters for any encryption process is both variable
3 mathematical priliminaries DATA compressionShubham Jain
The document discusses different methods of data compression by modeling redundancy in data. It provides three examples: (1) exploiting a linear pattern in data points to compress to 2 bits per sample instead of 5 bits; (2) assigning shorter codes to more frequent symbols in a sequence to compress to 2.58 bits per symbol from 3 bits; and (3) using entropy coding which assigns codes based on symbol probabilities to maximize compression. The goal is to remove redundancy while preserving information content.
A New Classifier Based onRecurrent Neural Network Using Multiple Binary-Outpu...iosrjce
This document proposes a new classifier based on recurrent neural networks using multiple binary-output networks. Instead of one large network with many outputs, it uses multiple simple recurrent neural networks, each trained on a single class and outputting a binary true/false prediction. A decision layer is added to each network to determine the final classification from the sequence of outputs. The method is tested on a database of 17,000 handwritten Iranian city names, achieving a top-1 classification rate of 83.9% and average reliability of 72.3%. Experimental results show the effectiveness of using multiple smaller networks over a single large network for classification.
ALGEBRAIC DEGREE ESTIMATION OF BLOCK CIPHERS USING RANDOMIZED ALGORITHM; UPPE...ijcisjournal
Integral attack is a powerful method to recover the secret key of block cipher by exploiting a characteristic that a set of outputs after several rounds encryption has ( integral distinguisher). Recently, Todo proposed a new algorithm to construct integral distinguisher with division property. However, the existence of integral distinguisher which holds in additional rounds can not be denied by the algorithm. On the contrary, we take an approach to obtain the number of rounds which integral distinguisher does not hold ( upper-bound integral distinguisher). The approach is based on algebraic degree estimation. We execute a random search for a term which has a degree equals the number of all inputted variables. We propose an algorithm and apply it to PRESENT and RECTANGLE. Then, we confirm that there exists no 8-round integral distinguisher in PRESENT and no 9-round integral distinguisher in RECTANGLE. From the facts, integral attack for more than 11-round and 13-round of PRESENT and RECTANGLE is infeasible, respectively.
NEW SYMMETRIC ENCRYPTION SYSTEM BASED ON EVOLUTIONARY ALGORITHMijcsit
In this article, we present a new symmetric encryption system which is a combination of our ciphering evolutionary system SEC [1] and a new ciphering method called “fragmentation”. This latter allows the alteration of the appearance frequencies of characters from a given text. Our system has at its disposed two keys, the first one is generated by the evolutionary algorithm, the second one is generated after “fragmentation” part. Both of them are symmetric, session keys and strengthening the security of our
system.
New binary memristor crossbar architecture based neural networks for speech r...inventionjournals
In this paper, we propose a new binary memristor crossbar architecture based neural networks for speech recognition. The circuit can recognize five vowels. The proposed crossbar is tested by 1,000 speech samples and recognized 94% of the tested samples. We use Monte Carlo simulation to estimate recognitition rate. The percentage variation in memristance is increased from 0% to 15%, the recognition rate is degraded from 94% to 82%.
Lecture Notes: EEEC6440315 Communication Systems - Information TheoryAIMST University
- The document discusses Shannon's limit for information capacity in communication systems. It states that Shannon's limit relates the information capacity of a communications channel to bandwidth and signal-to-noise ratio.
- It then provides an example calculation of applying Shannon's limit formula to find the information capacity for a standard voice-band communications channel with a given bandwidth and signal-to-noise power ratio.
- The document also discusses linear block codes, including definitions of generator and parity check matrices that can characterize linear block codes. It provides an example of encoding a message using a generator matrix for a systematic linear block code.
Stegnography of high embedding efficiency by using an extended matrix encodin...eSAT Publishing House
This document summarizes an extended matrix encoding algorithm for steganography proposed in a research paper. The algorithm aims to improve the embedding efficiency and rate of the classic F5 steganography system. It does this by extending the hash function used in matrix encoding to multiple layers, allowing more secret bits to be embedded into each carrier cell while still only modifying one bit. The encoding is represented by a quad (dmax, n, k, L) where L indicates the maximum extension layer. Secret bits are tested against specific extended codes up to layer L, and if they match, additional bits can be embedded into the carrier cell. Experimental results showed the extended algorithm performs better than the classic F5 system.
This case study outlines a 5 step process for designing an integrated service for accessing artistic heritage: 1) Strategic design including benchmarking other services, 2) User research through surveys, observations and analysis, 3) Design of user personas, journeys and storyboards, 4) Development of prototypes, 5) Testing of prototypes.
TeachMeetNZ - Engage students and make a difference - 8 June 20131MvdS
Teachers can engage students and make a difference by incorporating interactive activities into their lessons that encourage collaboration and problem-solving, getting to know each student individually to understand their needs and interests, and serving as a role model and source of encouragement for students.
Aes cryptography algorithm based on intelligent blum blum-shub prn gs publica...zaidinvisible
This document summarizes a study that proposes enhancing the Advanced Encryption Standard (AES) algorithm by using an intelligent Blum-Blum-Shub (BBS) pseudo-random number generator to generate the initial encryption key. The AES algorithm is described along with its standard steps of sub-bytes, shift rows, mix columns, and add round key. Issues with the security of AES's public key are discussed. The study then introduces BBS and Iterated Local Search (ILS) metaheuristics and describes how combining them can generate strong cryptographic keys. An example is provided to demonstrate encrypting a message with the enhanced AES approach using an intelligent BBS-generated key. The study concludes the method increases encryption efficiency and
Improvement of Search Algorithm for Integral Distinguisher in Subblock-Based ...ijcisjournal
Integral distinguisher is the main factor of integral attack. Conventionally, higher order integral distinguisher is obtained as an extension of first order integral (conventional algorithm). The algorithm was applied to many subblock-based block ciphers, however, the conventional algorithm has some problems. We find other integral distinguisher of two sub block-based block ciphers, TWINE and LBlock, which are different from the conventional evaluations. As a solution, we propose a new algorithm to search for higher order integral distinguisher. The point of a proposal algorithm is exploitation of bijective and injective components of cipher functions. Applying the proposal algorithm to TWINE and LBlock, we confirm the results of the proposal algorithm are consistent with the results which are calculated from computer experiment. The results are the optimal distinguisher and the most advantageous one for the attackers. Our proposal algorithm contributes to development of stronger block ciphers by obtaining such integral distinguisher.
This document summarizes a research paper on a Probabilistic Data Encryption Scheme (PDES). The paper presents a probabilistic encryption scheme that combines the security of Goldwasser and Micali's probabilistic encryption with the efficiency of deterministic schemes. The scheme is based on the assumption that solving the quadratic residuacity problem is computationally infeasible without knowing the factorization of the composite integer. An example is provided to illustrate how the encryption and decryption algorithms work using quadratic residues modulo a composite integer. The paper concludes that the scheme provides semantic security similar to Goldwasser-Micali under the assumption that the quadratic residuacity problem is hard.
A new dna based approach of generating key dependent shift rows transformationIJNSA Journal
The use of key-dependent shiftRows can be considered as one of the applied methods for altering the quality of a cryptographic algorithm. This article describes one approach for changing the ShiftRows transformation employed in the algorithm AES. The approach employs methods inspired from DNA processes and structure which depended on the key while the parameters of the created new ShiftRows have characteristics identical to those of the original algorithm AES in addition to increase its resistance against attacks. The proposed new ShiftRows were tested for coefficient correlation for dynamic and static independence between the input and output. The NIST Test Suite tests were used to test the randomness for the block cipher that used the new transformation
DESIGN AND IMPLEMENTATION OF BINARY NEURAL NETWORK LEARNING WITH FUZZY CLUSTE...cscpconf
In this paper, Design and Implementation of Binary Neural Network Learning with Fuzzy
Clustering (DIBNNFC), is proposed to classify semisupervised data, it is based on the
concept of binary neural network and geometrical expansion. Parameters are updated
according to the geometrical location of the training samples in the input space, and each
sample in the training set is learned only once. It’s a semisupervised based approach, the
training samples are semi-labelled i.e. for some samples, labels are known and for some
samples data labels are not known. The method starts with classification, which is done by
using the concept of ETL algorithm. In classification process various classes are formed.
These classes classify samples in to two classes after that considers each class as a region and calculates the average of the entire region separately. This average is centres of the region which is used for the purpose of clustering by using FCM algorithm. Once clustering process over labelling of semi supervised data is done, then whole samples would be classify by (DIBNNFC). The method proposes here is exhaustively tested with different benchmark datasets and it is found that, on increasing value of training parameters number of hidden neurons and training time both are getting decrease. The result reported, using real character recognition data set and result will compare with existing semi-supervised classifier, the proposed approach learned with semi-supervised leads to higher classification accuracy.
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
A hybrid genetic algorithm and chaotic function model for image encryptionsadique_ghitm
The document proposes a hybrid genetic algorithm and chaotic function model for image encryption. It uses a genetic algorithm to optimize encrypted images initially constructed using a plain image and chaotic function. The initial population consists of encrypted images. The genetic algorithm then optimizes these images in iterations to produce an encrypted image with the highest entropy and lowest correlation between adjacent pixels. Experimental results found this approach improved encryption compared to other methods by increasing randomness and decreasing correlation between pixels.
Applying Deep Learning Machine Translation to Language ServicesYannis Flet-Berliac
Recurrent neural networks (RNNs) have been performing well for learning tasks for several decades now. The most useful benefit they present for this paper is their ability to use contextual information when mapping between input and output sequences.
A deep neural network for machine translation implies the use of a sequence-to-sequence model, consisting of two RNNs: an encoder that processes the input and a decoder that generates the output.
To meaningfully assess the model’s performances, texts from a translation company and thoughts from skilled experts about specialized topics will be tested.
1. Digital signatures provide authentication of digital documents by using asymmetric cryptography techniques. A digital signature is generated using a private key and can be verified by anyone using the corresponding public key.
2. There are various types of attacks against digital signature schemes like key-only attacks, generic chosen message attacks, and adaptive chosen message attacks. The security goals are to prevent total key breaks or the ability to forge signatures selectively or existentially.
3. A secure digital signature scheme must produce signatures that depend on the message, use secret information to prevent forgery and denial, be efficient to generate and verify, and make forgery computationally infeasible. Timestamps can be included to require message freshness.
An Efficient Interpolation-Based Chase BCH Decoderijsrd.com
This document describes an efficient interpolation-based Chase decoder for Bose-Chaudhuri-Hocquenghem (BCH) codes. BCH codes are error-correcting codes commonly used in applications such as flash memory and digital video broadcasting. The proposed Chase decoder uses an interpolation-based approach inspired by Chase decoders for Reed-Solomon codes but modified to leverage the binary properties of BCH codes. This allows it to correct up to t + η errors, where t is the number of errors the underlying BCH code can correct and η is the number of bits flipped in the Chase algorithm. The decoder consists of syndrome calculation, key equation solving, error location via Chien search, and error correction
Digital Watermarking through Embedding of Encrypted and Arithmetically Compre...IJNSA Journal
In this paper, we have encrypted a text to an array of data bits through arithmetic coding technique. For this, we have assigned a unique range for both, a number of characters and groups using those. Using unique range we may assign range only 10 characters. If we want to encrypt a large number of characters, then every character has to assign a range with their group range of hundred, thousand and so on. Long textual message which have to encrypt, is subdivided into a number of groups with few characters. Then the group of characters is encrypted into floating point numbers concurrently to their group range by using arithmetic coding, where they are automatically compressed. Depending on key, the data bits from text are placed to some suitable nonlinear pixel and bit positions about the image. In the proposed technique, the key length and the number of characters for any encryption process is both variable
3 mathematical priliminaries DATA compressionShubham Jain
The document discusses different methods of data compression by modeling redundancy in data. It provides three examples: (1) exploiting a linear pattern in data points to compress to 2 bits per sample instead of 5 bits; (2) assigning shorter codes to more frequent symbols in a sequence to compress to 2.58 bits per symbol from 3 bits; and (3) using entropy coding which assigns codes based on symbol probabilities to maximize compression. The goal is to remove redundancy while preserving information content.
A New Classifier Based onRecurrent Neural Network Using Multiple Binary-Outpu...iosrjce
This document proposes a new classifier based on recurrent neural networks using multiple binary-output networks. Instead of one large network with many outputs, it uses multiple simple recurrent neural networks, each trained on a single class and outputting a binary true/false prediction. A decision layer is added to each network to determine the final classification from the sequence of outputs. The method is tested on a database of 17,000 handwritten Iranian city names, achieving a top-1 classification rate of 83.9% and average reliability of 72.3%. Experimental results show the effectiveness of using multiple smaller networks over a single large network for classification.
ALGEBRAIC DEGREE ESTIMATION OF BLOCK CIPHERS USING RANDOMIZED ALGORITHM; UPPE...ijcisjournal
Integral attack is a powerful method to recover the secret key of block cipher by exploiting a characteristic that a set of outputs after several rounds encryption has ( integral distinguisher). Recently, Todo proposed a new algorithm to construct integral distinguisher with division property. However, the existence of integral distinguisher which holds in additional rounds can not be denied by the algorithm. On the contrary, we take an approach to obtain the number of rounds which integral distinguisher does not hold ( upper-bound integral distinguisher). The approach is based on algebraic degree estimation. We execute a random search for a term which has a degree equals the number of all inputted variables. We propose an algorithm and apply it to PRESENT and RECTANGLE. Then, we confirm that there exists no 8-round integral distinguisher in PRESENT and no 9-round integral distinguisher in RECTANGLE. From the facts, integral attack for more than 11-round and 13-round of PRESENT and RECTANGLE is infeasible, respectively.
NEW SYMMETRIC ENCRYPTION SYSTEM BASED ON EVOLUTIONARY ALGORITHMijcsit
In this article, we present a new symmetric encryption system which is a combination of our ciphering evolutionary system SEC [1] and a new ciphering method called “fragmentation”. This latter allows the alteration of the appearance frequencies of characters from a given text. Our system has at its disposed two keys, the first one is generated by the evolutionary algorithm, the second one is generated after “fragmentation” part. Both of them are symmetric, session keys and strengthening the security of our
system.
New binary memristor crossbar architecture based neural networks for speech r...inventionjournals
In this paper, we propose a new binary memristor crossbar architecture based neural networks for speech recognition. The circuit can recognize five vowels. The proposed crossbar is tested by 1,000 speech samples and recognized 94% of the tested samples. We use Monte Carlo simulation to estimate recognitition rate. The percentage variation in memristance is increased from 0% to 15%, the recognition rate is degraded from 94% to 82%.
Lecture Notes: EEEC6440315 Communication Systems - Information TheoryAIMST University
- The document discusses Shannon's limit for information capacity in communication systems. It states that Shannon's limit relates the information capacity of a communications channel to bandwidth and signal-to-noise ratio.
- It then provides an example calculation of applying Shannon's limit formula to find the information capacity for a standard voice-band communications channel with a given bandwidth and signal-to-noise power ratio.
- The document also discusses linear block codes, including definitions of generator and parity check matrices that can characterize linear block codes. It provides an example of encoding a message using a generator matrix for a systematic linear block code.
Stegnography of high embedding efficiency by using an extended matrix encodin...eSAT Publishing House
This document summarizes an extended matrix encoding algorithm for steganography proposed in a research paper. The algorithm aims to improve the embedding efficiency and rate of the classic F5 steganography system. It does this by extending the hash function used in matrix encoding to multiple layers, allowing more secret bits to be embedded into each carrier cell while still only modifying one bit. The encoding is represented by a quad (dmax, n, k, L) where L indicates the maximum extension layer. Secret bits are tested against specific extended codes up to layer L, and if they match, additional bits can be embedded into the carrier cell. Experimental results showed the extended algorithm performs better than the classic F5 system.
This case study outlines a 5 step process for designing an integrated service for accessing artistic heritage: 1) Strategic design including benchmarking other services, 2) User research through surveys, observations and analysis, 3) Design of user personas, journeys and storyboards, 4) Development of prototypes, 5) Testing of prototypes.
TeachMeetNZ - Engage students and make a difference - 8 June 20131MvdS
Teachers can engage students and make a difference by incorporating interactive activities into their lessons that encourage collaboration and problem-solving, getting to know each student individually to understand their needs and interests, and serving as a role model and source of encouragement for students.
This document discusses the oral health of psychiatric patients. It notes that psychiatric patients are likely to report dental problems and lack preventive dental care due to the unavailability of dental personnel and lack of full-time dental facilities in hospitals. The document presents results from a study using a 18 question instrument to assess nurses' knowledge of patients' oral health, which had an 89.5% response rate. It concludes that training nurses on oral care delivery and attaching dentists to hospitals is important for comprehensively caring for the oral health of psychiatric patients.
Education from a (relatively) mature perspectivekathyscott25
This document discusses education from the perspective of an older student. It is written by Kathy Scott, who provides her email and Twitter handle for contact. In a few short sentences, the document establishes the viewpoint and credentials of the author on the topic of education from relative maturity.
Unidad 2 Introducción al diseño de los lenguajes de programacionLilia Velasco
El documento discute los principios de diseño de lenguajes de programación. Menciona que un lenguaje de modelado es necesario para capturar la semántica del modelo al que se ajusta el lenguaje de programación. También discute factores como la portabilidad, verificabilidad, integridad y facilidad de uso que deben considerarse al diseñar un lenguaje.
Diseño y construcción de una máquina serigráfica automatizadaRaúl Cordova
Diseño y construcción de una máquina serigráfica automatizada realizada con microcontrolador MEGA 2560, processing. Por accionamiento electro neumático. Motor paso a paso y sensores de posicionamiento (encoder, sensor infrarrojo).
Blogging can benefit students by allowing them to learn as they write for an audience and engage with others. Effective blogging integration in the classroom requires considering the audience, available tools for students, and ways the teacher can support choosing the right tools for individual learning. Examples of blogging in the class can help demonstrate how it connects to the curriculum.
The document discusses the results of a study on the effects of a new drug on memory and cognitive function in older adults. The double-blind study involved 100 participants aged 65-80 who were given either the drug or a placebo daily for 6 months. Researchers found that those who received the drug performed significantly better on memory and problem-solving tests at the end of the study compared to those who received the placebo.
This document reviews the clinical application and performance of pit and fissure sealants. It finds that placement of resin-based sealants on children's and adolescents' permanent molars is effective for caries reduction, with reductions ranging from 58.6% to 86% over 1 to 4 years. Sealants are also effective in reducing caries when reapplied and remain retained on primary molars at rates of 70.6% to 96.3% over 1 to 2.8 years. The use of sealants is associated with reductions in subsequent restorative dental services.
Vipul Vyas is seeking a position in human resources and administration where he can utilize his skills and continue growing professionally. He has over 3 years of experience in recruitment and human resources. He is proficient in tasks like recruitment, training, payroll administration, and ensuring compliance with labor laws. Vipul holds an MBA in HR and has undergone training in areas like recruitment, performance management, and developing HR policies.
Las maestras del jardín de niños #693 usarán videoconferencia para compartir experiencias pedagógicas y solucionar problemas. También usarán esta herramienta para recibir avisos sindicales de la zona 46 y coordinar un calendario de actividades cívicas y festivas entre todas las maestras.
The document discusses the benefits of exercise for mental health. Regular physical activity can help reduce anxiety and depression and improve mood and cognitive functioning. Exercise causes chemical changes in the brain that may help protect against mental illness and improve symptoms.
This study examined the effects of applying a 40% chlorhexidine varnish on dental plaque. 40 volunteers participated in a clinical trial where their plaque levels, gingival bleeding, and bacterial colony counts were measured after applying the varnish or not applying anything. The results showed that applying the chlorhexidine varnish significantly decreased plaque levels and gingival bleeding in volunteers with poor oral hygiene. It also reduced the frequency of high bacterial colony counts. The varnish was most effective at reducing plaque for patients with high baseline plaque levels. Regular application of chlorhexidine varnish can be an effective way to reduce caries risk for patients with poor oral hygiene.
The document discusses the history and evolution of the English language from its origins as Anglo-Frisian dialects brought to Britain by Anglo-Saxon settlers in the 5th century AD. It details how Old English emerged as the dominant language by the 7th century and later transformed into Middle English after the Norman conquest of 1066, absorbing elements from Old Norse and Norman French. The modern English language began emerging in the 15th century.
Curiosity's science objectives are to explore the habitability of Mars by studying the geology, environment, and potential for past life. It landed in Gale Crater, which preserves a record of diverse sedimentary environments and contains Mount Sharp. Analysis of rocks and sand at Yellowknife Bay found evidence of a ancient habitable environment with sustained water interaction and minerals that could have supported microbial life. Curiosity will continue exploring Mount Sharp to understand the planet's climate history recorded in its layers.
Multilayer Perceptron Guided Key Generation through Mutation with Recursive R...pijans
In this paper, a multilayer perceptron guided key generation for encryption/decryption (MLPKG) has been
proposed through recursive replacement using mutated character code generation for wireless
communication of data/information. Multilayer perceptron transmitting systems at both ends accept an
identical input vector, generate an output bit and the network are trained based on the output bit which is
used to form a protected variable length secret-key. For each session, different hidden layer of multilayer
neural network is selected randomly and weights or hidden units of this selected hidden layer help to form
a secret session key. The plain text is encrypted using mutated character code table. Intermediate cipher
text is yet again encrypted through recursive replacement technique to from next intermediate encrypted
text which is again encrypted to form the final cipher text through chaining , cascaded xoring of multilayer
perceptron generated session key. If size of the final block of intermediate cipher text is less than the size of
the key then this block is kept unaltered. Receiver will use identical multilayer perceptron generated
session key for performing deciphering process for getting the recursive replacement encrypted cipher text
and then mutated character code table is used for decoding. Parametric tests have been done and results
are compared in terms of Chi-Square test, response time in transmission with some existing classical
techniques, which shows comparable results for the proposed technique.
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.
Improving The Performance of Viterbi Decoder using Window System IJECEIAES
An efficient Viterbi decoder is introduced in this paper; it is called Viterbi decoder with window system. The simulation results, over Gaussian channels, are performed from rate 1/2, 1/3 and 2/3 joined to TCM encoder with memory in order of 2, 3. These results show that the proposed scheme outperforms the classical Viterbi by a gain of 1 dB. On the other hand, we propose a function called RSCPOLY2TRELLIS, for recursive systematic convolutional (RSC) encoder which creates the trellis structure of a recursive systematic convolutional encoder from the matrix “H”. Moreover, we present a comparison between the decoding algorithms of the TCM encoder like Viterbi soft and hard, and the variants of the MAP decoder known as BCJR or forward-backward algorithm which is very performant in decoding TCM, but depends on the size of the code, the memory, and the CPU requirements of the application.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
Soft computing based cryptographic technique using kohonen's selforganizing m...ijfcstjournal
In this paper a novel soft computing based cryptographic technique based on synchronization of two
Kohonen's Self-Organizing Feature Map (KSOFM) between sender and receiver has been proposed. In this
proposed technique KSOFM based synchronization is performed for tuning both sender and receiver. After
the completion of the tuning identical session key get generates at the both sender and receiver end with the
help of synchronized KSOFM. This synchronized network can be used for transmitting message using any
light weight encryption/decryption algorithm with the help of identical session key of the synchronized
network. Exhaustive parametric tests are done and results are compared with some existing classical
techniques, which show comparable results for the proposed system.
Simulation of Quantum Cryptography and use of DNA based algorithm for Secure ...IOSR Journals
This document describes a simulation of quantum cryptography and the use of a DNA-based algorithm for secure communication. It discusses the fundamentals of quantum cryptography based on no-cloning theorem and Heisenberg's uncertainty principle. The document then proposes a system with modules for BB84 protocol-based key exchange and authentication, followed by encryption/decryption of messages using a DNA-based symmetric block cipher algorithm. Screenshots of a simulation of the system are provided along with analysis of its time and space complexity.
One of the important steps in routing is to find a feasible path based on the state information. In order to support real-time multimedia applications, the feasible path that satisfies one or more constraints has to be computed within a very short time. Therefore, the paper presents a genetic algorithm to solve the paths tree problem subject to cost constraints. The objective of the algorithm is to find the set of edges connecting all nodes such that the sum of the edge costs from the source (root) to each node is minimized. I.e. the path from the root to each node must be a minimum cost path connecting them. The algorithm has been applied on two sample networks, the first network with eight nodes, and the last one with eleven nodes to illustrate its efficiency.
This document discusses turbo codes, which are a type of error correction code built by parallel concatenating two convolutional code blocks. It focuses on investigating the iterative decoding of turbo codes. The bit error rate is calculated over multiple iterations of decoding and plotted against signal to noise ratio. Quadratic permutation polynomial and random interleavers are analyzed. Results show turbo codes with a memory of 3 and 1280 bit interleaver achieve the best performance, reaching a bit error rate of 10-5 at -1.2 dB after 10 iterations of decoding.
Computational intelligence based simulated annealing guided key generation in...ijitjournal
In this paper, a Computational Intelligence based Simulated Annealing (SA) guided approach is use to
construct the key stream. SA is a randomization technique for solving optimization problems. It is a
procedure for finding good quality solutions to a large diversity of combinatorial optimization problems.
This technique can assist to stay away from the problem of getting stuck in local optima and to escort
towards the globally optimum solution. It is inspired by the annealing procedure in metallurgy. At high
temperatures, the molecules of liquid move freely with respect to one another. If the liquid is cooled slowly,
thermal mobility is lost. Parametric tests are done and results are compared with some existing classical
techniques, which shows comparable results for the proposed system.
In this paper a novel intelligent soft computing based cryptographic technique based on synchronization of
two chaotic systems (CSCT) between sender and receiver has been proposed to generate session key using
Pecora and Caroll (PC) method. Chaotic system has some unique features like sensitive to initial
conditions, topologically mixing; and dense periodic orbits. By nature, the Lorenz system is very sensitive
to initial conditions meaning that the error between attacker and receiver is going to grow exponentially if
there is a very slight difference between their initial conditions. All these features make chaotic system as
good alternatives for session key generation. In the proposed CSCT few parameters ( , b , r , x1 ,y2 and z2 )
are being exchanged between sender and receiver. Some of the parameter which takes major roles to form
the session key does not get transmitted via public channel, sender keeps these parameters secret. This way
of handling parameter passing mechanism prevents any kind of attacks during exchange of parameters like
sniffing, spoofing or phishing.
A new text encryption algorithm which is based upon a combination between Self-Synchronizing Stream Cipher and chaotic map has been proposed in this paper. The new algorithm encrypts and decrypts text files of different sizes. First of all, the corresponding ASCII values of the plain text are served as input to the permutation operation which diffuses the positions of these values by using hyper-chaotic map. Secondly, the result values are input to substitution operation via1D Bernoulli map. Finally, the resultant vales are XOR feedback with the key.The proposed algorithm has been analyzed using a number of tests and the results show that it has large key space, a uniform histogram, low correlation and it is very sensitive to any change in the plain text or key.
EFFICIENT DIGITAL ENCRYPTION ALGORITHM BASED ON MATRIX SCRAMBLING TECHNIQUEIJNSA Journal
This paper puts forward a safe mechanism of data transmission to tackle the security problem of information which is transmitted in Internet. We propose a new technique on matrix scrambling which is based on random function, shifting and reversing techniques of circular queue. We give statistical analysis, sequence random analysis, and sensitivity analysis to plaintext and key on the proposed scheme. The experimental results show that the new scheme has a very fast encryption speed and the key space is expanded and it can resist all kinds of cryptanalytic, statistical attacks, and especially, our new method can be also used to solve the problem that is easily exposed to chosen plaintext attack. We give our detailed report to this algorithm, and reveal the characteristic of this algorithm by utilizing an example.
Random Keying Technique for Security in Wireless Sensor Networks Based on Mem...ijcsta
The document proposes a random keying technique combined with memetics concepts to provide security in wireless sensor networks. It involves randomly selecting keys from ranges distributed from the base station to cluster heads and nodes. When a node communicates, it selects keys that undergo crossover and mutation to generate header and trailer keys. The receiving node verifies packets by applying the same operations to the header keys and comparing the results to the trailer keys. Simulations showed this technique effectively combats spoofing attacks while being energy efficient compared to cryptographic methods.
Cryptography using artificial neural networkMahira Banu
This document proposes using artificial neural networks for cryptography. It describes using a backpropagation neural network for decryption, where the network is trained on encrypted-decrypted message pairs. Boolean algebra is used for encryption, permuting messages and "doping" with additional bits. The neural network can then be used as a public key for decryption, with a private key for encryption. Simulation results showed the neural network approach weakened key guessing compared to other methods.
ANALYSIS OF ELEMENTARY CELLULAR AUTOMATA CHAOTIC RULES BEHAVIORijsptm
We present detailed and in depth analysis of Elementary Cellular Automata (ECA) with periodic
cylindrical configuration. The focus is to determine whether Cellular Automata (CA) is suitable for the
generation of pseudo random number sequences (PRNs) of cryptographic strength. Additionally, we
identify the rules that are most suitable for such applications. It is found that only two sub-clusters of the
chaotic rule space are actually capable of producing viable PRNs. Furthermore, these two sub-clusters
consist of two majorly non-linear rules. Each sub-cluster of rules is derived from a cluster leader rule by
reflection or negation or the combined two transformations. It is shown that the members of each subcluster
share the same dynamical behavior. Results of testing the ECA running under these rules for
comprehensively large number of lattice lengths using the Diehard Test suite have shown that apart from
some anomaly, the whole output sequence can be potentially utilized for cryptographic strength pseudo
random sequence generation with sufficiently large number of p-values pass rates.
Optimal parameter selection for unsupervised neural network using genetic alg...IJCSEA Journal
K-means Fast Learning Artificial Neural Network (K-FLANN) is an unsupervised neural network requires two parameters: tolerance and vigilance. Best Clustering results are feasible only by finest parameters specified to the neural network. Selecting optimal values for these parameters is a major problem. To solve this issue, Genetic Algorithm (GA) is used to determine optimal parameters of K-FLANN for finding groups in multidimensional data. K-FLANN is a simple topological network, in which output nodes grows dynamically during the clustering process on receiving input patterns. Original K-FLANN is enhanced to select winner unit out of the matched nodes so that stable clusters are formed with in a less number of epochs. The experimental results show that the GA is efficient in finding optimal values of parameters from the large search space and is tested using artificial and synthetic data sets.
ANALYSIS OF SIGNAL TRANSITION ACTIVITY IN FIR FILTERS IMPLEMENTED BY PARALLEL...cscpconf
The MAC architecture is used in real time digital signal processing and multimedia information
processing which requires high throughput. A novel method to estimate the transition activity at
the nodes of a multiplier accumulator architecture based on modified booth algorithm
implementing finite impulse response filter is proposed in this paper. The input signals are
described by a stationary Gaussian process and the transition activity per bit of a signal word is
modeled according to the dual bit type (DBT) model. This estimation is based on the
mathematical formulation by multiplexing mechanism on the breakpoints of the DBT model.
The MAC architecture is used in real time digital signal processing and multimedia information
processing which requires high throughput. A novel method to estimate the transition activity at
the nodes of a multiplier accumulator architecture based on modified booth algorithm
implementing finite impulse response filter is proposed in this paper. The input signals are
described by a stationary Gaussian process and the transition activity per bit of a signal word is
modeled according to the dual bit type (DBT) model. This estimation is based on the
mathematical formulation by multiplexing mechanism on the breakpoints of the DBT model.
This document discusses using genetic algorithms to cryptanalyze the RSA cryptosystem. It first provides an overview of the RSA algorithm and how it works. It then discusses the Karatsuba algorithm, which can be used to efficiently multiply very large numbers. The document goes on to explain the basic concepts behind genetic algorithms, including representation, selection, crossover, and mutation operators. The authors propose applying genetic algorithms to generate new number pairs p and q that could be used to factor the RSA modulus N and break the cryptosystem. Specifically, they suggest using genetic algorithm operators to generate a new population of p and q values to use in cryptanalyzing RSA.
Design, Analysis and Implementation of Modified Luby Transform CodeIOSR Journals
Abstract : Bit losses in erasure channels like computer networks are of great concern. The existing methods to combat bit losses are either inefficient or time consuming due to the retransmission protocols involved. Through this paper, we propose a Modified Luby Transform (MLT) coding scheme to efficiently transmit data over live computer networks. The MLT code can combat bit losses as well as eliminate the need for retransmission. The usability and reliability of the proposed MLT code is verified by testing it on a live computer network. Keywords : Erasure channel, Fountain Codes, Luby Transform Codes , Wired Networks, Wireless Networks
Similar to Neuro genetic key based recursive modulo 2 substitution using mutated character for online wireless communication (ngkrmsmc) (20)
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications
NETWORK MEDIA ATTENTION AND GREEN TECHNOLOGY INNOVATION ijcsity
This paper will provide a novel empirical study for the relationship between network media attention and green technology innovation and examine how network media attention can ease financing constraints. It collected data from listed companies in China's heavy pollution industry and performed rigorous regression analysis, in order to innovatively explore the environmental governance functions of the media. It found that network media attention significantly promotes green technology innovation. By analyzing the inner mechanism further, it found that network media attention can promote green innovation by easing financing constraints. Besides, network media attention has a significant positive impact on green invention patents while not affecting green utility model patents.
4th International Conference on Artificial Intelligence and Machine Learning ...ijcsity
4th International Conference on Artificial Intelligence and Machine Learning (CAIML 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Artificial Intelligence and Machine Learning. The Conference looks for significant contributions to all major fields of the Artificial Intelligence, Machine Learning in theoretical and practical aspects. The aim of the Conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
5th International Conference on Machine Learning & Applications (CMLA 2023)ijcsity
5th International Conference on Machine Learning & Applications (CMLA 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of on Machine Learning & Applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology. The journal focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics, machine learning, and more. The submission deadline is May 20, 2023, with notification of acceptance by June 20, 2023.
8th International Conference on Networks, Communications, Wireless and Mobile...ijcsity
8th International Conference on Networks, Communications, Wireless and Mobile Computing (NCWMC 2023) looks for significant contributions to the Computer Networks, Communications, wireless and mobile computing for wired and wireless networks in theoretical and practical aspects. Original papers are invited on computer Networks, network protocols and wireless networks, Data communication Technologies, network security and mobile computing. The goal of this Conference is to bring together researchers and practitioners from academia and industry to focus on advanced networking concepts and establishing new collaborations in these areas.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
10th International Conference on Computer Science and Information Technology ...ijcsity
10th International Conference on Computer Science and Information Technology (CoSIT 2023) will provide an excellent international forum for sharing knowledge and results in theory, methodology and applications of Computer Science, Engineering and Information Technology. The Conference looks for significant contributions to all major fields of the Computer Science and Information Technology in theoretical and practical aspects. The aim of the conference is to provide a platform to the researchers and practitioners from both academia as well as industry to meet and share cutting-edge development in the field.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology (IJCSITY). IJCSITY focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics/biology, cryptography, machine learning, and more. The submission deadline is April 22, 2023, with notification by May 22, 2023 and final manuscripts due by May 25, 2023.
International Conference on Speech and NLP (SPNLP 2023) ijcsity
International Conference on Speech and NLP (SPNLP 2023) will provide an excellent international forums for sharing knowledge and results in theory, methodology and applications of speech and Natural Language Processing (NLP).
International Conference on Speech and NLP (SPNLP 2023) will provide an excellent international forums for sharing knowledge and results in theory, methodology and applications of speech and Natural Language Processing (NLP).
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
International Journal of Computational Science and Information Technology (IJ...ijcsity
The document is a call for papers for the International Journal of Computational Science and Information Technology. The journal focuses on complex systems, information, and computation using mathematics and engineering techniques. Authors are invited to submit unpublished papers on topics related to algorithms, data structures, computational physics/biology, cryptography, machine learning, and more. The submission deadline is January 14, 2023, with notification by February 14 and final manuscripts due by February 22.
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discussthelatestissuesandadvancementintheareaofadvancedComputationanditsapplications
International Journal of Computational Science and Information Technology (IJ...ijcsity
International Journal of Computational Science and Information Technology (IJCSITY) focuses on Complex systems, information and computation using mathematics and engineering techniques. This is an open access peer-reviewed journal will act as a major forum for the presentation of innovative ideas, approaches, developments, and research projects in the area of Computation theory and applications. It will also serve to facilitate the exchange of information between researchers and industry professionals to discuss the latest issues and advancement in the area of advanced Computation and its applications.
Epistemic Interaction - tuning interfaces to provide information for AI supportAlan Dix
Paper presented at SYNERGY workshop at AVI 2024, Genoa, Italy. 3rd June 2024
https://alandix.com/academic/papers/synergy2024-epistemic/
As machine learning integrates deeper into human-computer interactions, the concept of epistemic interaction emerges, aiming to refine these interactions to enhance system adaptability. This approach encourages minor, intentional adjustments in user behaviour to enrich the data available for system learning. This paper introduces epistemic interaction within the context of human-system communication, illustrating how deliberate interaction design can improve system understanding and adaptation. Through concrete examples, we demonstrate the potential of epistemic interaction to significantly advance human-computer interaction by leveraging intuitive human communication strategies to inform system design and functionality, offering a novel pathway for enriching user-system engagements.
Securing your Kubernetes cluster_ a step-by-step guide to success !KatiaHIMEUR1
Today, after several years of existence, an extremely active community and an ultra-dynamic ecosystem, Kubernetes has established itself as the de facto standard in container orchestration. Thanks to a wide range of managed services, it has never been so easy to set up a ready-to-use Kubernetes cluster.
However, this ease of use means that the subject of security in Kubernetes is often left for later, or even neglected. This exposes companies to significant risks.
In this talk, I'll show you step-by-step how to secure your Kubernetes cluster for greater peace of mind and reliability.
Communications Mining Series - Zero to Hero - Session 1DianaGray10
This session provides introduction to UiPath Communication Mining, importance and platform overview. You will acquire a good understand of the phases in Communication Mining as we go over the platform with you. Topics covered:
• Communication Mining Overview
• Why is it important?
• How can it help today’s business and the benefits
• Phases in Communication Mining
• Demo on Platform overview
• Q/A
Climate Impact of Software Testing at Nordic Testing DaysKari Kakkonen
My slides at Nordic Testing Days 6.6.2024
Climate impact / sustainability of software testing discussed on the talk. ICT and testing must carry their part of global responsibility to help with the climat warming. We can minimize the carbon footprint but we can also have a carbon handprint, a positive impact on the climate. Quality characteristics can be added with sustainability, and then measured continuously. Test environments can be used less, and in smaller scale and on demand. Test techniques can be used in optimizing or minimizing number of tests. Test automation can be used to speed up testing.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Dr. Sean Tan, Head of Data Science, Changi Airport Group
Discover how Changi Airport Group (CAG) leverages graph technologies and generative AI to revolutionize their search capabilities. This session delves into the unique search needs of CAG’s diverse passengers and customers, showcasing how graph data structures enhance the accuracy and relevance of AI-generated search results, mitigating the risk of “hallucinations” and improving the overall customer journey.
Observability Concepts EVERY Developer Should Know -- DeveloperWeek Europe.pdfPaige Cruz
Monitoring and observability aren’t traditionally found in software curriculums and many of us cobble this knowledge together from whatever vendor or ecosystem we were first introduced to and whatever is a part of your current company’s observability stack.
While the dev and ops silo continues to crumble….many organizations still relegate monitoring & observability as the purview of ops, infra and SRE teams. This is a mistake - achieving a highly observable system requires collaboration up and down the stack.
I, a former op, would like to extend an invitation to all application developers to join the observability party will share these foundational concepts to build on:
Full-RAG: A modern architecture for hyper-personalizationZilliz
Mike Del Balso, CEO & Co-Founder at Tecton, presents "Full RAG," a novel approach to AI recommendation systems, aiming to push beyond the limitations of traditional models through a deep integration of contextual insights and real-time data, leveraging the Retrieval-Augmented Generation architecture. This talk will outline Full RAG's potential to significantly enhance personalization, address engineering challenges such as data management and model training, and introduce data enrichment with reranking as a key solution. Attendees will gain crucial insights into the importance of hyperpersonalization in AI, the capabilities of Full RAG for advanced personalization, and strategies for managing complex data integrations for deploying cutting-edge AI solutions.
Unlock the Future of Search with MongoDB Atlas_ Vector Search Unleashed.pdfMalak Abu Hammad
Discover how MongoDB Atlas and vector search technology can revolutionize your application's search capabilities. This comprehensive presentation covers:
* What is Vector Search?
* Importance and benefits of vector search
* Practical use cases across various industries
* Step-by-step implementation guide
* Live demos with code snippets
* Enhancing LLM capabilities with vector search
* Best practices and optimization strategies
Perfect for developers, AI enthusiasts, and tech leaders. Learn how to leverage MongoDB Atlas to deliver highly relevant, context-aware search results, transforming your data retrieval process. Stay ahead in tech innovation and maximize the potential of your applications.
#MongoDB #VectorSearch #AI #SemanticSearch #TechInnovation #DataScience #LLM #MachineLearning #SearchTechnology
Maruthi Prithivirajan, Head of ASEAN & IN Solution Architecture, Neo4j
Get an inside look at the latest Neo4j innovations that enable relationship-driven intelligence at scale. Learn more about the newest cloud integrations and product enhancements that make Neo4j an essential choice for developers building apps with interconnected data and generative AI.
UiPath Test Automation using UiPath Test Suite series, part 6DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 6. In this session, we will cover Test Automation with generative AI and Open AI.
UiPath Test Automation with generative AI and Open AI webinar offers an in-depth exploration of leveraging cutting-edge technologies for test automation within the UiPath platform. Attendees will delve into the integration of generative AI, a test automation solution, with Open AI advanced natural language processing capabilities.
Throughout the session, participants will discover how this synergy empowers testers to automate repetitive tasks, enhance testing accuracy, and expedite the software testing life cycle. Topics covered include the seamless integration process, practical use cases, and the benefits of harnessing AI-driven automation for UiPath testing initiatives. By attending this webinar, testers, and automation professionals can gain valuable insights into harnessing the power of AI to optimize their test automation workflows within the UiPath ecosystem, ultimately driving efficiency and quality in software development processes.
What will you get from this session?
1. Insights into integrating generative AI.
2. Understanding how this integration enhances test automation within the UiPath platform
3. Practical demonstrations
4. Exploration of real-world use cases illustrating the benefits of AI-driven test automation for UiPath
Topics covered:
What is generative AI
Test Automation with generative AI and Open AI.
UiPath integration with generative AI
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
In the rapidly evolving landscape of technologies, XML continues to play a vital role in structuring, storing, and transporting data across diverse systems. The recent advancements in artificial intelligence (AI) present new methodologies for enhancing XML development workflows, introducing efficiency, automation, and intelligent capabilities. This presentation will outline the scope and perspective of utilizing AI in XML development. The potential benefits and the possible pitfalls will be highlighted, providing a balanced view of the subject.
We will explore the capabilities of AI in understanding XML markup languages and autonomously creating structured XML content. Additionally, we will examine the capacity of AI to enrich plain text with appropriate XML markup. Practical examples and methodological guidelines will be provided to elucidate how AI can be effectively prompted to interpret and generate accurate XML markup.
Further emphasis will be placed on the role of AI in developing XSLT, or schemas such as XSD and Schematron. We will address the techniques and strategies adopted to create prompts for generating code, explaining code, or refactoring the code, and the results achieved.
The discussion will extend to how AI can be used to transform XML content. In particular, the focus will be on the use of AI XPath extension functions in XSLT, Schematron, Schematron Quick Fixes, or for XML content refactoring.
The presentation aims to deliver a comprehensive overview of AI usage in XML development, providing attendees with the necessary knowledge to make informed decisions. Whether you’re at the early stages of adopting AI or considering integrating it in advanced XML development, this presentation will cover all levels of expertise.
By highlighting the potential advantages and challenges of integrating AI with XML development tools and languages, the presentation seeks to inspire thoughtful conversation around the future of XML development. We’ll not only delve into the technical aspects of AI-powered XML development but also discuss practical implications and possible future directions.
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AIVladimir Iglovikov, Ph.D.
Presented by Vladimir Iglovikov:
- https://www.linkedin.com/in/iglovikov/
- https://x.com/viglovikov
- https://www.instagram.com/ternaus/
This presentation delves into the journey of Albumentations.ai, a highly successful open-source library for data augmentation.
Created out of a necessity for superior performance in Kaggle competitions, Albumentations has grown to become a widely used tool among data scientists and machine learning practitioners.
This case study covers various aspects, including:
People: The contributors and community that have supported Albumentations.
Metrics: The success indicators such as downloads, daily active users, GitHub stars, and financial contributions.
Challenges: The hurdles in monetizing open-source projects and measuring user engagement.
Development Practices: Best practices for creating, maintaining, and scaling open-source libraries, including code hygiene, CI/CD, and fast iteration.
Community Building: Strategies for making adoption easy, iterating quickly, and fostering a vibrant, engaged community.
Marketing: Both online and offline marketing tactics, focusing on real, impactful interactions and collaborations.
Mental Health: Maintaining balance and not feeling pressured by user demands.
Key insights include the importance of automation, making the adoption process seamless, and leveraging offline interactions for marketing. The presentation also emphasizes the need for continuous small improvements and building a friendly, inclusive community that contributes to the project's growth.
Vladimir Iglovikov brings his extensive experience as a Kaggle Grandmaster, ex-Staff ML Engineer at Lyft, sharing valuable lessons and practical advice for anyone looking to enhance the adoption of their open-source projects.
Explore more about Albumentations and join the community at:
GitHub: https://github.com/albumentations-team/albumentations
Website: https://albumentations.ai/
LinkedIn: https://www.linkedin.com/company/100504475
Twitter: https://x.com/albumentations
Enchancing adoption of Open Source Libraries. A case study on Albumentations.AI
Neuro genetic key based recursive modulo 2 substitution using mutated character for online wireless communication (ngkrmsmc)
1. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
NEURO GENETIC KEY BASED RECURSIVE
MODULO-2 SUBSTITUTION USING MUTATED
CHARACTER FOR ONLINE WIRELESS
COMMUNICATION (NGKRMSMC)
Arindam Sarkar and J. K. Mandal
Department of Computer Science & Engineering, University of Kalyani, W.B, India
ABSTRACT
In this paper, a neural genetic key based technique for encryption (NGKRMSMC) has been proposed
through recursive modulo-2 substitution using mutated character code generation for online wireless
communication of data/information. Both sender and receiver get synchronized based on their final output.
The length of the key depends on the number of input and output neurons. Coordinated matching weight
vectors assist to generate chromosomes pool. Genetic secret key is obtained using fitness function, which is
the hamming distance between two chromosomes. Crossover and mutation are used to add elitism of
chromosomes. At first mutated character code table based encryption strategy get perform on plain text. .
Then the intermediate cipher text is yet again encrypted through recursive positional modulo-2 substitution
technique to from next level encrypted text. This 2nd level intermediate cipher text is again encrypted to
form the final cipher text through chaining and cascaded xoring of neuro genetic key with the identical
length intermediate cipher text block. Receiver will perform same symmetric operation to get back the plain
text using identical key.
KEYWORDS
Neuro Genetic Key based base Recursive Modulo-2 Substitution using Mutated Character (NGKRMSMC),
weight vector, input vector, chaining, neuro genetic key.
1. INTRODUCTION
In cryptography there are wide variety of techniques are available with some pros and cons to
protect data [1]-[3], [7]. These algorithms have their merits and shortcomings. For Example in
DES, AES algorithms [9] the cipher block length is nonflexible. ANNRPMS [1] and ANNRBLC
[2] allow only one cipher block encoding. In this paper a neural training based genetic algorithm
guided online encryption technique for wireless communicationhas been proposed.
The organization of this paper is as follows. Section 2 of the paper deals with the proposed neuro
synchronization and genetic key generation technique and also random block length based
cryptographic techniques using mutated character code generation. Session key based technique
has been discussed in section 3. Example of recursive modulo-2 technique is given in section 4.
Complexity of the algorithm has been presented in section 5. Results are described in section 6.
Conclusions are presented in section 7 and references at end.
DOI : 10.5121/ijcsity.2014.1404
49
2. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
2. THE NGKRMSMC TECHNIQUE
In proposed technique mutated character code table and recursive positional modulo-2
substitution algorithm is used to encrypt the plain text. This intermediate cipher text is again
encrypted to form the final cipher text using chaining of cascaded xoring of the neuro genetic
secret key. Using identical weight vector receiver performs deciphering process to regenerate the
plain text.
2.1 Neural synchronization scheme & secret key generation
At the beginning of the transmission, a neural network based secret key generation is
performed between receiver and sender. The same may be done through the private channel also
or it may be done in some other time, which is absolutely free from encryption. Fig. 1. shows the
tree based generation process using arbitrary number of nodes (neurons). Corresponding
algorithm and genetic key generation is given in two-sub section 1 and.2.
Figure1 A tree parity machine with K=3 and N=4
Neural synchronization algorithm
Input: - Random weights, input vectors for both neural networks
Output: - Session key .
Method: - Each party (A and B) uses its own (same) tree parity machine. Neural network
parameters: K, N, L values will be identical for both parties and synchronization of the
tree parity machines is achieved.
Parameters:
K - The number of hidden neurons.
N - The number of input neurons connected to each hidden neuron, total (K*N) input neurons.
L - The maximum value for weight {-L..+L}
Step 1. Initialize random weight values.
Step 2. Repeat step 3 to 6 until both sender and receiver get synchronized.
Step 3. Produce random input vector X. Inputs are generated by a third party (say the server) or
one of the communicating parties (figure. 2)
50
3. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Figure 2 Neural network for machine A and machine B with K=4 & N=2
Step 4. Compute the values of the hidden neurons
1 if x 0,
N
i sgn wij xij sgn x 0 if x 0,
j 1
1 if x 0.
(1)
Step 5. Compute the value of the output neuron
K
N
sgn w
i 1
j 1
ij
xij
(2)
Step 6. Compare the output values of both tree parity machines by exchanging between the
networks. If Output (A) ≠ Output (B) then go to step 3 else if Output (A) = Output (B) then
Update the weights. In this paper we have used hebbian-learning rule for synchronization
(eq. 3).
w i wi i xi i A
B
(3)
In each step there may be three possibilities:
1. Output (A) ≠ Output (B): None of the parties updates its weights.
2. Output (A) = Output (B) = Output (E): All the three parties update weights.
3. Output (A) = Output (B) ≠ Output (E): Parties A and B update their weights, but the attacker
cannot do that as the synchronization of two parties are faster than learning of an attacker.
Complexity: O(N) computational steps are required to generate a key of length N. The average
synchronization time up to N=1000 asymptotically one expects an increase of O (log N).
3 SESSION KEY GENERATION USING GENETIC ALGORITHM
The method considered indistinguishable matched neural weight vector from the first segment in
the form of blocks of bits with dissimilar size like 8/16/32/64/128/256 to generate the dynamic
chromosomes pool. If neural key is exhausted from the formation of pool at some stage, the key
can be circular right shifted by multiple of 8 bits to generate new key stream.
Step 1. Initially, 200 chromosomes are considered as seeds (every chromosomes has number of
bits identical to 8/16/32/64/128/256 bit) from dynamic pool. Parameters of the genetic algorithm
used are: population size = 200, Crossover probability(CP) = 0.6-0.9 and Mutation
probability(MP) =0.001
Step 2. Hamming distance function is used as a fitness function to evaluate the chromosomes to
get the best individuals for forming the key.
51
4. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Step 3. Perform one-point crossover, where a crossover point on the chromosome are elected
randomly, and two parent individuals are interchanged at these points.
Step 4. Mutation is performed by bit flipping.
Step 5. Genetic processing is continued until the optimized key (the master key) is obtained.
3.1 Character Code Table Generation
For the plain text “tree” Fig 3 shows corresponding tree representation of probability of
occurrence of each character in the plain text. Character „t‟ and „r‟ occur once and character „e‟
occurs twice. Preorder traversal get used to find out the character code. Character values are
extracted from the decimal representation of character code. Left branch is coded as „0‟ and that
of right branch „1‟. Table 1 tabulated the code and value of a particular character in the plain text.
Mutated tree is generated using mutation. Fig 4, 5 and 6 are the mutated trees. After mutation new
code values as obtained are tabulated in table 2. Tree having n-1 intermediate nodes can generate
2n-1 mutated trees.
4
0
2
e
4
1
2
0
1
1
e
1
0
2
2
1
1
t
1
r
r
Figure4 Mutated at Position 1,2 & 3,4
4
4
0
2
1
1
2
1
0
1
t
1
t
Figure3 Character Code Tree
e
0
e
0
2
2
0
r
Figure5 Mutated at Position 3,4
1
1
1
t
1
r
Figure6 Mutated at Position 1,2
52
5. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Table 1. Code table
Character of plain text
Code
t
10
Value of that
Character
2
r
11
3
e
0
0
Table 2. Mutated Code Table
Character
Code
Value
Code
Value
Code
Value
t
01
1
r
00
0
11
10
3
2
00
01
0
1
e
1
2
0
0
1
2
4 RECURSIVE MODULO-2 ENCRYPTION TECHNIQUE
Now, plain text characters are already converted into the mutated code using the mutated code
table. Then it is divided into blocks. The decimal equivalent of the block of bits under
consideration is one integral value from which the recursive modulo-2 operation starts. The
modulo-2 operation is performed to check whether integral value is even or odd and the position
of that integral value in the series of natural even or odd numbers is evaluated. Process is carried
out Recursively to a finite number of times, which is exactly the length of the source block. After
each modulo-2 operation, 0 or 1 is pushed to the output stream in MSB-to-LSB order; depending
on the fact whether the integral value is even or odd. In this way intermediate encrypted text is
generated.
Set: P = 0.
LOOP:
Evaluate: Temp = Remainder of DL-P / 2.
If Temp = 0
Evaluate: DL-P-1 = DL-P / 2.
Set: tP = 0.
Else If Temp = 1
Evaluate: DL-P-1 = (DL-P + 1) / 2.
Set: tP = 1.
Set: P = P + 1.
If (P > (L – 1))
Exit.
END LOOP
Figure7 Algorithm for Recursive Modulo-2 encryption technique.
Thus overall complexity of encryption algorithm is O(L).The key is padded with the recursive
modulo-2 encrypted text block to form the 2nd level intermediate cipher block. Then the neuro
genetic secret key is use to xored with the same length first 2nd level intermediate cipher text
block to produce the first final cipher block (neuro genetic secret key XOR with same length
cipher text). This newly generated block again xored with the immediate next block and so on.
53
6. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
This chaining of cascaded xoring mechanism is performed until all the blocks get exhausted. If
the last block size of intermediate cipher text is less than the require xoring block size (i.e. neuro
genetic vector size) then this block is kept unchanged.
Recursive Modulo-2 Decryption Technique
During decryption the encrypted message is xored with the neuro genetic key to extract the
intermediate encrypted stream. Then the intermediate encrypted stream is decomposed into a set
of blocks, each consisting of a fixed number of bits using same rule of encryption. Then perform
the recursive modulo-2 decryption operation. Finally, character code value is decrypted using
character code table to get the plain text. Complexity of this decryption algorithm is also O(L).
Set: P = L – 1 and T = 1.
LOOP:
If tP = 0
Evaluate: T = Tth even number in the series of natural
numbers.
Else If tP = 1
Evaluate: T = Tth odd number in the series of natural
numbers.
Set: P = P – 1.
If P < 0
Exit.
END LOOP
Evaluate: S = s0 s1 s2 s3 s4 … sL-1, which is the binary equivalent of T
Figure 8 Algorithm for Recursive Modulo-2 decryption technique.
Example of Recursive Modulo-2 Operation
Consider a separate plaintext (P) as: “Local Area Network”.
The Process of Recursive Modulo-2 Encryption
To generate the source stream of bits, we take the reference of Table 3.
Table 3. Character-to-Byte Conversion for the Text “Local Area Network”
54
7. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Message stream of bits S is:
S=01001100/01101111/01100011/01100001/01101100/00100000/01000001/01110010/0110010
1/01100001/00100000/01001110/01100101/01110100/01110111/01101111/01110010/01101011.
Decompose S into a set of 5 blocks, each of the first four being of size 32 bits and the last one
being of 16 bits. During this process of decomposition, we scan S along the MSB-to-LSB
direction. Thus we obtain
S1=01001100011011110110001101100001,
S2=01101100001000000100000101110010,
S3=01100101011000010010000001001110,
S4=01100101011101000111011101101111,
S5=0111001001101011. For the block S1, corresponding to which the decimal value is
(1282368353)10, the process of encryption is shown below:
1282368353 6411841771 3205920891 1602960451 801480231 400740121
200370060 1000185030 50092521 25046260 12523130 6261571 3130791
1565401 787200 391350 195681 97840 48920 24460 12230 6121 3060
1530 771 391 201 100 50 31 21 10 11. From this we generate the target
block T1 corresponding to S1 as: T1=11111001001110010000100111001101.
Applying the similar process, we generate target blocks T 1, T2, T3, T4 and T5 corresponding to
source blocks S1, S2, S3, S4 and S5 respectively.
T2=01110001011111011111101111001001
T3=01001101111110110111100101011001
T4=10001001000100011101000101011001
T5=1110100110110001.
Now, combining target blocks in the same sequence, we get the target stream of bits T as the
following:
T=11111001/00111001/00001001/11001101/01110001/01111101/11111011/11001001/0100110
1/11111011/01111001/01011001/10001001/00010001/11010001/01011001/11101001/10110001.
After padding the key with the above intermediate cipher text and xoring with the neural secret
key, final encrypted cipher text is generated. This stream of bits, in the form of a stream of
characters, is transmitted as the encrypted message.
The Process of Recursive Modulo-2 Decryption
At the destination end, receiver‟s secret neural key is used to xoring the cipher text to get back the
key and intermediate cipher text. Using secret key, the receiver gets the information on different
block lengths. Using that secret key, all the blocks T1, T2, T3, T4 and T5 are formed as follows:
T1=11111001001110010000100111001101
T2=01110001011111011111101111001001
T3=01001101111110110111100101011001
T4=10001001000100011101000101011001
T5=1110100110110001.
Apply the process of decryption to generate source blocks Si for all Ti, 1 ≤ i ≤5. 32-bit stream is
regenerated S1=01001100011011110110001101100001.”
55
8. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
All the source blocks of bits are regenerated and combining those blocks in the same sequence,
the source stream of bits obtained to get the source message or the plaintext.
5 RESULTS
Results are presented in terms of encryption decryption time, Chi-Square test, source file size vs.
encryption time along with source file size vs. encrypted file size. The results are also compared
with existing RSA technique.
Table 4. Encryption / decryption time vs. File size
Encryption Time (s)
Decryption Time (s)
Source
(bytes)
18432
NGKRMSMC
ANNRPMS
NGKRMSMC
ANNRPMS
5. 32
Encrypted
(bytes)
18432
5. 98
5.52
4.85
23044
35425
36242
59398
8.04
14.59
15.17
23.02
7. 37
13. 98
14. 53
22. 39
23040
35425
36242
59398
7.63
14.08
14.70
22.51
6.96
13. 37
14. 01
21. 88
Encryption & decryption time
Table 4 shows encryption and decryption time with respect to the source and encrypted size
respectively.
Source size
Figure9 Source size vs. encryption time & decryption time
Encryption /decryption time is marginally high because of incorporation of genetic technique and
mutated character coding.
Table 5 shows Chi-Square value for different source stream size on applying various encryption
algorithms. It is seen that the Chi-Square value of NGKRMSMCC is better compared to the
RBCMPCC algorithm and comparable with values of the RSA technique.
56
9. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Table 5. Source size vs. Chi-Square value
Stream
Size
(bytes)
1500
2500
3000
3250
3500
Chi-Square
value
(TDES)
1228.5803
2948.2285
3679.0432
4228.2119
4242.9165
Chi-Square value
Proposed
NGKRMS MCC
2465.0749
5643.5271
6759.2956
6997.6173
10572.7263
Chi-Square
value
(RBCM
CPCC)
2464.0324
5642.5835
6714.6741
6994.6189
10570.4671
Chi-Square
value
(RSA)
5623.14
22638.99
12800.355
15097.77
15284.728
Figure 10 shows graphical representation of table 5.
Figure10 Source size vs. Chi-Square value
6 COMPLEXITY OF THE TECHNIQUE
The complexity of the technique will be O (L), which can be computed using following three
steps.
Step 1: To generate a key of length N needs O (N) Computational steps. The average
synchronization time is independent of the size N of the networks (up to N=1000). The
complexity of synchronization is O (log N).
Step 2: Complexity of the encryption technique is O (L).
Step 2.1: Corresponding to the source block S = s0 s1 s2 s3 s4… sL-1, evaluate the equivalent
decimal integer, DL. It takes O (L) amount of time.
Step 2.2: Step 3 and step 4 executed exactly L number of times for the values of the
variable P ranging from 0 to (L-1) increasing by 1 after each execution of the loop where
the complexity is O (L) as L no. of iterations are needed.
Step 2.3: Apply modulo-2 operation on DL-P to check if DL-P is even or odd, takes constant
amount of time i.e. O(1).
Step 2.4: If DL-P is found to be even, compute DL-P-1 = DL-P / 2, where DL-P-1 is its position in
the series of natural even numbers. Assign tP = 0. If DL-P is found to be odd, compute DL-P-1
= (DL-P + 1) / 2, where DL-P-1 is its position in the series of natural odd numbers. Assign tP=1
which generates the complexity as O (1).
Step 2.5: evaluate: DL, the decimal equivalent, corresponding to the source block S = s0 s1
s2 s3 s4 … sL-1 which takes O (L) amount of time.
57
10. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Step 3: Complexity of the decryption technique is O (L).
Step 3.1: Set P=L-1and T=1.So time complexity of assignments is O (1).
Step 3.2: Complexity of loop is O (L) because L iterations are needed.
Step 3.3: If tP = 0,T = Tth even number in the series of natural even numbers. If tP = 1,T =
Tth odd number in the series of natural even numbers. Complexity is O (1) as it takes
constant amount of times.
Step 3.4: Set P=P-1. This step takes constant amount of time i.e. O(1).
Step 3.5: Complexity to convert T into the corresponding stream of bits S = s0 s1 s2 s3
s4…sL-1, which is the source block is O(L) as this step also takes constant amount of time
for merging s0 s1 s2 s3 s4…sL-1 .
So, overall time complexity of the entire technique is O(L).
7 CONCLUSION
The paper presents a novel approach for generation of secret key using neural synchronization.
This proposed technique allows key exchange through public channel. So likelihood of attack of
the technique is much less than the simple RBCMCCC [4]algorithm.
ACKNOWLEDGEMENTS
The author expresses deep sense of gratitude to the DST, Govt. of India, for financial assistance
through INSPIRE Fellowship leading for a PhD work under which this work has been carried out.
REFERENCES
[1]
[2]
[3]
[4]
[5]
[6]
[7]
[8]
[9]
Mandal, J. K., Sarkar Arindam, “An Adaptive Neural Network Guided Secret Key Based Encryption
Through Recursive Positional Modulo-2 Substitution For Online Wireless Communication
(ANNRPMS)”, in Proc. International Conference on Recent Trends In Information Technology
(ICRTIT 2011) Conf. BY IEEE, 3-5 June 2011, Madras Institute of Technology, Anna University,
Chennai, Tamil Nadu, India. 978-1-4577-0590-8/11
Mandal, J. K., Sarkar Arindam, “An Adaptive Neural Network Guided Random Block Length Based
Cryptosystem (ANNRBLC)”, in Proc. 2nd International Conference On Wireless Communications,
Vehicular Technology, Information Theory And Aerospace & Electronic System Technology”
(Wireless Vitae 2011) Conf By IEEE Societies, February 28, 2011- March 03, 2011,Chennai, Tamil
Nadu, India. ISBN 978-87-92329-61-5.
Mandal, J. K., Sarkar Arindam “Neural Network Guided Secret Key based Encryption through
Cascading Chaining of Recursive Positional Substitution of Prime Non-Prime (NNSKECC)” [TP48][PID-63], in Proc. of International Confrence of Computing and Systems-2010 Conf by ICCS-2010,
Novembar 19-20, 2010, The University of Burdwan,pp 291-297.
Jayanta Kumar Pal, J. K. Mandal “A Random Block Length Based Cryptosystem through Multiple
Cascaded Permutation Combinations and Chaining of Blocks” in Proc. Fourth International
Conference on Industrial and Information Systems, ICIIS 2009 Conf, 28 – 31December2009,
SriLanka.
T. Godhavari, N. R. Alainelu and R. Soundararajan “Cryptography Using Neural Network “in Proc.by
Conf IEEE Indicon 2005, Chennai, India, 11-13 Dec. 2005.ggggjgggggggggggg
Wolfgang Kinzel and ldo Kanter, "Interacting neural networks and cryptography", Advances in Solid
State Physics, Ed. by B. Kramer (Springer, Berlin. 2002), Vol. 42, p. 383 arXiv- cond-mat/0203011.
Dong Hu "A new service based computing security model with neural cryptography"IEEE07/2009.J
J. K. Mandal, et al, “A 256-bit Recursive Pair Parity Encoder for Encryption”, in Proc Advances in
Modeling, D; Computer Science & Statistics (AMSE), Conf vol. 9, No. 1, pp. 1-14, France, 2004.
Atul Kahate, Cryptography and Network Security, 2003, Tata McGraw-Hill publishing Company
Limited, Eighth reprint 2006.
58
11. International Journal of Computational Science and Information Technology (IJCSITY) Vol.1, No.4, November 2013
Author
Arindam Sarkar
INSPIRE FELLOW (DST, Govt. of India), MCA (VISVA BHARATI, Santiniketan,
University First Class First Rank Holder), M.Tech (CSE, K.U, University First Class First
Rank Holder). Total number of publications 25.
Jyotsna Kumar Mandal
M. Tech.(Computer Science, University of Calcutta), Ph.D.(Engg., Jadavpur University) in
the field of Data Compression and Error Correction Techniques, Professor in Computer
Science and Engineering, University of Kalyani, India. Life Member of Computer Society of
India since 1992 and life member of cryptology Research Society of India. Dean Faculty of
Engineering, Technology & Management, working in the field of Network Security,
Steganography, Remote Sensing & GIS Application, Image Processing. 25 years of teaching
and research experiences. Eight Scholars awarded Ph.D. and 8 are pursuing. Total number
of publications 267.
59