Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated ...idescitation
Many network simulators (e.g., ns2) are already
being used for performing wired and wireless network
simulations. But, with the current graphical visualization
support in-built in ns2, it is difficult to understand the node
status, packet status and the MAC level events particularly
for Ad-hoc networks. In this paper, we extend the visualization
support in ns-2 that should help research community in the
area of wireless networks to analyze different MAC level
events in an efficient manner. In particular, we have developed
two types of visualizations namely, temporal and spatial.
Temporal visualization helps to analyze success or failure of
a packet with respect to time while spatial visualization helps
to understand the effects due to proximity of nodes. The trace
is made highly configurable in terms of different attributes
like specific nodes and time duration.
REDUCING FREQUENCY OF GROUP REKEYING OPERATIONcsandit
In the past, Ad-hoc networks were used in limited areas which require secure group communication without Internet access, such as the army or emergencies. However, Ad-hoc networks currently are widely used in variety applications like group chat, smart applications, research testbed etc. Ad-hoc network is basically group based network in the absence of access point so it is prevalent to provide group key approach to prevent information leakage. When we use group key approach, we need to consider which group key management method is the most suitable for the architecture because the cost and frequency of the rekeying operation remain as an unresolved issue. In this paper, we present analysis about existing group key management solutions for Ad-hoc network and suggest a new approach to reduce frequency of the rekeying operation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
IMPROVING SCHEDULING OF DATA TRANSMISSION IN TDMA SYSTEMScsandit
In an era where communication has a most important role in modern societies, designing efficient
algorithms for data transmission is of the outmost importance. TDMA is a technology used in many
communication systems such as satellites and cell phones. In order to transmit data in such systems we
need to cluster them in packages. To achieve a faster transmission we are allowed to preempt the
transmission of any packet in order to resume at a later time. Such preemptions though come with a delay
in order to setup for the next transmission. In this paper we propose an algorithm which yields improved
transmission scheduling. This algorithm we call MGA. We have proven an approximation ratio for MGA
and ran experiments to establish that it works even better in practice. In order to conclude that MGA will
be a very helpful tool in constructing an improved schedule for packet routing using preemtion with a setup
cost, we compare its results to two other efficient algorithms designed by researchers in the past.
Graphical Visualization of MAC Traces for Wireless Ad-hoc Networks Simulated ...idescitation
Many network simulators (e.g., ns2) are already
being used for performing wired and wireless network
simulations. But, with the current graphical visualization
support in-built in ns2, it is difficult to understand the node
status, packet status and the MAC level events particularly
for Ad-hoc networks. In this paper, we extend the visualization
support in ns-2 that should help research community in the
area of wireless networks to analyze different MAC level
events in an efficient manner. In particular, we have developed
two types of visualizations namely, temporal and spatial.
Temporal visualization helps to analyze success or failure of
a packet with respect to time while spatial visualization helps
to understand the effects due to proximity of nodes. The trace
is made highly configurable in terms of different attributes
like specific nodes and time duration.
REDUCING FREQUENCY OF GROUP REKEYING OPERATIONcsandit
In the past, Ad-hoc networks were used in limited areas which require secure group communication without Internet access, such as the army or emergencies. However, Ad-hoc networks currently are widely used in variety applications like group chat, smart applications, research testbed etc. Ad-hoc network is basically group based network in the absence of access point so it is prevalent to provide group key approach to prevent information leakage. When we use group key approach, we need to consider which group key management method is the most suitable for the architecture because the cost and frequency of the rekeying operation remain as an unresolved issue. In this paper, we present analysis about existing group key management solutions for Ad-hoc network and suggest a new approach to reduce frequency of the rekeying operation.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
In this work a method for video streaming authentication based on butterfly graphs is presanted. As well as other methods variables such as the sender delay, receiver delay, computation overhead, communication overhead, robustness against packet loss, should be considered. The aim of this work is improvement of communication overhead as an important parameter, in networks which packet loss ratio is random and burst. For this purpose we develop butterfly graph to increase authentication probability.
Wireless data broadcast is an efficient way of disseminating data to users in the mobile computing environments. From the server’s point of view, how to place the data items on channels is a crucial issue, with the objective of minimizing the average access time and tuning time. Similarly, how to schedule the data retrieval process for a given request at the client side such that all the requested items can be downloaded in a short time is also an important problem. In this paper, we investigate the multi-item data retrieval scheduling in the push-based multichannel broadcast environments. The most important issues in mobile computing are energy efficiency and query response efficiency. However, in data broadcast the objectives of reducing access latency and energy cost can be contradictive to each other. Consequently, we define a new problem named Minimum Cost Data Retrieval Problem (MCDR) and Large Number Data Retrieval (LNDR) Problem. We also develop a heuristic algorithm to download a large number of items efficiently. When there is no replicated item in a broadcast cycle, we show that an optimal retrieval schedule can be obtained in polynomial time
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Novel Technique for Image Steganography Based on DWT and Huffman EncodingCSCJournals
Image steganography is the art of hiding information into a cover image. This paper presents a novel technique for Image steganography based on DWT, where DWT is used to transform original image (cover image) from spatial domain to frequency domain. Firstly two dimensional Discrete Wavelet Transform (2-D DWT) is performed on a gray level cover image of size M × N and Huffman encoding is performed on the secret messages/image before embedding. Then each bit of Huffman code of secret message/image is embedded in the high frequency coefficients resulted from Discrete Wavelet Transform. Image quality is to be improved by preserving the wavelet coefficients in the low frequency sub-band. The experimental results show that the algorithm has a high capacity and a good invisibility. Moreover PSNR of cover image with stego-image shows the better results in comparison with other existing steganography approaches. Furthermore, satisfactory security is maintained since the secret message/image cannot be extracted without knowing decoding rules and Huffman table.
Image encryption technique incorporating wavelet transform and hash integrityeSAT Journals
Abstract
This paper is basically designed for image encryption using wavelet Transform Techniques and its integrity incorporating hash value with SHA-256. Techniques which is involved in encryption is image confusion, image diffusion, wavelet Transform, Inverse wavelet Transform and finally hash value computation of original image. Techniques which are involved for Decryption is reverse of Encryption.
Keywords: wavelet Transform, Hash value, Encryption, Decryption.
Operating Task Redistribution in Hyperconverged Networks IJECEIAES
In this article, a searching method for the rational task distribution through the nodes of a hyperconverged network is presented in which it provides the rational distribution of task sets towards a better performance. With using new subsettings related to distribution of nodes in the network based on distributed processing, we can minimize average packet delay. The distribution quality is provided with using a special objective function considering the penalties in the case of having delays. This process is considered in order to create the balanced delivery systems. The initial redistribution is determined based on the minimum penalty. After performing a cycle (iteration) of redistribution in order to have the appropriate task distribution, a potential system is formed for functional optimization. In each cycle of the redistribution, a rule for optimizing contour search is used. Thus, the obtained task distribution, including the appeared failure and success, will be rational and can decrease the average packet delay in the hyperconverged networks. The effectiveness of our proposed method is evaluated by using the model of hyperconverged support system of the university E-learning provided by V.N. Karazin Kharkiv National University. The simulation results based on the model clearly confirm the acceptable and better performance of our approach in comparison to the classical approach of task distribution.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Parallel Batch-Dynamic Graphs: Algorithms and Lower BoundsSubhajit Sahu
In this paper we study the problem of dynamically
maintaining graph properties under batches of edge
insertions and deletions in the massively parallel model
of computation. In this setting, the graph is stored
on a number of machines, each having space strongly
sublinear with respect to the number of vertices, that
is, n
for some constant 0 < < 1. Our goal is to
handle batches of updates and queries where the data
for each batch fits onto one machine in constant rounds
of parallel computation, as well as to reduce the total
communication between the machines. This objective
corresponds to the gradual buildup of databases over
time, while the goal of obtaining constant rounds of
communication for problems in the static setting has
been elusive for problems as simple as undirected graph
connectivity.
We give an algorithm for dynamic graph connectivity
in this setting with constant communication rounds and
communication cost almost linear in terms of the batch
size. Our techniques combine a new graph contraction
technique, an independent random sample extractor from
correlated samples, as well as distributed data structures
supporting parallel updates and queries in batches.
We also illustrate the power of dynamic algorithms in
the MPC model by showing that the batched version
of the adaptive connectivity problem is P-complete in
the centralized setting, but sub-linear sized batches can
be handled in a constant number of rounds. Due to
the wide applicability of our approaches, we believe
it represents a practically-motivated workaround to the
current difficulties in designing more efficient massively
parallel static graph algorithms.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D meshknight ABFT scheme is capable of detecting and correcting up to three errors in an n2 -data matrix with liner computation and bandwidth overhead. The proposed schemes provide one-to-one mapping between data index and check sum group so that error can be located and recovered by easier logic and simple operations.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D meshknight ABFT scheme is capable of detecting and correcting up to three errors in an n2 -data matrix with liner computation and bandwidth overhead. The proposed schemes provide one-to-one mapping between data index and check sum group so that error can be located and recovered by easier logic and simple operations.
Random Keying Technique for Security in Wireless Sensor Networks Based on Mem...ijcsta
Wireless Sensor Networks (WSNs) are often prone to risk of security attacks and vulnerabilities. This is because of
the less human intervention in their operations. Hence, novel security mechanisms and techniques are of a prime
importance in these types of networks. In this context, we propose a unique security scheme, which coalesce the
random keying technique with memetics. The application of these kinds of bio-inspired computation in WSNs
provides robust security in the network with the obtained results supporting the security concerns of the network.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
The secure communication through synchronization between two identic chaotic systems have
recently gained a lot of interest. To implement a robust secure system based on synchronization, there is
always a need to generate new discrete dynamical systems and investigate their performances in terms of
amount of randomness they have and the ability to achieve synchronization smoothly. In this work, a new
chaotic system, named Nahrain, is proposed and tested for the possible use in secure transmission via
chaos synchronization as well as in cryptography applications. The performance of the proposed chaotic
system is tested using 0-1 test, while NIST suite tests are used to check the randomness statistical
properties. The nonlinear control laws are used to verify the synchronization of master-slave parts of the
proposed system. The simulation results show that Nahrain system has chaotic behavior and
synchronizable, while the equivalent binary sequence of the system has excellent randomness statistical
properties. The numerical results obtained using MATLAB for 0-1 test was 0.9864, and for frequency test
was 0.4202, while for frequency test within a block was 0.4311. As a result, the new proposed system can
be used to develop efficient encryption and synchronization algorithms for multimedia secure transmission
applications.
Wireless data broadcast is an efficient way of disseminating data to users in the mobile computing environments. From the server’s point of view, how to place the data items on channels is a crucial issue, with the objective of minimizing the average access time and tuning time. Similarly, how to schedule the data retrieval process for a given request at the client side such that all the requested items can be downloaded in a short time is also an important problem. In this paper, we investigate the multi-item data retrieval scheduling in the push-based multichannel broadcast environments. The most important issues in mobile computing are energy efficiency and query response efficiency. However, in data broadcast the objectives of reducing access latency and energy cost can be contradictive to each other. Consequently, we define a new problem named Minimum Cost Data Retrieval Problem (MCDR) and Large Number Data Retrieval (LNDR) Problem. We also develop a heuristic algorithm to download a large number of items efficiently. When there is no replicated item in a broadcast cycle, we show that an optimal retrieval schedule can be obtained in polynomial time
Performance Analysis of Bfsk Multi-Hop Communication Systems Over K-μ Fading ...ijwmn
Multi-hop communication systems gained popularity in wireless communications; they can be used to
extend the coverage of the network and reduce the transmitted power. The transmission of data from the
source node to the destination node in multi-hop communications undergoes through intermediate relay
nodes. In this paper, we study the performance of multi-hop communication systems, in terms of average bit
error rate (BER) with Binary frequency shift keying assuming the κ-µ fading channel model. Due to the
difficulty in finding the probability density function (PDF) of the end-to-end signal to noise ratio (SNR) and
hence for the performance metrics, we use Gaussian Mixture (GM) approximation technique to
approximate the PDF of the end to end SNR assuming the κ-µ fading models as weighted sums of Gaussian
distributions. Numerical results are provided for the BER of binary frequency shift keying (BFSK) of
amplify and forward (AF) multi-hop communication systems assuming different values for the fading
parameters (, ) and for different number of hops. Numerical results are validated by comparing them
with simulation results.
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
A Novel Technique for Image Steganography Based on DWT and Huffman EncodingCSCJournals
Image steganography is the art of hiding information into a cover image. This paper presents a novel technique for Image steganography based on DWT, where DWT is used to transform original image (cover image) from spatial domain to frequency domain. Firstly two dimensional Discrete Wavelet Transform (2-D DWT) is performed on a gray level cover image of size M × N and Huffman encoding is performed on the secret messages/image before embedding. Then each bit of Huffman code of secret message/image is embedded in the high frequency coefficients resulted from Discrete Wavelet Transform. Image quality is to be improved by preserving the wavelet coefficients in the low frequency sub-band. The experimental results show that the algorithm has a high capacity and a good invisibility. Moreover PSNR of cover image with stego-image shows the better results in comparison with other existing steganography approaches. Furthermore, satisfactory security is maintained since the secret message/image cannot be extracted without knowing decoding rules and Huffman table.
Image encryption technique incorporating wavelet transform and hash integrityeSAT Journals
Abstract
This paper is basically designed for image encryption using wavelet Transform Techniques and its integrity incorporating hash value with SHA-256. Techniques which is involved in encryption is image confusion, image diffusion, wavelet Transform, Inverse wavelet Transform and finally hash value computation of original image. Techniques which are involved for Decryption is reverse of Encryption.
Keywords: wavelet Transform, Hash value, Encryption, Decryption.
Operating Task Redistribution in Hyperconverged Networks IJECEIAES
In this article, a searching method for the rational task distribution through the nodes of a hyperconverged network is presented in which it provides the rational distribution of task sets towards a better performance. With using new subsettings related to distribution of nodes in the network based on distributed processing, we can minimize average packet delay. The distribution quality is provided with using a special objective function considering the penalties in the case of having delays. This process is considered in order to create the balanced delivery systems. The initial redistribution is determined based on the minimum penalty. After performing a cycle (iteration) of redistribution in order to have the appropriate task distribution, a potential system is formed for functional optimization. In each cycle of the redistribution, a rule for optimizing contour search is used. Thus, the obtained task distribution, including the appeared failure and success, will be rational and can decrease the average packet delay in the hyperconverged networks. The effectiveness of our proposed method is evaluated by using the model of hyperconverged support system of the university E-learning provided by V.N. Karazin Kharkiv National University. The simulation results based on the model clearly confirm the acceptable and better performance of our approach in comparison to the classical approach of task distribution.
A FLOATING POINT DIVISION UNIT BASED ON TAYLOR-SERIES EXPANSION ALGORITHM AND...csandit
Floating point division, even though being an infrequent operation in the traditional sense, is
indis-pensable when it comes to a range of non-traditional applications such as K-Means
Clustering and QR Decomposition just to name a few. In such applications, hardware support
for floating point division would boost the performance of the entire system. In this paper, we
present a novel architecture for a floating point division unit based on the Taylor-series
expansion algorithm. We show that the Iterative Logarithmic Multiplier is very well suited to be
used as a part of this architecture. We propose an implementation of the powering unit that can
calculate an odd power and an even power of a number simultaneously, meanwhile having little
hardware overhead when compared to the Iterative Logarithmic Multiplier.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
CORRELATION OF EIGENVECTOR CENTRALITY TO OTHER CENTRALITY MEASURES: RANDOM, S...csandit
In this paper, we thoroughly investigate correlations of eigenvector centrality to five centrality
measures, including degree centrality, betweenness centrality, clustering coefficient centrality,
closeness centrality, and farness centrality, of various types of network (random network, smallworld
network, and real-world network). For each network, we compute those six centrality
measures, from which the correlation coefficient is determined. Our analysis suggests that the
degree centrality and the eigenvector centrality are highly correlated, regardless of the type of
network. Furthermore, the eigenvector centrality also highly correlates to betweenness on
random and real-world networks. However, it is inconsistent on small-world network, probably
owing to its power-law distribution. Finally, it is also revealed that eigenvector centrality is
distinct from clustering coefficient centrality, closeness centrality and farness centrality in all
tested occasions. The findings in this paper could lead us to further correlation analysis on
multiple centrality measures in the near future
A genetic algorithm for constructing broadcast trees with cost and delay cons...IJCNCJournal
We refer to the problem of constructing broadcast trees with cost and delay constraints in the networks as a delay-constrained minimum spanning tree problem in directed networks. Hence it is necessary determining a spanning tree of minimal cost to connect the source node to all nodes subject to delay constraints on broadcast routing. In this paper, we proposed a genetic algorithm for solving broadcast routing by finding the low-cost broadcast tree with minimum cost and delay constraints. In this research we present a genetic algorithm to find the broadcast routing tree of a given network in terms of its links. The algorithm uses the connection matrix of the given network to find the spanning trees and considers the weights of the links to obtain the minimum spanning tree. Our proposed algorithm is able to find a better solution, fast convergence speed and high reliability. The scalability and the performance of the algorithm with increasing number of network nodes are also encouraging.
Parallel Batch-Dynamic Graphs: Algorithms and Lower BoundsSubhajit Sahu
In this paper we study the problem of dynamically
maintaining graph properties under batches of edge
insertions and deletions in the massively parallel model
of computation. In this setting, the graph is stored
on a number of machines, each having space strongly
sublinear with respect to the number of vertices, that
is, n
for some constant 0 < < 1. Our goal is to
handle batches of updates and queries where the data
for each batch fits onto one machine in constant rounds
of parallel computation, as well as to reduce the total
communication between the machines. This objective
corresponds to the gradual buildup of databases over
time, while the goal of obtaining constant rounds of
communication for problems in the static setting has
been elusive for problems as simple as undirected graph
connectivity.
We give an algorithm for dynamic graph connectivity
in this setting with constant communication rounds and
communication cost almost linear in terms of the batch
size. Our techniques combine a new graph contraction
technique, an independent random sample extractor from
correlated samples, as well as distributed data structures
supporting parallel updates and queries in batches.
We also illustrate the power of dynamic algorithms in
the MPC model by showing that the batched version
of the adaptive connectivity problem is P-complete in
the centralized setting, but sub-linear sized batches can
be handled in a constant number of rounds. Due to
the wide applicability of our approaches, we believe
it represents a practically-motivated workaround to the
current difficulties in designing more efficient massively
parallel static graph algorithms.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D meshknight ABFT scheme is capable of detecting and correcting up to three errors in an n2 -data matrix with liner computation and bandwidth overhead. The proposed schemes provide one-to-one mapping between data index and check sum group so that error can be located and recovered by easier logic and simple operations.
Multiple Dimensional Fault Tolerant Schemes for Crypto Stream CiphersIJNSA Journal
To enhance the security and reliability of the widely-used stream ciphers, a 2-D and a 3-D mesh-knight Algorithm Based Fault Tolerant (ABFT) schemes for stream ciphers are developed which can be universally applied to RC4 and other stream ciphers. Based on the ready-made arithmetic unit in stream ciphers, the proposed 2-D ABFT scheme is able to detect and correct any simple error, and the 3-D meshknight ABFT scheme is capable of detecting and correcting up to three errors in an n2 -data matrix with liner computation and bandwidth overhead. The proposed schemes provide one-to-one mapping between data index and check sum group so that error can be located and recovered by easier logic and simple operations.
Random Keying Technique for Security in Wireless Sensor Networks Based on Mem...ijcsta
Wireless Sensor Networks (WSNs) are often prone to risk of security attacks and vulnerabilities. This is because of
the less human intervention in their operations. Hence, novel security mechanisms and techniques are of a prime
importance in these types of networks. In this context, we propose a unique security scheme, which coalesce the
random keying technique with memetics. The application of these kinds of bio-inspired computation in WSNs
provides robust security in the network with the obtained results supporting the security concerns of the network.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
The secure communication through synchronization between two identic chaotic systems have
recently gained a lot of interest. To implement a robust secure system based on synchronization, there is
always a need to generate new discrete dynamical systems and investigate their performances in terms of
amount of randomness they have and the ability to achieve synchronization smoothly. In this work, a new
chaotic system, named Nahrain, is proposed and tested for the possible use in secure transmission via
chaos synchronization as well as in cryptography applications. The performance of the proposed chaotic
system is tested using 0-1 test, while NIST suite tests are used to check the randomness statistical
properties. The nonlinear control laws are used to verify the synchronization of master-slave parts of the
proposed system. The simulation results show that Nahrain system has chaotic behavior and
synchronizable, while the equivalent binary sequence of the system has excellent randomness statistical
properties. The numerical results obtained using MATLAB for 0-1 test was 0.9864, and for frequency test
was 0.4202, while for frequency test within a block was 0.4311. As a result, the new proposed system can
be used to develop efficient encryption and synchronization algorithms for multimedia secure transmission
applications.
Performance evaluation of modified modular exponentiation for rsa algorithmeSAT Journals
Abstract
Authentication is a very important application of public-key cryptography. Cryptographic algorithms make use of secret keys
known to send and receive information. When the keys are known the encryption / decryption process is an easy task, however
decryption will be impossible without knowing the correct key. The shared public key is managed by the sender, to produce a
message authentication code (MAC) for every transmitted message. There are many algorithms to enable security for message
authentication (secret key). RSA is one such best algorithm for public key based message authentication approaches. But it takes
more time for encryption and/or decryption process, when it has large key length. This research work evaluates the performance
of RSA algorithm with modified modular exponentiation technique for message authentication. As a result modified modular
exponent based RSA algorithm reduces execution time for encryption and decryption process.
Key Words: Cryptography, Message authentication, RSA, Modular Exponentiation.
Secure E-voting System by Utilizing Homomorphic Properties of the Encryption ...TELKOMNIKA JOURNAL
The use of cryptography in the e-voting system to secure data is a must to ensure the authenticity
of the data. In contrast to common encryption algorithms, homomorphic encryption algorithms had unique
properties that can perform mathematical operations against ciphertext. This paper proposed the use of
the Paillier and Okamoto-Uchiyama algorithms as two homomorphic encryption algorithms that have the
additional properties so that it can calculate the results of voting data that has been encrypted without
having to be decrypted first. The main purpose is to avoid manipulation and data falsification during vote
tallying process by comparing the advantages and disadvantages of each algorithm.
Scalable Rough C-Means clustering using Firefly algorithm..................................................................1
Abhilash Namdev and B.K. Tripathy
Significance of Embedded Systems to IoT................................................................................................. 15
P. R. S. M. Lakshmi, P. Lakshmi Narayanamma and K. Santhi Sri
Cognitive Abilities, Information Literacy Knowledge and Retrieval Skills of Undergraduates: A
Comparison of Public and Private Universities in Nigeria ........................................................................ 24
Janet O. Adekannbi and Testimony Morenike Oluwayinka
Risk Assessment in Constructing Horseshoe Vault Tunnels using Fuzzy Technique................................ 48
Erfan Shafaghat and Mostafa Yousefi Rad
Evaluating the Adoption of Deductive Database Technology in Augmenting Criminal Intelligence in
Zimbabwe: Case of Zimbabwe Republic Police......................................................................................... 68
Mahlangu Gilbert, Furusa Samuel Simbarashe, Chikonye Musafare and Mugoniwa Beauty
Analysis of Petrol Pumps Reachability in Anand District of Gujarat ....................................................... 77
Nidhi Arora
Multiple Encryption using ECC and Its Time Complexity AnalysisIJCERT
Rapid growth of information technology in present era, secure communication, strong data encryption technique and trusted third party are considered to be major topics of study. Robust encryption algorithm development to secure sensitive data is of great significance among researchers at present. The conventional methods of encryption used as of today may not sufficient and therefore new ideas for the purpose are to be design, analyze and need to be fit into the existing system of security to provide protection of our data from unauthorized access. An effective encryption/ decryption algorithm design to enhance data security is a challenging task while computation, complexity, robustness etc. are concerned. The multiple encryption technique is a process of applying encryption over a single encryption process in a number of iteration. Elliptic Curve Cryptography (ECC) is well known and well accepted cryptographic algorithm and used in many application as of today. In this paper, we discuss multiple encryptions and analyze the computation overhead in the process and study the feasibility of practical application. In the process we use ECC as a multiple-ECC algorithm and try to analyze degree of security, encryption/decryption computation time and complexity of the algorithm. Performance measure of the algorithm is evaluated by analyzing encryption time as well as decryption time in single ECC as well as multiple-ECC are compared with the help of various examples.
A new RSA public key encryption scheme with chaotic maps IJECEIAES
Public key cryptography has received great attention in the field of information exchange through insecure channels. In this paper, we combine the Dependent-RSA (DRSA) and chaotic maps (CM) to get a new secure cryptosystem, which depends on both integer factorization and chaotic maps discrete logarithm (CMDL). Using this new system, the scammer has to go through two levels of reverse engineering, concurrently, so as to perform the recovery of original text from the cipher-text has been received. Thus, this new system is supposed to be more sophisticated and more secure than other systems. We prove that our new cryptosystem does not increase the overhead in performing the encryption process or the decryption process considering that it requires minimum operations in both. We show that this new cryptosystem is more efficient in terms of performance compared with other encryption systems, which makes it more suitable for nodes with limited computational ability.
CFD Simulation of By-pass Flow in a HRSG module by R&R Consult.pptxR&R Consult
CFD analysis is incredibly effective at solving mysteries and improving the performance of complex systems!
Here's a great example: At a large natural gas-fired power plant, where they use waste heat to generate steam and energy, they were puzzled that their boiler wasn't producing as much steam as expected.
R&R and Tetra Engineering Group Inc. were asked to solve the issue with reduced steam production.
An inspection had shown that a significant amount of hot flue gas was bypassing the boiler tubes, where the heat was supposed to be transferred.
R&R Consult conducted a CFD analysis, which revealed that 6.3% of the flue gas was bypassing the boiler tubes without transferring heat. The analysis also showed that the flue gas was instead being directed along the sides of the boiler and between the modules that were supposed to capture the heat. This was the cause of the reduced performance.
Based on our results, Tetra Engineering installed covering plates to reduce the bypass flow. This improved the boiler's performance and increased electricity production.
It is always satisfying when we can help solve complex challenges like this. Do your systems also need a check-up or optimization? Give us a call!
Work done in cooperation with James Malloy and David Moelling from Tetra Engineering.
More examples of our work https://www.r-r-consult.dk/en/cases-en/
Welcome to WIPAC Monthly the magazine brought to you by the LinkedIn Group Water Industry Process Automation & Control.
In this month's edition, along with this month's industry news to celebrate the 13 years since the group was created we have articles including
A case study of the used of Advanced Process Control at the Wastewater Treatment works at Lleida in Spain
A look back on an article on smart wastewater networks in order to see how the industry has measured up in the interim around the adoption of Digital Transformation in the Water Industry.
Sachpazis:Terzaghi Bearing Capacity Estimation in simple terms with Calculati...Dr.Costas Sachpazis
Terzaghi's soil bearing capacity theory, developed by Karl Terzaghi, is a fundamental principle in geotechnical engineering used to determine the bearing capacity of shallow foundations. This theory provides a method to calculate the ultimate bearing capacity of soil, which is the maximum load per unit area that the soil can support without undergoing shear failure. The Calculation HTML Code included.
Student information management system project report ii.pdfKamal Acharya
Our project explains about the student management. This project mainly explains the various actions related to student details. This project shows some ease in adding, editing and deleting the student details. It also provides a less time consuming process for viewing, adding, editing and deleting the marks of the students.
Saudi Arabia stands as a titan in the global energy landscape, renowned for its abundant oil and gas resources. It's the largest exporter of petroleum and holds some of the world's most significant reserves. Let's delve into the top 10 oil and gas projects shaping Saudi Arabia's energy future in 2024.
About
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Technical Specifications
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
Key Features
Indigenized remote control interface card suitable for MAFI system CCR equipment. Compatible for IDM8000 CCR. Backplane mounted serial and TCP/Ethernet communication module for CCR remote access. IDM 8000 CCR remote control on serial and TCP protocol.
• Remote control: Parallel or serial interface
• Compatible with MAFI CCR system
• Copatiable with IDM8000 CCR
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
Application
• Remote control: Parallel or serial interface.
• Compatible with MAFI CCR system.
• Compatible with IDM8000 CCR.
• Compatible with Backplane mount serial communication.
• Compatible with commercial and Defence aviation CCR system.
• Remote control system for accessing CCR and allied system over serial or TCP.
• Indigenized local Support/presence in India.
• Easy in configuration using DIP switches.
Hybrid optimization of pumped hydro system and solar- Engr. Abdul-Azeez.pdffxintegritypublishin
Advancements in technology unveil a myriad of electrical and electronic breakthroughs geared towards efficiently harnessing limited resources to meet human energy demands. The optimization of hybrid solar PV panels and pumped hydro energy supply systems plays a pivotal role in utilizing natural resources effectively. This initiative not only benefits humanity but also fosters environmental sustainability. The study investigated the design optimization of these hybrid systems, focusing on understanding solar radiation patterns, identifying geographical influences on solar radiation, formulating a mathematical model for system optimization, and determining the optimal configuration of PV panels and pumped hydro storage. Through a comparative analysis approach and eight weeks of data collection, the study addressed key research questions related to solar radiation patterns and optimal system design. The findings highlighted regions with heightened solar radiation levels, showcasing substantial potential for power generation and emphasizing the system's efficiency. Optimizing system design significantly boosted power generation, promoted renewable energy utilization, and enhanced energy storage capacity. The study underscored the benefits of optimizing hybrid solar PV panels and pumped hydro energy supply systems for sustainable energy usage. Optimizing the design of solar PV panels and pumped hydro energy supply systems as examined across diverse climatic conditions in a developing country, not only enhances power generation but also improves the integration of renewable energy sources and boosts energy storage capacities, particularly beneficial for less economically prosperous regions. Additionally, the study provides valuable insights for advancing energy research in economically viable areas. Recommendations included conducting site-specific assessments, utilizing advanced modeling tools, implementing regular maintenance protocols, and enhancing communication among system components.
2. 36 Computer Science & Information Technology (CS & IT)
improved of Zhang’s scheme in which the original message matrix is multiplied by two prime
matrices with the same length of the original message. Next for the resulting matrix hash value is
calculated to determine which digital signature it is. Afterwards, the checksum calculated for
each row and column is inserted at the end of the original matrix. The hash value is appended to
the last position of the matrix. The resulting (m+1) × (n+1) matrix is converted into ciphertext
and sent to the desired user. They showed that a pernicious client cannot forge a valid message
with the same signature by permuting the rows and columns in the matrix.
In 2013, Shreenath Acharya, Sunaina Kotekar and Seema S Joshi [4] have improved the
mechanism of Iuon-Chang Lei et. Al with providing extra security by making use of transpose
matrix based on the RSA. If a malicious looks into the message he will find it difficult to
understand or calculate checksum/ hash value, thus it will confuse the malicious. To keep the
confidentiality of the data that transfers over a public network R. Rivest et. al [5] have proposed
RSA technique as a public key cryptosystems. According to the proposed scheme, the sender can
use the receiver’s public key to encrypt a message and the receiver can use his secret key to
decrypt the encrypted message. Also, they conveyed that a message can be signed with the secret
key of the sender and the signature can be verified by any receiver using the sender’s public key.
As a result the RSA technique is useful in keeping the confidentiality of the transmitted message,
verifying the integrity of the received message, and to prove the sender’s identity.
In 2014, [6] Nikita Somani and Dharmendra Mangal have proposed a new security scheme for
the RSA cryptosystem contains three prime numbers and overcome several attacks possible on
RSA. The new scheme has a speed improvement on the RSA decryption side by using the
Chinese Reminder Theorem (CRT). This paper addresses a secure and efficient digital signature
scheme with fault tolerance based on the improved RSA system. The remaining parts of this
paper are organized as follows: In Section 2, we elaborate Improved of Zhang’s scheme. Next,
we discuss the improved of the standard RSA in Section 3. In Section 4, we proposed our
scheme. We analyze the security properties and common attacks of our proposed scheme in
Section 5. Finally, in Section 6, we give our conclusion.
2. IMPROVED VERSION OF ZHANG’S SCHEME
Improved version of Zhang’s digital signature scheme [4] with fault tolerance is based on the
RSA cryptography. In the RSA cryptography, each user provides a public key (e, N) and a
secret key d, where N is the product of two large prime numbers p and q such that ܰ = × ,ݍ
and the public key e and secret key d must satisfy the equation ݀ = ݁ିଵ
( − 1)(ݍ − 1). Let
(݁, ܰ) and (݁, ܰ) be the public keys of user A and user B, ݀ and ݀ are their secret keys.
Moreover, assume ܰ ≠ ܰ and the length of ܰ and ܰ are the same for simplification. An
improved algorithm is as shown. Here the original message matrix is not directly encrypted. But
the transpose of the message matrix is taken and then encrypted. As observed in the result part
though anyone tries to decrypt the message it is not the clear message line by line. Suppose that
user B wants to send a message X to user A,
Algorithm 1:
Step1: User B sends an n×m message matrix to X user A:
3. Computer Science & Information Technology (CS & IT) 37
ܺ = ቌ
ݔଵଵ ݔଵଶ … ݔଵ
ݔଶଵ
⋮
ݔଶଶ
⋮
…
⋱
ݔଶ
⋮
ݔଵ ݔଶ … ݔ
ቍ
Where ݔ, 1 ≤ ݅ ≤ ݊, 1 ≤ ݆ ≤ ݉, is a message block which has the same length as N and N
Step 2: Now we take the transpose of the original matrix:
ܶ = ൮
ݐଵଵ ݐଵଶ … ݐଵ
ݐଶଵ
⋮
ݐଶଶ
⋮
…
⋱
ݐଶ
⋮
ݐଵ ݐଶ … ݐ
൲ = ቌ
ݔଵଵ ݔଶଵ … ݔଵ
ݔଵଶ
⋮
ݔଶଶ
⋮
…
⋱
ݔଶ
⋮
ݔଵ ݔଶ … ݔ
ቍ
Step 3: User B then creates two prime number matrix P and Q as follows:
ܲ = ቌ
ଵ ଶ …
ଵ
⋮
ଶ
⋮
…
⋱
⋮
ଵ ଶ …
ቍ , ܳ = ቌ
ݍଵ ݍଵ … ݍଵ
ݍଶ
⋮
ݍଶ
⋮
…
⋱
ݍଶ
⋮
ݍ ݍ … ݍ
ቍ
Where matrix P and Q both have the same dimensions with the message matrix T, which is a
(m × n) matrix.
Step 4: The sender B computes a new message matrix ܺത which is the entry-wise product of the
matrix T, P and Q:
ܶത = ൮
ݐଵଵ ݐଵଶ … ݐଵ
ݐଶଵ
⋮
ݐଶଶ
⋮
…
⋱
ݐଶ
⋮
ݐଵ ݐଶ … ݐ
൲ ቌ
ଵ ଶ …
ଵ
⋮
ଶ
⋮
…
⋱
⋮
ଵ ଶ …
ቍ ቌ
ݍଵ ݍଵ … ݍଵ
ݍଶ
⋮
ݍଶ
⋮
…
⋱
ݍଶ
⋮
ݍ ݍ … ݍ
ቍ
= ൮
ݐଵଵ × ଵ × ݍଵ ݐଵଶ × ଶ × ݍଵ … ݐଵ × × ݍ
ݐଶଵ × ଵ × ݍଶ
⋮
ݐଶଶ × ଶ × ݍଶ
⋮
…
⋱
ݐଶ × × ݍ
⋮
ݐଵ × ଵ × ݍ ݐଶ × ଶ × ݍ … ݐ × × ݍ
൲
= ൮
ݐ̅ଵଵ ݐ̅ଵଶ … ݐ̅ଵ
ݐ̅ଶଵ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ ݐ̅ଶ … ݐ̅
൲
Step 5: For the message matrix ܶഥ , the sender B now constructs an (n+1)*(m+1) matrix ܶ as
follows:
ܶ =
ۉ
ۈ
ۇ
ݐ̅ଵଵ ݐ̅ଵଶ … ݐ̅ଵ
ݐ̅ଶଵ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ
ܶଵ
ݐ̅ଶ
ܶଶ
…
…
ݐ̅
ܶ
ܶଵ
ܶଶ
⋮
ܶ
ℎ ی
ۋ
ۊ
Where,
4. 38 Computer Science & Information Technology (CS & IT)
ܶ = ෑ ݐ ∗ ݉݀ ܰ , ݂ݎ 1 ≤ ݅ ≤ ݉ ,
ୀଵ
ܶ = ෑ ݐ ∗ ݍ ݉݀ ܰ , ݂ݎ 1 ≤ ݆ ≤ ݊ ܽ݊݀
ୀଵ
ℎ = ෑ ൭ෑ ݐ ݉݀ ܰ
ୀଵ
൱ ݉݀ ܰ
ୀଵ
Step 6: The sender B computes an (n+1)*(m+1) ciphered matrix as follows:
ܥ =
ۉ
ۈ
ۇ
ܿଵଵ ܿଵଶ … ܿଵ
ܿଶଵ
⋮
ܿଶଶ
⋮
…
⋱
ܿଶ
⋮
ܿଵ
ܿଵ
ܿଶ
ܿଶ
…
…
ܿ
ܿ
ܿଵ
ܿଶ
⋮
ܿ
ℎ ی
ۋ
ۊ
Where,
ܿ = ݐ̅
ಲ
݉݀ ܰ, ܥ = ܶ
ಲ݉݀ ܰ, ܥ = ܶ
ಲ݉݀ ܰ, ℎ = ℎௗಳ݉݀ ܰ , for all
1 ≤ ݅ ≤ ݊, 1 ≤ ݆ ≤ ݉
Note that ܶ and ܶ are the checksums and ܥ and ܥ are the ciphered checksums.
Step 7: The receiver A uses his/her secret key d to decrypt C୦ and obtains decrypted message as
follows:
ܶത =
ۉ
ۈ
ۇ
ݐ̅ଵଵ ݐ̅ଵଶ … ݐ̅ଵ
ݐ̅ଶଵ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ
ܶതଵ
ݐ̅ଶ
ܶതଶ
…
…
ݐ̅
ܶത
ܶതଵ
ܶതଶ
⋮
ܶത
ℎത ی
ۋ
ۊ
Step 8: Now the receiver A verify the checksum to check the following:
ܶത = ෑ ݐ̅ ∗ ݉݀ ܰ , ݂ݎ 1 ≤ ݅ ≤ ݉
ୀଵ
ܶത = ෑ ݐ̅ ∗ ݍ ݉݀ ܰ , ݂ݎ 1 ≤ ݆ ≤ ݊
ୀଵ
ℎത = ෑ ൭ෑ ݐ̅ ݉݀ ܰ
ୀଵ
൱ ݉݀ ܰ
ୀଵ
If the verifications are positive, then the receiver believes that the message was not altered during
the transmission. Otherwise, there are some errors in the decrypted message.
Step 9: Then user A can detect the error by the following two equations
ܶത ≠ ෑ ݐ̅ ∗ ݉ܰ݀ , ݂ݎ 1 ≤ ݅ ≤ ݉
ୀଵ
5. Computer Science & Information Technology (CS & IT) 39
ܶത ≠ ෑ ݐ̅ ∗ ݍ ݉ܰ݀ , ݂ݎ 1 ≤ ݆ ≤ ݊
ୀଵ
Assuming that the error occurs in the message block ݐ̅ then, user A can correct the error by
computing one of the following equations:
ݐ̅ = ܶത × ቌ ෑ ݐ̅
ୀଵ,ஷ
ቍ
ିଵ
݉݀ ܰ
ݐ̅ = ܶത × ൭ ෑ ݐ̅
ୀଵ,ஷ
൱
ିଵ
݉݀ ܰ
Step 10: The receiver A takes the transpose of the matrix which will result in message as follows:
ܺ = ൮
ݐ̅ଵଵ ݐ̅ଶଵ … ݐ̅ଵ
ݐ̅ଵଶ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ ݐ̅ଶ … ݐ̅
൲ = ൮
̅ݔଵଵ ̅ݔଵଶ … ̅ݔଵ
̅ݔଶଵ
⋮
̅ݔଶଶ
⋮
…
⋱
̅ݔଶ
⋮
̅ݔଵ ̅ݔଶ … ̅ݔ
൲
3. IMPROVEMENTS OVER THE STANDARD RSA
The improved RSA scheme provides an enhancement of the Hamami and Aldariseh [7] method
by improving the speed on the RSA decryption side and also provides the security by avoiding
some attacks possible on RSA. If the same message is encrypted more than one time it will look
different every time by using the random number k. The general idea of the improved scheme is
to use the Key generation algorithm of Hamami and Aldariseh method and proposed a scheme for
encryption and decryption algorithm. The existence of three prime numbers, the difficulty of
analysis of variable n must be increases and the key generation time must be reduces. The
algorithm for the proposed scheme is as follows:
3.1 Key Generation for Improved RSA Scheme
To generate the key using three prime numbers, user B should do the following:
a) Generate three large prime numbers p, q, and s.
b) Calculate ݊ = × ݍ × ݏ ܽ݊݀ ߮(݊) = ( − 1)(ݍ − 1)(ݏ − 1).
c) Select e such that (݁, ߮(݊))are relatively co-prime.
d) Get the value of d by using ݁݀ ݉݀ ߮(݊) = 1.
e) Find ݀ = ݀ ݉(݀ − 1), ݀ = ݀ ݉ݍ(݀ − 1), ݀௦ = ݀ ݉ݏ(݀ − 1).
f) Public Key ܭ௨ < ݁, ݊ > and Private Key ܭ < ݀, , ,ݍ ,ݏ ݀, ݀, ݀௦ >.
3.2 Encryption Algorithm
To encrypt the message M user A should do the following:
User A should obtained the public key of user B <e, n>
a) Represent the message M as an integer form in interval [0 to n-1].
b) Select k as a random integer ,݇(ܦܥܩ ݊) = 1 and 1< k < n-1.
c) Compute C1=݇
݉݀ ݊.
6. 40 Computer Science & Information Technology (CS & IT)
d) Compute C2=ܯ
݇ ݉݀ ݊.
e) Send the cipher text values (C1, C2) to user A
3.3 Decryption Algorithm
On decryption process the concept of RSA is used with CRT. To recover the message from
cipher text C2 user A should do the following:
a) Calculate ܥ = 1ܥ ݉݀ , ܥ = 1ܥ ݉݀ ,ݍ ܥ௦ = 1ܥ ݉݀ ݏ and then calculate
݇ = ܥ
ௗ
݉݀ , ݇ = ܥ
ௗ
݉݀ ݍ ܽ݊݀ ݇௦ = ܥ௦
ௗೞ
݉݀ .ݏ
b) By using the formula calculate k
݇ = [ ݇. ()ݏݍ(ିଵ)
݉݀ ݊ + ݇. ()ݏ(ିଵ)
݉݀ ݊ + ݇௦. ()ݍ(௦ିଵ)
݉݀ ݊].
c) By using the Euclidean algorithm, calculate the value of the unique integer
ݐ ∗ ݇ ݉݀ ݊ = 1 and 1< t < n.
d) Then compute ܯ
, C2*t = (ܯ
.k)*t = (ܯ
) k*t = ܯ
݉݀ ݊.
e) For getting the value of message M should do the following steps
First calculate ܥሗ = ܯ
݉݀ , ܥሗ = ܯ
݉݀ ,ݍ ܥሗ௦ = ܯ
݉݀ ݏ and then calculate
ܯ = ܥሗ ݉݀ , ܯ = ܥሗ ݉݀ ݍ , ܯ௦ = ܥሗ௦ ݉݀ .ݏ
f) Finally, recover the message M by using the following formula:
ܯ = [ ܯ. ()ݏݍ(ିଵ)
݉݀ ݊ + ܯ. ()ݏ(ିଵ)
݉݀ ݊ + ܯ௦. ()ݍ(௦ିଵ)
݉݀ ݊].
4. PROPOSED SCHEME
We propose a secure and efficient digital signature scheme with fault tolerance based on the
improved RSA system. In the RSA cryptography, each user provides a public key (e, N) and a
secret key d, where N is the product of three large prime numbers , ݍ ܽ݊݀ ݏ such that ܰ = ×
ݍ × ,ݏ and the public key e and secret key d must satisfy the equation ݀ = ݁ିଵ
( − 1)(ݍ −
1)(ݏ − 1).
Algorithm 2:
Step 1to5: Same as Algorithm 1
Step 6: Compute the following ciphertext matrix:
a) Select k as a random integer ,݇(ܦܥܩ ܰ) = 1 and 1< k < ܰ − 1.
b) Compute C1 = ݇ಲ ݉݀ ܰ .
c) Compute C2 = ܶ
ಲ݇ ݉݀ ܰ .
2ܥ =
ۉ
ۈ
ۇ
ܿଵଵ ܿଵଶ … ܿଵ
ܿଶଵ
⋮
ܿଶଶ
⋮
…
⋱
ܿଶ
⋮
ܿଵ
ܿଵ
ܿଶ
ܿଶ
…
…
ܿ
ܿ
ܿଵ
ܿଶ
⋮
ܿ
ℎ ی
ۋ
ۊ
∗ ݇
Where,
ܿ = ݐ̅
ಲ
݉݀ ܰ, ܥ = ܶ
ಲ݉݀ ܰ, ܥ = ܶ
ಲ ݉݀ ܰ, ℎ = ℎௗಳ݉݀ ܰ,
for all 1 ≤ ݅ ≤ ݊, 1 ≤ ݆ ≤ ݉
d) Send the cipher text values (C1, C2) to user A
Step 7: To recover the message ܶ from cipher text C2 user A should do the following:
a) Calculate ܥ = 1ܥ ݉݀ , ܥ = 1ܥ ݉݀ ,ݍ ܥ௦ = 1ܥ ݉݀ ݏ and then calculate
7. Computer Science & Information Technology (CS & IT) 41
݇ = ܥ
ௗ
݉݀ , ݇ = ܥ
ௗ
݉݀ ݍ ܽ݊݀ ݇௦ = ܥ௦
ௗೞ
݉݀ .ݏ
b) By using the formula calculate k
݇ = [ ݇. ()ݏݍ(ିଵ)
݉݀ ܰ + ݇. ()ݏ(ିଵ)
݉݀ ܰ + ݇௦. ()ݍ(௦ିଵ)
݉݀ ܰ ].
c) By using the Euclidean algorithm, calculate the value of the unique integer t, ݐ ∗
݇ ݉݀ ܰ = 1 and 1< t <ܰ.
d) Then compute ܶ
ಲ, C2*t = (ܶ
ಲ.k)*t = (ܶ
ಲ) k*t = ܶ
ಲ ݉݀ ܰ .
e) For getting the value of message M should do the following steps
First calculate ܥሗ = ܶ
ಲ ݉݀ , ܥሗ = ܶ
ಲ ݉݀ ,ݍ ܥሗ௦ = ܶ
ಲ
݉݀ ݏ and then calculate
ܶ = ܥሗ ݉݀ , ܶ = ܥሗ ݉݀ ݍ , ܶ௦ = ܥሗ௦ ݉݀ .ݏ
f) Finally, recover the message ܶ by using the following formula:
ܶ = [ ܶ. ()ݏݍ(ିଵ)
݉݀ ܰ + ܶ. ()ݏ(ିଵ)
݉ܰ݀ + ܶ௦. ()ݍ(௦ିଵ)
݉݀ ܰ].
ܶത =
ۉ
ۈ
ۇ
ݐ̅ଵଵ ݐ̅ଵଶ … ݐ̅ଵ
ݐ̅ଶଵ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ
ܶതଵ
ݐ̅ଶ
ܶതଶ
…
…
ݐ̅
ܶത
ܶതଵ
ܶതଶ
⋮
ܶത
ℎത ی
ۋ
ۊ
Step 8: Now the receiver A verify the checksum to check the following:
ܶത = ෑ ݐ̅ ∗ ݉݀ ܰ , ݂ݎ 1 ≤ ݅ ≤ ݉
ୀଵ
ܶത = ෑ ݐ̅ ∗ ݍ ݉݀ ܰ , ݂ݎ 1 ≤ ݆ ≤ ݊
ୀଵ
ℎത = ෑ ൭ෑ ݐ̅ ݉݀ ܰ
ୀଵ
൱ ݉݀ ܰ
ୀଵ
If the verifications are positive, then the receiver believes that the message was not altered during
the transmission.
Step 9: The receiver A takes the transpose of the matrix which will result in message as follows:
ܺത = ൮
ݐ̅ଵଵ ݐ̅ଶଵ … ݐ̅ଵ
ݐ̅ଵଶ
⋮
ݐ̅ଶଶ
⋮
…
⋱
ݐ̅ଶ
⋮
ݐ̅ଵ ݐ̅ଶ … ݐ̅
൲ = ൮
̅ݔଵଵ ̅ݔଵଶ … ̅ݔଵ
̅ݔଶଵ
⋮
̅ݔଶଶ
⋮
…
⋱
̅ݔଶ
⋮
̅ݔଵ ̅ݔଶ … ̅ݔ
൲
5. SECURITY ANALYSIS
The proposed scheme further provides extra security and speed improvements by making use of
transpose matrix and improve the decryption side of RSA. If an intruder appearance into the
message he can realize it difficult to know or calculate checksum/ hash value therefore it'll
confuse the intruder. Hence this is often a really smart solution for eavesdropping drawback.
Next, we show that our scheme is heuristically secured by considering the following attacks [8].
8. 42 Computer Science & Information Technology (CS & IT)
Common Modulus Attack: The common modulus attack (CMA) [8] can be occurred by using
the same modulus n, when the same message X is encrypted twice and by that attack one can
retrieve the message X algorithm. The CMA is applicable in Iuon-Chang Lei et. al [3] scheme
method because it uses the encryption and decryption as same as original RSA. In the proposed
scheme using a unique integer k by that there are two cipheretext generated and it appears to be
impractical to apply that attack on proposed scheme.
Chosen Cipher Text Attack: Chosen-cipher text attack (CCA) [9] is possible in RSA due to the
multiplicative property of the modular arithmetic [10] following by RSA. That means product of
the two cipher texts is equal to the encryption of the product of the corresponding plaintexts. The
CCA is applicable in both original RSA algorithm, and in the proposed one, but by applying
CCA on the proposed scheme for getting the value of message X, it appears to be complex and
more time consuming as compared to the original RSA algorithm.
Timing Attack: An attacker can determine the value of the private key by maintaining the track
of how much time a computer takes to decrypt the encrypted message this because of Timing
attack that occurs at RSA implementation Kocher [11]. Timing attack is applicable in majority
digital signature fault tolerant schemes based on original RSA algorithm because by measuring
the time for encryption and decryption, and time for key generation one can determine the value
of the secrete key exponent d, but in the proposed scheme by using a random unique integer k in
both the encryption and decryption process makes it difficult to distinguish between the time for
public key e or private key d and the time for k.
Known Plain-Text Attack: If the attacker has known some quantity of plaintext and
corresponding ciphertext, this will refer to known-plaintext attack [12]. The known-plaintext
attack deals with the some known plaintext corresponding to the ciphertext and it is applicable in
the digital signature with fault tolerance based on the original RSA algorithm. But it seems to be
impractical in the proposed scheme because here, generating the two ciphertexts for the one
particular plaintext and if it is applicable to the proposed scheme, it is very difficult to get the
value of particular plaintext by applying these attacks.
6. CONCLUSION
The proposed scheme described in the paper is an attempt to provide a speed improvement on the
decryption side of digital signature scheme fault tolerance based on improving the RSA algorithm
using the concept of the Chinese remainder theorem. The algorithm for the proposed scheme can
protect us from several common attacks. Further, it provides extra security measures by making
use of transpose matrix of the original message.
REFERENCES
[1] C.N. Zhang, “Integrated Approach for Fault Tolerance and Digital Signature in RSA,” IEEE
Proceedings-Computers & Digital Techniques, vol. 146, no. 3, pp. 151-159, 1999
[2] N. Lee and W. Tsai, “Efficient Fault-tolerant Scheme basd on the RSA system,” IEEE Proceedings –
Computer and Digital Techniques, vol. 150, no. 1, pp. 17-20, 2003.
9. Computer Science & Information Technology (CS & IT) 43
[3] Iuon-Chang Lin and Hsing-Lei Wang, “An Improved Digital Signature Scheme with Fault Tolerance
in RSA”, Sixth International Conference on Intelligent Information Hiding and Multimedia Signal
Processing. IEEE, 2010
[4] Shreenath Acharya, Sunaina Kotekar, Seema S Joshi, Shradda Shetty and Supreetha Lobo,”
Implementing Digital Signature based Secured Card System for Online Transactions”, International
Journal of Computer Applications 65(24):27-32, March 2013.
[5] R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-key
Cryptosystems,” Communications of the ACM, vol. 21, no. 2, pp. 120-126, 1978.
[6] Nikita Somani and Dharmendra Mangal, “An Improved RSA Cryptographic System”, International
Journal of Computer Applications 105(16):18-22, November 2014.
[7] A. H. Al-Hamami and I. A. Aldariseh, "Enhanced Method for RSA Cryptosystem Algorithm," IEEE
International Conference on Advanced Computer Science Applications and Technologies, pp. 402-
408, 2012.
[8] D. Boneh, "Twenty Years of Attacks on the RSA Cryptosystem," Notices of the AMS, vol. 46, no. 2,
pp. 203-213, 1999.
[9] Y. Desmedt and A. M. Odlyzko, "A Chosentext Attack on RSA Cryptosystem and some Discrete
Logarithm Schemes," Advances in Cryptology CRYPTO ’85, vol. 218, pp. 5116-521, 1986.
[10] R. Kumar, "Security Analysis and Implementation of an Improved Cch2 Proxy Multi-Signature
Scheme," International journal of computer network and Information security, vol. 4, pp. 46-54,
2014.
[11] P. C. Kocher, "Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other
Systems," Advances in Cryptology-CRYPTO '96, pp. 104-113, 1996.
[12] R. C. Merkle, "Secure Communications over Insecure Channels," Communications of the ACM, vol.
21, no. 4, pp. 294-299, 1978.
AUTHORS
H. Elkamchouchi obtained his B.Sc Electrical Communication Engineering - Excellent
with First Class Honors - Faculty of Engineering – Alexandria University - June 1966,
Master Communications Engineering (specialization accurate: antennas and propagation)
Faculty of Engineering – Alexandria University - September 1969, B.Sc of Science in
Applied Mathematics - Excellent with honors - Britain's Royal College of Science -
University of London - England - August 1970, Doctor Communications Engineering
(specialization accurate: antennas and propagation) - Faculty of Engineering - Alexandria University -
March 1972. He work Professor Emeritus, Faculty of Engineering, Alexandria University from September
2003 until now.
Heba Gaber held a Masters' of science in Electrical Engineering from Faculty of
Engineering, Arab Academy for Science and Technology. She works on Arab Academy
for Science and Technology. She studies for Ph.D. in Electrical Engineering from Faculty
of Engineering, Alexandria University.
10. 44 Computer Science & Information Technology (CS & IT)
Fatma Ahmed held a Masters' of science in Electrical Engineering from Faculty of
Engineering, Alexandria University. She works on Alexandria Higher Institute of
Engineering and Technology. She Held a Ph.D. in Electrical Engineering from Faculty of
Engineering, Alexandria University.
Dalia ElKamchouchi held a Masters' of science in Electrical Engineering from Faculty of
Engineering, Alexandria University. She works on Alexandria Higher Institute of
Engineering and Technology. She Held a Ph.D. in Electrical Engineering from Faculty of
Engineering, Alexandria University.