Now-a-days the usage of internet increases tremendously so, there is a need of security for the data. Cryptography
is a process of scrambling the data into unknown format which provides security to the data. Modern cryptography is mainly based on mathematical theory and computer science practice. Cryptography process is
done with the help of encryption and decryption. The basic two ideas behind the cryptography technique are substitution and transposition. This paper presents a multistage encryption algorithm. At the end of each stage an intermediate cipher is produced. The key is generated by using SEEDED SDES algorithm. Final cipher text is derived from the local binary pattern (LBP).
Securing the cloud computing systems with matrix vector and multi-key using l...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Countsacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
DYNAMIC SESSION KEY EXCHANGE METHOD USING TWO S-BOXESIJCSEA Journal
This paper presents modifications of the Diffie-Hellman (DH) key exchange method. The presented modifications provide better security than other key exchange methods. We are going to present a dynamic security that simultaneously realizes all the three functions with a high efficiency and then give a security analysis. It also presents secure and dynamic key exchange method. Signature, encryption and key exchange are some of the most important and foundational Crypto-graphical tools. In most cases, they are all needed to provide different secure functions. On the other hand, there are also some proposals on the efficient combination of key exchange. In this paper, we present a dynamic, reliable and secure method for the exchange of session key. Moreover, the proposed modification method could achieve better performance efficiency.
Different types of Authentications described in different scenarios. Basically a survey paper on Different kinds of authentications in different scenarios.
Encryption is a technique that transforms a code from an understandable into an incomprehensible code. Many methods can be applied to an encryption process. One such method is RSA. RSA works by appointing on byte values. The value is obtained from character conversion to ASCII code. This algorithm is based on the multiplication of two relatively large primes. Applications of the RSA algorithm can be used in data security. This research provides RSA algorithm application on data security system that can guarantee data confidentiality. RSA algorithm is known as a very secure algorithm. This algorithm works with the number of bits in the search for prime numbers. The larger the bits, the less chance of ciphertext can be solved. The weakness of this method is the amount of ciphertext capacity will be floating in line with the number of prime numbers used. Also, to perform the process of encryption and decryption, RSA requires a relatively long time than other algorithms. The advantage of RSA is that complicated ciphertext is solved into plaintext.
Securing the cloud computing systems with matrix vector and multi-key using l...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Symmetric-Key Based Privacy-Preserving Scheme For Mining Support Countsacijjournal
In this paper we study the problem of mining support counts using symmetric-key crypto which is more
efficient than previous work. Consider a scenario that each user has an option (like or unlike) of the
specified product, and a third party wants to obtain the popularity of this product. We design a much more
efficient privacy-preserving scheme for users to prevent the loss of the personal interests. Unlike most
previous works, we do not use any exponential or modular algorithms, but we provide a symmetric-key
based method which can also protect the information. Specifically, our protocol uses a third party that
generates a number of matrixes as each user’s key. Then user uses these key to encrypt their data which is
more efficient to obtain the support counts of a given pattern.
DYNAMIC SESSION KEY EXCHANGE METHOD USING TWO S-BOXESIJCSEA Journal
This paper presents modifications of the Diffie-Hellman (DH) key exchange method. The presented modifications provide better security than other key exchange methods. We are going to present a dynamic security that simultaneously realizes all the three functions with a high efficiency and then give a security analysis. It also presents secure and dynamic key exchange method. Signature, encryption and key exchange are some of the most important and foundational Crypto-graphical tools. In most cases, they are all needed to provide different secure functions. On the other hand, there are also some proposals on the efficient combination of key exchange. In this paper, we present a dynamic, reliable and secure method for the exchange of session key. Moreover, the proposed modification method could achieve better performance efficiency.
Different types of Authentications described in different scenarios. Basically a survey paper on Different kinds of authentications in different scenarios.
Encryption is a technique that transforms a code from an understandable into an incomprehensible code. Many methods can be applied to an encryption process. One such method is RSA. RSA works by appointing on byte values. The value is obtained from character conversion to ASCII code. This algorithm is based on the multiplication of two relatively large primes. Applications of the RSA algorithm can be used in data security. This research provides RSA algorithm application on data security system that can guarantee data confidentiality. RSA algorithm is known as a very secure algorithm. This algorithm works with the number of bits in the search for prime numbers. The larger the bits, the less chance of ciphertext can be solved. The weakness of this method is the amount of ciphertext capacity will be floating in line with the number of prime numbers used. Also, to perform the process of encryption and decryption, RSA requires a relatively long time than other algorithms. The advantage of RSA is that complicated ciphertext is solved into plaintext.
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.
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.
AN EFFICIENT AND SECURE DIGITAL MULTI-SIGNATURE PROTOCOL BASED ON ECCijcisjournal
Digital Signatures play a crucial role today as it ensures authentication, integrity and non-repudiation of a digital message. Many researches are ongoing based on elliptic curve cryptography due to its significant high performance. In this paper we propose an efficient and secure digital multi-signature protocol based on elliptic curve cryptography. The proposed protocol is efficient with reduced time complexity as compared to Chen et al.[14], Sahu and Sharma [18] and Chande and Thakur’s [20] digital multi-signature schemes. Also the proposed protocol overcomes the insider attack as specified by Liu et al. [19] in the Chen et.al’s digital multi-signature scheme.
PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLESIJNSA Journal
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step with the cost lower than signature-then-encryption approach. Recently, Li et al. [35] proposed the first provable secure identity based signcryption without random oracles. In their scheme sender signs the ciphertext. However, in [11] Boyen showed that non-repudiation is easily achieved if the sender sign the plaintext rather than ciphertext. In this paper we proposed an identity based signcryption scheme without random oracles, which provides the non-repudiation with respect to plaintext. We also proposed an identity based public verifiable signcryption scheme with third party verification in the standard model.
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
A PAIRING-FREE IDENTITY BASED TRIPARTITE SIGNCRYPTION SCHEMEijcisjournal
The certificate-based cryptosystems is traditional way in providing the system parameters. Identity-based
cryptography is more efficient than certificate-based cryptosystems. Each user in identity-based
cryptography uses any arbitrary string that uniquely identifies him as his public key. This paper proposes
a new identity-based tripartite signcryption scheme based on the elliptic curve discrete logarithm problem.
The proposed id-based tripartite signcryption scheme does not use the bilinear pairings in both the
Signcryption and unsigncryption phases. The proposed scheme used to reduce the communication over
head when three entities wants to communicate securely as in authentication protocol in GSM and in ecommerce.
The proposed scheme satisfies various desirable security properties. Also, the performance of
the proposed scheme is tested.
A performance comparison of proposed approach of multiserver authentication a...eSAT Journals
Abstract
Use of smart card makes remote user verification and key agreement easy, elastic to making a secure scattered system environment. It is very important to provide user privacy protection in authentication phase. In this paper, we are describing the performance comparison of Jung approach for multiple server authentication and key agreement schemes with user protection in network security with our proposed approach. First we are describing the jaung approach then overview of our approach with comparison. All the areas those can be improved by us are also defined. Our approach is works for single server as well as multi sever environment. According to our analysis the jaung approach is open to the element, leak-of-verifier attack and session key discovery attack and smart card loss attack. We are saving data into the server table in form of digital identity, smart card is removed by us, and so the new approach is safe from smart card loss attack.
Keywords: User Verification, Session Key, Comparison, Key Size, Smart Card, Network Security.
Enhanced RSA Cryptosystem based on Multiplicity of Public and Private Keys IJECEIAES
Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys.
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
Key Management, Diffie-Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve
Cryptography, Message Authentication and Hash Functions, Hash and MAC Algorithms
Digital Signatures and Authentication Protocols
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.
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.
AN EFFICIENT AND SECURE DIGITAL MULTI-SIGNATURE PROTOCOL BASED ON ECCijcisjournal
Digital Signatures play a crucial role today as it ensures authentication, integrity and non-repudiation of a digital message. Many researches are ongoing based on elliptic curve cryptography due to its significant high performance. In this paper we propose an efficient and secure digital multi-signature protocol based on elliptic curve cryptography. The proposed protocol is efficient with reduced time complexity as compared to Chen et al.[14], Sahu and Sharma [18] and Chande and Thakur’s [20] digital multi-signature schemes. Also the proposed protocol overcomes the insider attack as specified by Liu et al. [19] in the Chen et.al’s digital multi-signature scheme.
PROVABLE SECURE IDENTITY BASED SIGNCRYPTION SCHEMES WITHOUT RANDOM ORACLESIJNSA Journal
Signcryption is a cryptographic primitive which performs encryption and signature in a single logical step with the cost lower than signature-then-encryption approach. Recently, Li et al. [35] proposed the first provable secure identity based signcryption without random oracles. In their scheme sender signs the ciphertext. However, in [11] Boyen showed that non-repudiation is easily achieved if the sender sign the plaintext rather than ciphertext. In this paper we proposed an identity based signcryption scheme without random oracles, which provides the non-repudiation with respect to plaintext. We also proposed an identity based public verifiable signcryption scheme with third party verification in the standard model.
Guillou-quisquater protocol for user authentication based on zero knowledge p...TELKOMNIKA JOURNAL
Authentication is the act of confirming the validity of someone’s personal data. In the traditional
authentication system, username and password are sent to the server for verification. However, this
scheme is not secure, because the password can be sniffed. In addition, the server will keep the user’s
password for the authentication. This makes the system vulnerable when the database server is hacked.
Zero knowledge authentication allows server to authenticate user without knowing the user’s password. In
this research, this scheme was implemented with Guillou-Quisquater protocol. Two login mechanisms
were used: file-based certificate with key and local storage. Testing phase was carried out based on the
Open Web Application Security Project (OWASP) penetration testing scheme. Furthermore, penetration
testing was also performed by an expert based on Acunetix report. Three potential vulnerabilities were
found and risk estimation was calculated. According to OWASP risk rating, these vulnerabilities were at the
medium level.
A PAIRING-FREE IDENTITY BASED TRIPARTITE SIGNCRYPTION SCHEMEijcisjournal
The certificate-based cryptosystems is traditional way in providing the system parameters. Identity-based
cryptography is more efficient than certificate-based cryptosystems. Each user in identity-based
cryptography uses any arbitrary string that uniquely identifies him as his public key. This paper proposes
a new identity-based tripartite signcryption scheme based on the elliptic curve discrete logarithm problem.
The proposed id-based tripartite signcryption scheme does not use the bilinear pairings in both the
Signcryption and unsigncryption phases. The proposed scheme used to reduce the communication over
head when three entities wants to communicate securely as in authentication protocol in GSM and in ecommerce.
The proposed scheme satisfies various desirable security properties. Also, the performance of
the proposed scheme is tested.
A performance comparison of proposed approach of multiserver authentication a...eSAT Journals
Abstract
Use of smart card makes remote user verification and key agreement easy, elastic to making a secure scattered system environment. It is very important to provide user privacy protection in authentication phase. In this paper, we are describing the performance comparison of Jung approach for multiple server authentication and key agreement schemes with user protection in network security with our proposed approach. First we are describing the jaung approach then overview of our approach with comparison. All the areas those can be improved by us are also defined. Our approach is works for single server as well as multi sever environment. According to our analysis the jaung approach is open to the element, leak-of-verifier attack and session key discovery attack and smart card loss attack. We are saving data into the server table in form of digital identity, smart card is removed by us, and so the new approach is safe from smart card loss attack.
Keywords: User Verification, Session Key, Comparison, Key Size, Smart Card, Network Security.
Enhanced RSA Cryptosystem based on Multiplicity of Public and Private Keys IJECEIAES
Security is one of the most important concern to the information and data sharing for companies, banks, organizations and government facilities. RSA is a public cryptographic algorithm that is designed specifically for authentication and data encryption. One of the most powerful reasons makes RSA more secure is that the avoidance of key exchange in the encryption and decryption processes. Standard RSA algorithm depends on the key length only to protect systems. However, RSA key is broken from time to another due to the development of computers hardware such as high speed processors and advanced technology. RSA developers have increased a key length or size of a key periodically to maintain a high security and privacy to systems that are protected by the RSA. In this paper, a method has been designed and implemented to strengthen the RSA algorithm by using multiple public and private keys. Therefore, in this method the security of RSA not only depends on the key size, but also relies on the multiplicity of public and private keys.
Introduction to Public key Cryptosystems with block diagrams
Reference : Cryptography and Network Security Principles and Practice , Sixth Edition , William Stalling
Key Management, Diffie-Hellman Key Exchange, Elliptic Curve Arithmetic, Elliptic Curve
Cryptography, Message Authentication and Hash Functions, Hash and MAC Algorithms
Digital Signatures and Authentication Protocols
International Journal of Engineering and Science Invention (IJESI) is an international journal intended for professionals and researchers in all fields of computer science and electronics. IJESI publishes research articles and reviews within the whole field Engineering Science and Technology, new teaching methods, assessment, validation and the impact of new technologies and it will continue to provide information on the latest trends and developments in this ever-expanding subject. The publications of papers are selected through double peer reviewed to ensure originality, relevance, and readability. The articles published in our journal can be accessed online.
A Survey on Comparisons of Cryptographic Algorithms Using Certain Parameters ...IJECEIAES
he Wireless Sensor Networks (WSNs) have spread its roots in almost every application. Owing to their scattered nature of sensor nodes, they are more prone to attacks. There are certain applications e.g. military, where sensor data‟s confidentiality requirement during transmission is essential. Cryptography has a vital role for achieving security in WSNs.WSN has resource constraints like memory size, processing speed and energy consumption which bounds the applicability of existing cryptographic algorithms for WSN. Any good security algorithms has higher energy consumption by the nodes, so it‟s a need to choose most energy-efficient cryptographic encryption algorithms for WSNs. This paper surveys different asymmetric algorithms such as RSA, Diffie-Hellman, DSA, ECC, hybrid and DNA cryptography. These algorithms are compared based on their key size, strength, weakness, attacks and possible countermeasures in the form of table.
IMPLEMENT A NOVEL SYMMETRIC BLOCK CIPHER ALGORITHMijcisjournal
Cryptography technology is a security technique used to change plain text to another shape of data or to symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey through public networks. Currently, there are many proposed algorithms that provide this service especially for sensitive data or very important conversations either through mobile or video conferences. In this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is compared to the AES. The algorithm has four different rounds for each quarter of the key container table, and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table are big.
Cryptography technology is a security technique used to change plain text to another shape of data or to
symbols, which is known as the cipher text. Cryptography aims to keep the data secure during its journey
through public networks. Currently, there are many proposed algorithms that provide this service
especially for sensitive data or very important conversations either through mobile or video conferences. In
this paper, an inventive security symmetric algorithm is implemented and evaluated, and its performance is
compared to the AES. The algorithm has four different rounds for each quarter of the key container table,
and each of them serves to shift the table. The algorithm uses the XOR operation, which, being lightweight
and cheap, is very appropriate for use with Real Time Applications. The result shows that the suggested
algorithm spends less time than AES although it has 16 rounds and the numbers used to mix up the table
are big.
Implementation Secure Authentication Using Elliptic Curve CryptographyAM Publications
Elliptic curve cryptography is the most efficient public key encryption scheme based on the elliptic curve concepts that
can be used to create faster, smaller, and efficient cryptographic keys. As a use of network increase for critical transaction, so
huge damages are caused by intrusion attacks hence there is the need of computer network security. To protect network against
various active and passive attack, various technique have been suggested. Mobile devices have many differences in their
capabilities, computational powers and security requirements. The security of mobile communication has stopped the list of
concerns for mobile phone users. Confidentiality, Authentication, Integrity and Non-repudiation are required security services for mobile communication.
Today information security is a challenging factor that touches a lot of areas, including computers and communications. Message communication is kept secure through cryptography so that an eavesdropper is not able to decipher a transmitted message. One of the oldest and simplest known algorithms for cryptography is the Caesar cipher algorithm. In this paper, three programs based on Java, C++, and Python languages have been developed to implement the Caesar cipher algorithm to aid information security students and help them understand this fundamental algorithm. A code flow chart is used for each program to describe the code’s flow. It also reveals the sequence of steps for the code’s main methods, as well as the relationships between them. Furthermore, various technical descriptions are presented in detail for each of the methods used in both the encoding and the decoding of the messages.
Pairing Based Elliptic Curve Cryptosystem for Message AuthenticationIJTET Journal
Abstract— Elliptical curve cryptography (ECC) is a public key encryption technique based on elliptic curve theory that can be used to create faster, smaller, and more efficient cryptographic keys. ECC generates keys through the properties of the elliptic curve equation instead of the traditional method of generation as the product of very large prime numbers. Because ECC helps to establish equivalent security with lower computing power and battery resource usage, it is becoming widely used for mobile applications. Recently the bilinear pairing such as Weil Pairing or Tate Pairing on elliptic curves and hyper elliptic curves has been found various applications in cryptography. Several identity-based cryptosystems using bilinear pairings of elliptic curves or hyper elliptic curves were presented. Blind signature and ring signature are very useful to provide the user’s anonymity and the signer’s privacy. The proposed method focuses an ID-based ring signature scheme which is based on the pairings with elliptic curve cryptography. The proposed method is used to reduce the number of computation of the pairing for the verification of the id based signature and also decoding of the id based public key cryptosystems with authentication by factor of 2.
Content-Based Image Retrieval (CBIR) systems have been used for the searching of relevant images in various research areas. In CBIR systems features such as shape, texture and color are used. The extraction of features is the main step on which the retrieval results depend. Color features in CBIR are used as in the color histogram, color moments, conventional color correlogram and color histogram. Color space selection is used to represent the information of color of the pixels of the query image. The shape is the basic characteristic of segmented regions of an image. Different methods are introduced for better retrieval using different shape representation techniques; earlier the global shape representations were used but with time moved towards local shape representations. The local shape is more related to the expressing of result instead of the method. Local shape features may be derived from the texture properties and the color derivatives. Texture features have been used for images of documents, segmentation-based recognition,and satellite images. Texture features are used in different CBIR systems along with color, shape, geometrical structure and sift features.
The cyber attacks have become most prevalent in the past few years. During this time, attackers have discovered new vulnerabilities to carry out malicious activities on the internet. Both the clients and the servers have been victimized by the attackers. Clickjacking is one of the attacks that have been adopted by the attackers to deceive the innocuous internet users to initiate some action. Clickjacking attack exploits one of the vulnerabilities existing in the web applications. This attack uses a technique that allows cross domain attacks with the help of userinitiated clicks and performs unintended actions. This paper traces out the vulnerabilities that make a website vulnerable to clickjacking attack and proposes a solution for the same.
Performance Analysis of Audio and Video Synchronization using Spreaded Code D...Eswar Publications
The audio and video synchronization plays an important role in speech recognition and multimedia communication. The audio-video sync is a quite significant problem in live video conferencing. It is due to use of various hardware components which introduces variable delay and software environments. The objective of the synchronization is used to preserve the temporal alignment between the audio and video signals. This paper proposes the audio-video synchronization using spreading codes delay measurement technique. The performance of the proposed method made on home database and achieves 99% synchronization efficiency. The audio-visual
signature technique provides a significant reduction in audio-video sync problems and the performance analysis of audio and video synchronization in an effective way. This paper also implements an audio- video synchronizer and analyses its performance in an efficient manner by synchronization efficiency, audio-video time drift and audio-video delay parameters. The simulation result is carried out using mat lab simulation tools and simulink. It is automatically estimating and correcting the timing relationship between the audio and video signals and maintaining the Quality of Service.
Due to the availability of complicated devices in industry, models for consumers at lower cost of resources are developed. Home Automation systems have been developed by several researchers. The limitations of home automation includes complexity in architecture, higher costs of the equipment, interface inflexibility. In this paper as we have proposed, the working protocol of PIC 16F72 technology is which is secure, cost efficient, flexible that leads to the development of efficient home automation systems. The system is operational to control various home appliances like fans, Bulbs, Tube light. The following paper describes about components used and working of all components connected. The home automation system makes use of Android app entitled “Home App” which gives
flexibility and easy to use GUI.
Semantically Enchanced Personalised Adaptive E-Learning for General and Dysle...Eswar Publications
E-learning plays an important role in providing required and well formed knowledge to a learner. The medium of e- learning has achieved advancement in various fields such as adaptive e-learning systems. The need for enhancing e-learning semantically can enhance the retrieval and adaptability of the learning curriculum. This paper provides a semantically enhanced module based e-learning for computer science programme on a learnercentric perspective. The learners are categorized based on their proficiency for providing personalized learning environment for users. Learning disorders on the platform of e-learning still require lots of research. Therefore, this paper also provides a personalized assessment theoretical model for alphabet learning with learning objects for
children’s who face dyslexia.
Agriculture plays an important role in the economy of our country. Over 58 percent of the rural households depend on the agriculture sector as their means of livelihood. Agriculture is one of the major contributors to Gross Domestic Product(GDP). Seeds are the soul of agriculture. This application helps in reducing the time for the researchers as well as farmers to know the seedling parameters. The application helps the farmers to know about the percentage of seedlings that will grow and it is very essential in estimating the yield of that particular crop. Manual calculation may lead to some error, to minimize that error, the developed app is used. The scientist and farmers require the app to know about the physiological seed quality parameters and to take decisions regarding their farming activities. In this article a desktop app for seed germination percentage and vigour index calculation are developed in PHP scripting language.
What happens when adaptive video streaming players compete in time-varying ba...Eswar Publications
Competition among adaptive video streaming players severely diminishes user-QoE. When players compete at a bottleneck link many do not obtain adequate resources. This imbalance eventually causes ill effects such as screen flickering and video stalling. There have been many attempts in recent years to overcome some of these problems. However, added to the competition at the bottleneck link there is also the possibility of varying network bandwidth which can make the situation even worse. This work focuses on such a situation. It evaluates current heuristic adaptive video players at a bottleneck link with time-varying bandwidth conditions. Experimental setup includes the TAPAS player and emulated network conditions. The results show PANDA outperforms FESTIVE, ELASTIC and the Conventional players.
WLI-FCM and Artificial Neural Network Based Cloud Intrusion Detection SystemEswar Publications
Security and Performance aspects of cloud computing are the major issues which have to be tended to in Cloud Computing. Intrusion is one such basic and imperative security problem for Cloud Computing. Consequently, it is essential to create an Intrusion Detection System (IDS) to detect both inside and outside assaults with high detection precision in cloud environment. In this paper, cloud intrusion detection system at hypervisor layer is developed and assesses to detect the depraved activities in cloud computing environment. The cloud intrusion detection system uses a hybrid algorithm which is a fusion of WLI- FCM clustering algorithm and Back propagation artificial Neural Network to improve the detection accuracy of the cloud intrusion detection system. The proposed system is implemented and compared with K-means and classic FCM. The DARPA’s KDD cup dataset 1999 is used for simulation. From the detailed performance analysis, it is clear that the proposed system is able to detect the anomalies with high detection accuracy and low false alarm rate.
Spreading Trade Union Activities through Cyberspace: A Case StudyEswar Publications
This report present the outcome of an investigative research conducted to examine the modu-operandi of academic staff union of polytechnics (ASUP) YabaTech. The investigation covered the logistics and cost implication for spreading union activities among members. It was discovered that cost of management and dissemination of information to members was at high side, also logistics problem constitutes to loss of information in transit hence cut away some members from union activities. To curtail the problem identified, we proposed the
design of secure and dynamic website for spreading union activities among members and public. The proposed system was implemented using HTML5 technology, interface frameworks like Bootstrap and j query which enables the responsive feature of the application interface. The backend was designed using PHPMYSQL. It was discovered from the evaluation of the new system that cost of managing information has reduced considerably, and logistic problems identified in the old system has become a forgotten issue.
Identifying an Appropriate Model for Information Systems Integration in the O...Eswar Publications
Nowadays organizations are using information systems for optimizing processes in order to increase coordination and interoperability across the organizations. Since Oil and Gas Industry is one of the large industries in whole of the world, there is a need to compatibility of its Information Systems (IS) which consists three categories of systems: Field IS, Plant IS and Enterprise IS to create interoperability and approach the
optimizing processes as its result. In this paper we introduce the different models of information systems integration, identify the types of information systems that are using in the upstream and downstream sectors of petroleum industry, and finally based on expert’s opinions will identify a suitable model for information systems integration in this industry.
Link-and Node-Disjoint Evaluation of the Ad Hoc on Demand Multi-path Distance...Eswar Publications
This work illustrates the AOMDV routing protocol. Its ancestor, the AODV routing protocol is also described. This tutorial demonstrates how forward and reverse paths are created by the AOMDV routing protocol. Loop free paths formulation is described, together with node and link disjoint paths. Finally, the performance of the AOMDV routing protocol is investigated along link and node disjoint paths. The WSN with the AOMDV routing protocol using link disjoint paths is better than the WSN with the AOMDV routing protocol using node disjoint paths for energy consumption.
Bridging Centrality: Identifying Bridging Nodes in Transportation NetworkEswar Publications
To identify the importance of node of a network, several centralities are used. Majority of these centrality measures are dominated by components' degree due to their nature of looking at networks’ topology. We propose a centrality to identification model, bridging centrality, based on information flow and topological aspects. We apply bridging centrality on real world networks including the transportation network and show that the nodes distinguished by bridging centrality are well located on the connecting positions between highly connected regions. Bridging centrality can discriminate bridging nodes, the nodes with more information flowed through them and locations between highly connected regions, while other centrality measures cannot.
Now a days we are living in an era of Information Technology where each and every person has to become IT incumbent either intentionally or unintentionally. Technology plays a vital role in our day to day life since last few decades and somehow we all are depending on it in order to obtain maximum benefit and comfort. This new era equipped with latest advents of technology, enlightening world in the form of Internet of Things (IoT). Internet of things is such a specified and dignified domain which leads us to the real world scenarios where each object can perform some task while communicating with some other objects. The world with full of devices, sensors and other objects which will communicate and make human life far better and easier than ever. This paper provides an overview of current research work on IoT in terms of architecture, a technology used and applications. It also highlights all the issues related to technologies used for IoT, after the literature review of research work. The main purpose of this survey is to provide all the latest technologies, their corresponding
trends and details in the field of IoT in systematic manner. It will be helpful for further research.
Automatic Monitoring of Soil Moisture and Controlling of Irrigation SystemEswar Publications
In past couple of decades, there is immediate growth in field of agricultural technology. Utilization of proper method of irrigation by drip is very reasonable and proficient. A various drip irrigation methods have been proposed, but they have been found to be very luxurious and dense to use. The farmer has to maintain watch on irrigation schedule in the conventional drip irrigation system, which is different for different types of crops. In remotely monitored embedded system for irrigation purposes have become a new essential for farmer to accumulate his energy, time and money and will take place only when there will be requirement of water. In this approach, the soil test for chemical constituents, water content, and salinity and fertilizer requirement data collected by wireless and processed for better drip irrigation plan. This paper reviews different monitoring systems and proposes an automatic monitoring system model using Wireless Sensor Network (WSN) which helps the farmer to improve the yield.
Multi- Level Data Security Model for Big Data on Public Cloud: A New ModelEswar Publications
With the advent of cloud computing the big data has emerged as a very crucial technology. The certain type of cloud provides the consumers with the free services like storage, computational power etc. This paper is intended to make use of infrastructure as a service where the storage service from the public cloud providers is going to leveraged by an individual or organization. The paper will emphasize the model which can be used by anyone without any cost. They can store the confidential data without any type of security issue, as the data will be altered
in such a way that it cannot be understood by the intruder if any. Not only that but the user can retrieve back the original data within no time. The proposed security model is going to effectively and efficiently provide a robust security while data is on cloud infrastructure as well as when data is getting migrated towards cloud infrastructure or vice versa.
Impact of Technology on E-Banking; Cameroon PerspectivesEswar Publications
The financial services industry is experiencing rapid changes in services delivery and channels usage, and financial companies and users of financial services are looking at new technologies as they emerge and deciding whether or not to embrace them and the new opportunities to save and manage enormous time, cost and stress.
There is no doubt about the favourable and manifold impact of technology on e-banking as pictured in this review paper, almost all banks are with the least and most access e-banking Technological equipments like ATMs and Cards. On the other Hand cheap and readily available technology has opened a favourable competition in ebanking services business with a lot of wide range competitors competing with Commercial Banks in Cameroon in providing digital financial services.
Classification Algorithms with Attribute Selection: an evaluation study using...Eswar Publications
Attribute or feature selection plays an important role in the process of data mining. In general the data set contains more number of attributes. But in the process of effective classification not all attributes are relevant.
Attribute selection is a technique used to extract the ranking of attributes. Therefore, this paper presents a comparative evaluation study of classification algorithms before and after attribute selection using Waikato Environment for Knowledge Analysis (WEKA). The evaluation study concludes that the performance metrics of the classification algorithm, improves after performing attribute selection. This will reduce the work of processing irrelevant attributes.
Mining Frequent Patterns and Associations from the Smart meters using Bayesia...Eswar Publications
In today’s world migration of people from rural areas to urban areas is quite common. Health care services are one of the most challenging aspect that is must require to the people with abnormal health. Advancements in the technologies lead to build the smart homes, which contains various sensor or smart meter devices to automate the process of other electronic device. Additionally these smart meters can be able to capture the daily activities of the patients and also monitor the health conditions of the patients by mining the frequent patterns and
association rules generated from the smart meters. In this work we proposed a model that is able to monitor the activities of the patients in home and can send the daily activities to the corresponding doctor. We can extract the frequent patterns and association rules from the log data and can predict the health conditions of the patients and can give the suggestions according to the prediction. Our work is divided in to three stages. Firstly, we used to record the daily activities of the patient using a specific time period at three regular intervals. Secondly we applied the frequent pattern growth for extracting the association rules from the log file. Finally, we applied k means clustering for the input and applied Bayesian network model to predict the health behavior of the patient and precautions will be given accordingly.
Network as a Service Model in Cloud Authentication by HMAC AlgorithmEswar Publications
Resource pooling on internet-based accessing on use as pay environmental technology and ruled in IT field is the
cloud. Present, in every organization has trusted the web, however, the information must flow but not hold the
data. Therefore, all customers have to use the cloud. While the cloud progressing info by securing-protocols. Third
party observing and certain circumstances directly stale in flow and kept of packets in the virtual private cloud.
Global security statistics in the year 2017, hacking sensitive information in cloud approximately maybe 75.35%,
and the world security analyzer said this calculation maybe reached to 100%. For this cause, this proposed
research work concentrates on Authentication-Message-Digest-Key with authentication in routing the Network as
a Service of packets in OSPF (Open Shortest Path First) implementing Cloud with GNS3 has tested them to
securing from attackers.
Microstrip patch antennas are recently used in wireless detection applications due to their low power consumption, low cost, versatility, field excitation, ease of fabrication etc. The microstrip patch antennas are also called as printed antennas which is suffer with an array elements of antenna and narrow bandwidth. To overcome the above drawbacks, Flame Retardant Material is used as the substrate. Rectangular shape of microstrip patch antenna with FR4 material as the substrate which is more suitable for the explosive detection applications. The proposed printed antenna was designed with the dimension of 60 x 60 mm2. FR-4 material has a dielectric constant value of 4.3 with thickness 1.56 mm, length and width 60 mm and 60 mm respectively. One side of the substrate contains the ground plane of dimensions 60 x60 mm2 made of copper and the other side of the substrate contains the patch which have dimensions 34 x 29 mm2 and thickness 0.03mm which is also made of copper. RMPA without slot, Vertical slot RMPA, Double horizontal slot RMPA and Centre slot RMPA structures were
designed and the performance of the antennas were analysed with various parameters such as gain, directivity, Efield, VSWR and return loss. From the performance analysis, double horizontal slot RMPA antenna provides a better result and it provides maximum gain (8.61dB) and minimum return loss (-33.918dB). Based on the E-field excitation value the SEMTEX explosive material is detected and it was simulated using CST software.
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:
Generative AI Deep Dive: Advancing from Proof of Concept to ProductionAggregage
Join Maher Hanafi, VP of Engineering at Betterworks, in this new session where he'll share a practical framework to transform Gen AI prototypes into impactful products! He'll delve into the complexities of data collection and management, model selection and optimization, and ensuring security, scalability, and responsible use.
Threats to mobile devices are more prevalent and increasing in scope and complexity. Users of mobile devices desire to take full advantage of the features
available on those devices, but many of the features provide convenience and capability but sacrifice security. This best practices guide outlines steps the users can take to better protect personal devices and information.
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.
Encryption in Microsoft 365 - ExpertsLive Netherlands 2024Albert Hoitingh
In this session I delve into the encryption technology used in Microsoft 365 and Microsoft Purview. Including the concepts of Customer Key and Double Key Encryption.
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.
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.
How to Get CNIC Information System with Paksim Ga.pptxdanishmna97
Pakdata Cf is a groundbreaking system designed to streamline and facilitate access to CNIC information. This innovative platform leverages advanced technology to provide users with efficient and secure access to their CNIC details.
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.
Removing Uninteresting Bytes in Software FuzzingAftab Hussain
Imagine a world where software fuzzing, the process of mutating bytes in test seeds to uncover hidden and erroneous program behaviors, becomes faster and more effective. A lot depends on the initial seeds, which can significantly dictate the trajectory of a fuzzing campaign, particularly in terms of how long it takes to uncover interesting behaviour in your code. We introduce DIAR, a technique designed to speedup fuzzing campaigns by pinpointing and eliminating those uninteresting bytes in the seeds. Picture this: instead of wasting valuable resources on meaningless mutations in large, bloated seeds, DIAR removes the unnecessary bytes, streamlining the entire process.
In this work, we equipped AFL, a popular fuzzer, with DIAR and examined two critical Linux libraries -- Libxml's xmllint, a tool for parsing xml documents, and Binutil's readelf, an essential debugging and security analysis command-line tool used to display detailed information about ELF (Executable and Linkable Format). Our preliminary results show that AFL+DIAR does not only discover new paths more quickly but also achieves higher coverage overall. This work thus showcases how starting with lean and optimized seeds can lead to faster, more comprehensive fuzzing campaigns -- and DIAR helps you find such seeds.
- These are slides of the talk given at IEEE International Conference on Software Testing Verification and Validation Workshop, ICSTW 2022.
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
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.
Goodbye Windows 11: Make Way for Nitrux Linux 3.5.0!SOFTTECHHUB
As the digital landscape continually evolves, operating systems play a critical role in shaping user experiences and productivity. The launch of Nitrux Linux 3.5.0 marks a significant milestone, offering a robust alternative to traditional systems such as Windows 11. This article delves into the essence of Nitrux Linux 3.5.0, exploring its unique features, advantages, and how it stands as a compelling choice for both casual users and tech enthusiasts.
Why You Should Replace Windows 11 with Nitrux Linux 3.5.0 for enhanced perfor...SOFTTECHHUB
The choice of an operating system plays a pivotal role in shaping our computing experience. For decades, Microsoft's Windows has dominated the market, offering a familiar and widely adopted platform for personal and professional use. However, as technological advancements continue to push the boundaries of innovation, alternative operating systems have emerged, challenging the status quo and offering users a fresh perspective on computing.
One such alternative that has garnered significant attention and acclaim is Nitrux Linux 3.5.0, a sleek, powerful, and user-friendly Linux distribution that promises to redefine the way we interact with our devices. With its focus on performance, security, and customization, Nitrux Linux presents a compelling case for those seeking to break free from the constraints of proprietary software and embrace the freedom and flexibility of open-source computing.
A tale of scale & speed: How the US Navy is enabling software delivery from l...sonjaschweigert1
Rapid and secure feature delivery is a goal across every application team and every branch of the DoD. The Navy’s DevSecOps platform, Party Barge, has achieved:
- Reduction in onboarding time from 5 weeks to 1 day
- Improved developer experience and productivity through actionable findings and reduction of false positives
- Maintenance of superior security standards and inherent policy enforcement with Authorization to Operate (ATO)
Development teams can ship efficiently and ensure applications are cyber ready for Navy Authorizing Officials (AOs). In this webinar, Sigma Defense and Anchore will give attendees a look behind the scenes and demo secure pipeline automation and security artifacts that speed up application ATO and time to production.
We will cover:
- How to remove silos in DevSecOps
- How to build efficient development pipeline roles and component templates
- How to deliver security artifacts that matter for ATO’s (SBOMs, vulnerability reports, and policy evidence)
- How to streamline operations with automated policy checks on container images
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...Neo4j
Leonard Jayamohan, Partner & Generative AI Lead, Deloitte
This keynote will reveal how Deloitte leverages Neo4j’s graph power for groundbreaking digital twin solutions, achieving a staggering 100x performance boost. Discover the essential role knowledge graphs play in successful generative AI implementations. Plus, get an exclusive look at an innovative Neo4j + Generative AI solution Deloitte is developing in-house.
GraphSummit Singapore | The Future of Agility: Supercharging Digital Transfor...
MULTI-STAGE ENCRYPTION USING SEEDED SDES
1. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2694
MULTI-STAGE ENCRYPTION USING
SEEDED SDES
Dr.S.Kiran
Asst. Prof Department of Computer Science and Engineering, YSREC of Y V University, Proddatur
Email: rkirans125@gmail.com
R. Pradeep Kumar Reddy
Asst. Prof Department of Computer Science and Engineering, YSREC of Y V University, Proddatur
Email: pradeepmadhavi@gmail.com
J.Venkata Sivajaya Sree
Department of Computer Science and Engineering, YSREC of Y V University, Proddatur
Email: j.v.s.jayasree@gmail.com
D.Naga Sravanthi
Department of Computer Science and Engineering, YSREC of Y V University, Proddatur
Email: d.nsravanthi2010@gmail.com
-------------------------------------------------------------------ABSTRACT--------------------------------------------------------------
Now-a-days the usage of internet increases tremendously so, there is a need of security for the data. Cryptography
is a process of scrambling the data into unknown format which provides security to the data. Modern
cryptography is mainly based on mathematical theory and computer science practice. Cryptography process is
done with the help of encryption and decryption. The basic two ideas behind the cryptography technique are
substitution and transposition. This paper presents a multistage encryption algorithm. At the end of each stage an
intermediate cipher is produced. The key is generated by using SEEDED SDES algorithm. Final cipher text is
derived from the local binary pattern (LBP).
Keywords - Decryption, Encryption, Railference, SEEDED SDES key generation, Substitution, Transposition.
--------------------------------------------------------------------------------------------------------------------------------------------------
Date of Submission: July 31, 2015 Date of Acceptance: Sep 09, 2015
--------------------------------------------------------------------------------------------------------------------------------------------------
1. INTRODUCTION
Cryptography is the practice and study of techniques for
secure communication in the presence of third parties.
Cryptography means, a method of transmitting data in
sandwiched between a two persons, i.e. those (sender) for
whom (receiver) can only read and process the data. A
message in its original format, readable by an attacker is
plaintext[1] .A message is changed to be unreadable
format by sender to anyone except the intended recipient is
cipher text. The term is most often associated with
encryption and decryption. The scrambling of original text
(plain text) into cipher text is known as encryption, and
then back again is known as decryption.
The main traditional cipher types are transposition
ciphers and substitution ciphers. A transposition cipher is
one, which rearranges the order of letters in a message.
For example ‘computers’ becomes ‘pmocusret’. The
cipher, which systematically replaces letters or groups of
letters with other letters or group of letters, is referred as
substitution cipher. For example: ’talk less work more’
becomes ‘ubml mftt npsf’. An early substitution cipher
was the caeser cipher, in which each letter in the plaintext
was replaced by a letter with some fixed number of
positions further down the alphabet[2]. Application of
cryptography includes ATM cards, computer passwords
and electronic commerce.
In the 20th
century, cryptography was predominantly
concerned with linguistic (scientific study of language)
and lexicographic patterns (greedily generated error-
correction codes). Then the emphasis has shifted, and
cryptography now makes extensive use of mathematics,
including aspects of information theory ( branch of
applied mathematics, electrical engineering and computer
science), computational complexity(theory of
computation), statistics, combinatory(countable discrete
structures), abstract algebra, number theory(pure
mathematics) and finite mathematics generally[3].
1.1. Background
The word cryptography is derived from the Greek
language ‘kryptos’ means “hidden” or “secret”.
At 2000bc cryptography was origined with the egyptian
practice of hieroglyphics, which consist of complex
pictograms. The first known use of a modern cipher was
by julius Caesar. Julius Caesar created a system in which
each character in his message was replaced by a character
three positions ahead of it in the roman alphabet, why
because he did not trust his messengers when
communicating with his governors and officers.
The cryptosystem services are data confidential, data
integrity, authentication and non-repudiation. Data
2. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2695
Confidentiality is a set of rules, which imposes access
limits and restrictions on the information. The main aim of
Data integrity is to prevent unintentional changes to
information and the control of protecting data from
unauthorized parties. Authentication performs the
conformation of truth attribute of a single piece of data or
entity.
Now a days cryptography has crooked into a
battleground of the world’s best mathematics and
computer scientists. The ability to securely store and
transfer sensitive information has proved a critical factor
in success in war and business[3].
1.2 Types of cryptography
1.2.1 Symmetric key cryptography
In the simpler types of cryptography, the same key is used
to encrypt and decrypt the data. Some of the symmetric
algorithms are DES, 3DES, AES, IDES, RC4, RC5.
Fig 1.1: Symmetric key cryptography.
1.2.2 Asymmetric key cryptography
In this type of cryptography, the encryption is done by one
key and the decryption is done by another key .one of this
key is private key and the another key is public key
(known to everyone).
Some of the asymmetric algorithms are RSA, ECC
(Elliptical curve Cryptography), Elgamal. These systems
use two keys, a public key known to everyone and a
private key that only the recipient of messages uses.
Fig 1.2: Asymmetric key cryptography
1.3 Existing work
The SDES key generation is done by using permutation
method. Two keys are generated from the SDES key
generation algorithm .Among them, select the smallest one
as the key.
1.3.1 Encryption Algorithm
Existing Encryption algorithm is done in three steps.caesar
cipher substitution, transposition and arithmetic and
logical operations are applied to generate cipher text. The
three steps are as follows:
Step 1: An automatic key is generated through the
existing SDES key generation algorithm[4]. In the first
round, caesar cipher substitution[5] is performed
with the help of private key produces an intermediate
cipher 1.
Step 2: Apply crossover to the intermediate cipher 1, to
transpose the character’s position, mutation process is
involved. At the end of round 2 an intermediate cipher 2
is produced.
Step 3: Round 3 encompasses all the arithmetic and
logical operations to obtain a final cipher text.
1.3.2 Decryption Algorithm
Decryption algorithm is reverse process of an encryption
algorithm. The three decryption steps are as follows:
Step 1: Take the final cipher text and perform all basic
Arithmetic and logic operations to it. It produces
the intermediate plaintext 1.
Step 2: Apply crossover process to the intermediate
Plaintext1 followed by the mutation technique which gives
the intermediate plaintext2.
Step 3: Finally, reverse caesar cipher substitution is
Involved using private key as declared in the encryption
algorithm.
2. PROPOSED WORK
The proposed algorithm uses seeded sdes key generation,
railference and local binary pattern provides more
complexity for the text. The advantage of high complexity,
the unauthorized person face very difficult to understand
the original plain text.
2.1 SEEDED SDES Key generation
2.1.1 Algorithm steps
Step 1: Initially generate random 64 binary bit sequence.
Step 2: Divide those 64 bits into 8 chunks, each chunk
consists of 8 bits.
Step 3: Retrieve MSB bit from left to right of each chunk,
which results 8 bit sequence.
Step 4: Compute the decimal number to the above 8 bit
Sequence that is referred to be as key.
3. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2696
2.1.2 Flow chart for SEEDED SDES key generation
Fig 2.1: seeded sdes key generation
2.1.3 Example for SEEDED SDES key generation
Step 1: 64 bit sequence is
110101100101010111001100111100000111011
1100100110011101011000110
Step 2: Divide this sequence into 8 chunks:
11010110 | 01010101 | 11001100 | 11110000 |
01110111 | 10010011 | 00111010 | 11000110
Step 3: Retrieve most significant bit from each chunk,
then the production of key in binary is 10110101.
Step 4: The decimal value for the key is 181.
2.2. Encryption Algorithm
By using the key, generated from seeded sdes algorithm
and substitution method an intermediate cipher is
generated. Apply railferance technique on intermediate
cipher and produce intermediate cipher text 2.Combination
of arithmetic and logical operations are applied on
intermediate cipher 2 and produces the final cipher text.
2.2.1 Algorithm steps
Step 1: An intermediate cipher 1 is produced by using
caesar cipher substitution method with the help of private
key [5]. Privates key is obtained from SEEDED SDES
key algorithm.
Step 2: Perform the railference technique for the
Intermediate cipher 1,inverse of text is involved. An
intermediate cipher text 2 is produced.
Step 3: The fina l cipher text is obtained by using local
binary pattern[7]. The process of local binary pattern is to
place the 0th
position bit into 3rd
position bit, the remaining
bits ( previously 1st
, 2nd
and 3rd
position bits) are moved
forward from left to right side. At the final stage, it
encompasses all arithmetic, logical operations and local
binary pattern technique yields final cipher text.
Table: LBP Diagram:
20
27
26
21
25
22
23
24
Conditions:
For i<j: 27
26
25
i>j: 23
22
21
i=j 24
20
after LBP text is: i<j i=j i>j
2.2.2 Flowchart for proposed encryption algorithm
Fig 2.2.1: Encryption algorithm
Table 1: substitution method lookup table
Character Value Characte
r
Value
! 0 R 49
“ 1 S 50
# 2 T 51
$ 3 U 52
% 4 V 53
& 5 W 54
‘ 6 X 55
( 7 Y 56
) 8 Z 57
* 9 [ 58
+ 10 59
‘ 11 ] 60
- 12 ^ 61
. 13 _ 62
start
stop
Generate random 64 bit sequence
Divide 64 bit sequence into 8
chunks
Retrieve MSB bit from each
chunk
Key=MSB bit from each chunk
Start
Stop
Round1:
substitution method
Round2:
Transposition method
Round 3:
local binary pattern
4. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2697
/ 14 ` 63
0 15 a 64
1 16 b 65
2 17 c 66
3 18 d 67
4 19 e 68
5 20 f 69
6 21 g 70
7 22 h 71
8 23 i 72
9 24 j 73
: 25 k 74
; 26 l 75
< 27 m 76
= 28 n 77
> 29 o 78
? 30 p 79
@ 31 q 80
A 32 r 81
B 33 s 82
C 34 t 83
D 35 u 84
E 36 v 85
F 37 w 86
G 38 x 87
H 39 y 88
I 40 z 89
J 41 { 90
K 42 | 91
L 43 } 92
M 44 ~ 93
N 45
O 46
P 47
Q 48
2.2.3 Example for Encryption algorithm
Round 1
Plaintext=computer
key=181
Table 2: Result of Round1
Intermediate cipher1 is hfinm^k
Round 2 Railference
Write intermediate cipher 1 as follows:
f n ^
h i m k
string1=fn^
string2=himk
string=string1+string2
string=fn^himk
IC2=inverse(string)
Intermediate cipher2(IC2)=kmih^nf
Round 3
Calculate binary equivalent for each character in IC2.
Table 3: Combination of Arithmetic and Logic Operations
Table 4: Local Binary Pattern
Reverse Local
binary
pattern
Equivalent
decimal
value
ASCII
character
01010010 01010001 81 Q
00110010 00110001 49 1
00010010 00010001 17 ◄
11100010 11100001 225 ß
10111100 10110110 182 ╢
10110010 10110001 177 ░
10100010 10100001 161 Í
11011100 11010110 214 ∏
Final cipher text is: Q1◄ß╢░ í∏
2.3 Decryption Algorithm
The process of unlocking encryption information using
cryptography is known as decryption.Local binary
pattern,arithmetic and logical operations ,railference
technique and substitution methods are applied on final
cipher text and produces the original plain text.
2.3.1 Algorithm steps
Step 1: The final cipher text is decrypted by using all
basic arithmetic, logical and Local Binary Pattern
technique to produce the intermediate plaintext1.
The process of Local binary pattern is to place the 3rd
position bit into 0th
position bit and the previously 2nd
, 1st
,0th
bits are moved to 3rd
, 2nd
, 1st
bit positions respectively.
plaintext(p) Corresponding
value(v)
C=(v+key)%94 Corresponding
character of C
c 66 59
o 78 71 h
m 76 69 f
p 79 72 i
u 84 77 n
t 83 76 m
e 68 61 ^
r 81 74 k
Intermedia
te cipher 2
Corresponding
value
Equivalent
binary
Reverse
k 74 01001010 01010010
m 76 01001100 00110010
i 72 01001000 00010010
h 71 01000111 11100010
^ 61 00111101 10111100
n 77 01001101 10110010
f 69 01000101 10100010
59 00111011 11011100
5. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2698
Step 2: Apply mutation of the intermediate plaintext1,
railference technique for the plaintext. An intermediate
plaintext 2 is produced.
Step 3: At the end of decryption algorithm,
original plaintext is obtained with the help of all
basic arithmetic, logical operations and Caesar cipher
substitution method.
2.3.2 Flow chart for proposed decryption algorithm
Fig 2.2.1: Decryption algorithm
2.3.3 Example for decryption algorithm:
Round 1:
Cipher text=:Q1◄ß╢░ í∏
Table 5: Inverse Local Binary Pattern
Table 6: Combination of Arithmetic and Logic Operations
Intermediate plaintext1 is kmih^nf
Round 2
I=inv(intermediate plaintext1)
I=fn^himk
Railference
k m i h
^ n f
string1=hfi
string2= nm^k
string=string1+string2
string=hfinm^k
Intermediate plaintext2 is:hfinm^k
Round 3
if((V+n)>key) then P=((V+n)%key)
else if((V+n+n)>key) then P=((V+n+n)%key)
else P=((V+n+n+n)%key)
Table 7: Reverse Substitution Method
At the end of decryption, original plaintext is: computer
Cipher
text
Equivalent
decimal
value
Equivalent
binary
Local binary
pattern
Q 81 01010001 01010010
1 49 00110001 00110010
◄ 17 00010001 00010010
ß 225 11100001 11100010
╢ 182 10110110 10111100
░ 177 10110001 10110010
Í 161 10100001 10100010
∏ 214 11010110 11011100
Local
binary
pattern
Reverse Correspondi
ng decimal
Value
Correspondin
g character
01010010 01001010 74 k
00110010 01001100 76 m
00010010 01001000 72 i
11100010 01000111 71 h
10111100 00111101 61 ^
10110010 01001101 77 n
10100010 01000101 69 f
11011100 00111011 59
Intermediat
e plaintext2
Corresponding
numeric value(V)
P=(V+
n)%
key
Equivalent
char
59 66 c
h 71 78 o
f 69 76 m
i 72 79 p
n 77 84 u
m 76 83 t
^ 61 68 e
k 74 81 r
Start
Stop
Round1:
Inverse Local Binary Pattern
Round2:
Transposition method
Round 3:
Reverse substitution method
6. Int. J. Advanced Networking and Applications
Volume: 07 Issue: 02 Pages: 2694-2699 (2015) ISSN: 0975-0290
2699
3. ADVANTAGES
1. The key is generated through random number
generation with 64 bit sequence.
2. The railference and local binary pattern methods give
complexity to the intermediate cipher text.
3. High processing speed.
4. CONCLUSION
Security plays a vital role in communication channels,
best example is internet. Now-a- days, billions of the
people are using internet. Internet carries a huge amount of
information such as mails, documents, sharing of files,
business deals and so on. In order to protect the
information from unauthorized persons, one needs better
security mechanisms. For protecting information, most
popular approach is cryptography. Cryptography is the art
of secret writing. The main aim of cryptography is to see
that the intended receiver can only understand the
message. The proposed algorithm uses local binary
pattern, railference, substitution method and seeded S-
DES key generation. In the future work, this algorithm
will be extended to use the UNICODE system support.
REFERENCES
[1] Govind Prasad Arya,Aayushi
Nautiyal,ashishPant,Shiv Singh & Tishi Handa,”A cipher
design with automatic key generation using the
combination of substitution and transposition techniques
and basic arithmetic and logic operations,” the SIJ
Transactions on computer science engineering & its
applications
[2] S.G.Srikantaswamy and Dr.H.D.phaneendra,“A cipher
design using the combined effect of arithmetic and
logic operations with substitutions and transposition
techniques , “ International Journal of Computer
Applications(0975-8887),vol.29,no.8,pp.34-36
[3] Jonathan Katz and Yehuda Lindell, Introduction
to modern cryptography, Chapman and hall/CRC,
Taylor and Francis group, 2008.
[4] S.Devi, Dr.V.Palanisamy, ”Multi-Level Encryption
using SDES key generation with Genetic Algorithm”,
international journal of engineering and computer
science (IJECS) , vol.3 , issue.8 , page no: 7596-
7576, aug 2014.
[5] B.Bazith Mohammed, “automatic key generation
of Caesar cipher”, international journal of engineering
trends and technology (IJETT), vol.6,no.6,pp.337-
339,dec.2013.
[6] S.G.Srikantaswamy and
Dr.H.D.Phaneendra,Improved Caesar cipher with
random number Generation technique and multistage
encryption”, International Journal on Cryptography and
information+Security(IJCIS),vol2,no.4,pp.39-49,Dec.2012
[7] Di Huang,Caifeng Shin and Mohsen Ardabilian
“Local Binary Patterns and Its Application to Facial
Image Analysis: survey”, IEEE transactions on
systems, man,and cybernetics_ part c: applications
and reviews, vol.41,no.6,nov 2011.
Authors Profile
Dr.S.Kiran is Assistant
Professor in the department of
Computer Science and
Engineering at Yogivenama
University , Proddatur. He
acquired M.Tech Degree from
Nagarjuna University, Guntur.
He completed Ph.D in computer
science from S.K.University. He has been continuously
imparting his knowledge to several students in research
activities. He published many articles National and
International journals. His research areas are image
Processing, Cryptography and Network Security, Software
Engineering and Data mining and Data ware house.
R. Pradeep Kumar Reddy is
working as Assistant Professor in
Department of CSE at Y.S.R
Engineering College of Yogi
Vemana University, Proddatur.
He received his B.Tech degree in
CSE from Bellary Engineering
College, Bellary (VTU). M. Tech degree in CSE from
S.R.M University, Chennai. He worked as Assistant
Professor and Head of the department CSE, IT and MCA
in Vaagdevi Institute of Technology and Science,
Proddatur during the period 2005 to 2008. Later he joined
as Assistant Professor and Head of the Department IT in
Chaitanya Bharathi Institute of Technology and Science,
Proddatur, during the period 2008 to 2009. He published
many research articles in various National and
International Journals. He attended National and
International Conferences. He is pursuing PhD in digital
image processing at Yogi Vemana University, Kadapa.
J Venkata Sivajaya Sree is a
student in the department of
Computer Science and
Engineering at Y.S.R Engineering
College of Y.V.U, Proddatur .
She is studying 4th
B.Tech in CSE.
She attended many workshops and
Seminars.
D Naga Sravanthi is a student in
the department of Computer
Science and Engineering at Y.S.R
Engineering College of Y.V.U,
Proddatur . She is studying 4th
B.Tech in CSE. She attended
many workshops and Seminars.