Search

Big data, cloud computing and other hot areas are the use of personal information, but in the process of using this data, a large number of improper behavior is used to steal personal information. Most of the encryption algorithms in common use nowadays are based on ones that are no longer absolutely secure, such as RSA attacked by factorization, elliptic curves attacked by Pollard's lambda algorithm, and symmetric encryption algorithms attacked by collisions. In this paper, an integrated encryption and compression algorithm is designed, firstly, the data is transformed into the form of matrix, and the Jordan decomposition is used for preliminary compression and encryption from the two-dimensional point of view, and then based on the sparsity of matrix vectors, the compression-aware technique is used for compressing the set of key vectors, and the ciphertext group J produced by Jordan decomposition (which is a string of numbers with matrix diagonal length base √2 N), as well as the set of key vectors Y and the intermediate value Θ produced by compression awareness are obtained in the end. This sidesteps the common algorithms that have already been breached and is able to combine better encryption performance with compression performance while being innovative. [ABSTRACT FROM AUTHOR]

Panda and Chattopadhyay proposed "A Hybrid Algorithm for RSA Cryptosystem" in 2017, they modified well-known algorithm RSA into modulo four prime numbers. Later, Gondaliya, Savani, Dhaduvai and Hossain proposed "Hybrid Security RSA Algorithm in Application of Web Service" in 2018. However, we found that these two papers are highly similar, and the main focus of this article is how to determine the victim the (suffer) and the perpetrator (the plagiarist). [ABSTRACT FROM AUTHOR]

Intelligent vehicular networks leverage communication technologies to enable vehicles to interact with each other and with infrastructure elements, such as roadside units and traffic signals, to enhance road safety and efficiency. However, the open nature of these networks exposes them to various security threats, including data interception, tampering, and unauthorized access. Traditional encryption methods may not suffice to address these challenges, necessitating the adoption of advanced cryptographic techniques like ECC and RSA. Prior research in the field has primarily focused on either enhancing communication protocols or improving security measures independently. However, there is a notable gap in research that comprehensively addresses both aspects simultaneously. This study aims to fill this void by proposing an integrated approach that ensures both seamless communication and robust security in intelligent vehicular networks. The proposed methodology involves the design and implementation of a hybrid cryptographic scheme combining ECC and RSA algorithms. This scheme will be integrated into the existing communication infrastructure of intelligent vehicular networks. The performance of the system will be evaluated through simulations and real-world experiments to assess its effectiveness in securing communication channels while minimizing overhead. The results show the effectiveness of the proposed ECC-RSA hybrid encryption scheme in securing communication channels within intelligent vehicular networks. The integration of ECC and RSA protocols not only enhances the security of data transmission but also ensures seamless communication, thereby advancing road safety in intelligent vehicular environments [ABSTRACT FROM AUTHOR]

IoT devices typically encompass objects or devices equipped with software and internet connectivity, allowing them to collect data. They have limited processing power, memory, and storage. These limitations can make it difficult to secure these devices, as traditional security measures may not be practical. Implementing security for IoT devices can be challenging due to these characteristics, but several steps can be taken to mitigate these challenges. Elliptic Curve Cryptography (ECC) can secure resource constrained IoT devices by providing a more efficient method of encryption and authentication than traditional methods such as RSA. In this paper, we analyzed the lightweight cryptographic algorithm ECC for securing resource-constrained devices such as IoT and evaluated its performance compared to the RSA cryptosystem. The analysis result indicates that ECC is considered to provide stronger security than RSA for the same key length. The CoAP protocol is applied to devices with limited resources, and an examination of its impact is conducted, considering three key performance metrics: CPU usage, bandwidth efficiency, and message communication latency. [ABSTRACT FROM AUTHOR]

With the increasing number of computer network users, the problem of network communication security has become more and more serious. Encryption technology, as one of the key technologies for securing communication, has important research and application values. However, the security of conventional encryption methods is gradually challenged, and at the same time, traditional encryption algorithms require a large amount of computing resources, which makes it difficult to realize real-time encryption and decryption operations. Therefore, how to improve the confidentiality and efficiency of computer network communication security encryption system has become a current urgent problem to be solved. This paper firstly discussed the analysis of its application in the computer network communication security encryption system based on the ant colony optimization (ACO) algorithm. Through the theoretical analysis of the ACO algorithm in terms of bioheuristic optimization algorithm and the analysis of the characteristics of the algorithm, the optimization scheme of key distribution based on the ACO algorithm was discussed. Then, the differences between the ACO algorithm and the traditional encryption algorithm in terms of encryption duration, key distribution time, encryption strength and random number generation speed were further analyzed and verified by experimental data. The data results showed that the key distribution of the encryption system using the ACO algorithm had higher security and better performance compared with the traditional key distribution algorithm. By counting and comparing the data, it was found that the ACO algorithm showed very obvious advantages in terms of encryption and decryption time, key distribution time, encryption strength and random number generation. This indicates that the ACO algorithm has very important application prospects in computer network communication security encryption systems. [ABSTRACT FROM AUTHOR]

Mobile Crowd Sensing (MCS) is an effective way to tackle day-to-day life problems nowadays, from Google Maps to Uber cabs. It is an effective and efficient way of data collection, processing and delivery of results to the users, from the users and for the users. All the entities that make up a Mobile crowd sensing system be it a worker, requester or miner can be represented as a node. All the nodes interact together to make a trustworthy system where there is a limited or no scope of deception. The traditional approach to crowd sensing gives little importance to communication between the nodes and in most cases, it assumes the communication happens through a secure channel and ignores the potential hazards. We propose a novel blockchain-based decentralized and collaborative approach to communicate between the nodes which would help workers/users to interact in real-time and solve conflicts should there be any. To decentralize we use the blockchain technology to overcome single point of failure which is a major issue, as mentioned peer-to-peer link between nodes is more expensive only but it improvise the security and privacy concerns by using the consensus mechanism. With the aim of improving the traditional communication technology between the nodes, we propose a mechanism based on Kafka, blockchain and RSA encryption for continuous exchange of data between the nodes which would help to enhance the security and efficiency of the system. [ABSTRACT FROM AUTHOR]

Quantum computing, based on quantum mechanical principle, can potentially provide significant advantages over classical computing. This advantage of quantum computing provides solutions to many previously unsolvable problems in secure communication and finance. IoT is an emerging technology that deals with a large amount of data. The data communicated in IoT need to be secured. The existing security architecture of IoT is based on cryptographic algorithms such as RSA and ECC. Quantum computing had a significant impact on the security of these algorithms. Therefore, our work analyses the security concerns of IoT smart applications and quantum-based solutions. This article provides a survey of quantum computing fundamentals and the impact of quantum computing on IoT security. Thus, this paper aims to provide a wide view of quantum-enabled IoT communication. The main challenges in implementing quantum-enabled communication are also analyzed in our work. [ABSTRACT FROM AUTHOR]

One of the critical goals of advanced cryptography is to protect data privacy. Although protecting sensitive data has always been essential, it has become much more due to the widespread use of cloud services. Conventional encryption schemes have one drawback: data must be decrypted before processing. Best practices have long recommended that data must be secured at rest and in motion when using public cloud services, i.e., we need encryption at the storage as well as at processing levels. Homomorphic encryption is an advanced cryptographic approach in which the processing of encrypted data is possible. In this paper, we have presented the insights required for understanding homomorphic encryption approaches. We examined and compared two partial homomorphic techniques, RSA and Pallier algorithm based on efficiency, base method, and homomorphic property. [ABSTRACT FROM AUTHOR]

The recent innovations in network application and the internet have made data and network security the major role in data communication system development. Cryptography is one of the outstanding and powerful tools for ensuring data and network security. In cryptography, randomization of encrypted data increases the security level as well as the Computational Complexity of cryptographic algorithms involved. This research study provides encryption algorithms that bring confidentiality and integrity based on two algorithms. The encryption algorithms include a well-known RSA algorithm (1024 key length) with an enhanced bit insertion algorithm to enhance the security of RSA against different attacks. The security classical RSA has depreciated irrespective of the size of the key length due to the development in computing technology and hacking system. Due to these lapses, we have tried to improve on the contribution of the paper by enhancing the security of RSA against different attacks and also increasing diffusion degree without increasing the key length. The security analysis of the study was compared with classical RSA of 1024 key length using mathematical evaluation proofs, the experimental results generated were compared with classical RSA of 1024 key length using avalanche effect in (%) and computational complexity as performance evaluation metrics. The results show that RBMRSA is better than classical RSA in terms of security but at the cost of execution time. [ABSTRACT FROM AUTHOR]

Colombia government wants to implement electronic voting. However, the existing electronic voting protocols only include some of the required security features and Colombia needs a protocol with all these features to ensure fraud-free elections. In this paper, we present the design of SIVP (Secure Internet Voting Protocol), a new voting protocol for electoral processes, based on blind signatures and public key cryptography. This protocol has six phases and provides: eligibility, democracy, privacy, verifiability, accuracy, fairness, robustness, receipt-freeness and coercion-resistant. Also, we compare the number of cryptographic operations per phase of SIVP with other four protocols and conclude that the computational load of our protocol is not excessively high despite including more security features. [ABSTRACT FROM AUTHOR]

The multi-cloud-based resource allocation is based on multiple constraints and multiple configurations that may vary based on customer requirements and cloud service providers' schemes. Here, security is a serious concern that can be ensured by an authentication scheme based on the Self-Adaptive Flower Pollination based RSA (SA-FPRSA) scheme to ensure data integrity. The SA-FPRSA plays an initial role in ensuring security by enabling authenticated data availability. On the other hand, the resource allocation to the Virtual Machine (VM) is a challenging task due to overwhelmed data in a VM that may face unnecessary energy consumption and time complexity issues. Therefore, the proposed model has introduced a Self-adaptive Heap-based optimizer (HBO) for Multi-Cloud based resource allocation. The performance of the models is evaluated. The proposed model attained an Efficiency of 99.09% and Security of 98.72%. Thus, from the results, the recommended model is proven to be better than the existing models. [ABSTRACT FROM AUTHOR]

Sensitive Health Information (SHI) is a developing patient-centric model of medical data exchange, which is frequently outsourced to be stored at third party servers. Though, there have been various privacy issues as SHI could be disclosed to the unauthorised and third parties. This is a promising method to encrypt the SHI before outsourcing to assure the patients' control over access to their own SHI. However, challenges like scalability in key management and flexible access have remained the most significant issues toward achieving fine-grained, cryptographically data access control. In this paper, the authors proposed a novel patient-centric system model for access control to SHIs stored in semi-honest servers. For fine-grained and scalable access control for SHIs, authors have proposed an encryption technique which is an improvement over RSA techniques to encrypt every patient's SHI file. To different from previous works in secure data transmission, the authors focus on the data owner and divide users into several domains in SHI, which greatly decrease the key management complexity for data owners and users. Comprehensive analytical and experimental results are presented which reflect the efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

This study introduces, explores and enlists the challenges of dispute resolution pertaining to data encryption and recommends for a policy framework for systematically addressing the grievances of social media users and intermediaries. Data encryption is essential component of ensuring privacy between the sender and receiver of the message. Any law which asks for the decryption key from the intermediaries to trace the originator of the message requires a deeper understanding of the encryption architecture. It seems that there is a gap in technology and law making pertaining to data encryption which needs to be resolved using a techno-legal framework. The data used in this study stems from an online survey carried out in India by Local Circles. The findings indicate that majority of the Social Media users are in favour of strict regulations. In line with what people think, the intermediary guidelines under the Information Technology Act makes it mandatory for the intermediaries (Social Networking Sites) to comply with the rules. But, there is lack of techno-legal framework to ensure that all disputes pertaining to data encryption and social media regulation will get resolved keeping a balance. [ABSTRACT FROM AUTHOR]

Nowadays the resiliency is the main property in any system especially communication infrastructures. Unfortunately, many developers are working on making programs more resilient and reliable, facing people who want to use leaks in an unethical way, and breaking (or trying to break) largely used one-way functions such as MD5, SHA-1, or RSA based algorithms. As an alternative, exploiting Physically Unclonable Functions (PUF) can be a good solution to improve the level of robustness and security for encryption by adding a pinch of randomness when manufacturing it, while enabling the use of true randomness. A PUF is characterized by a 'digital fingerprint', as an identifier, derived from a complex physical object or device, such as IoT. It is like a black box, which takes an input, called Challenge, and producing an output, called Response. Actually, they are different types of PUF, Weak and Strong, depending on the amount and the heterogeneity of challenge-responses pairs. This paper provides the fundamental concepts and techniques needed to develop a robust and resilient PUF-based communication system. This objective is achieved by mathematically defining FUFs, from foundations to the attacks, by relying on more concepts around PUF, such as cryptanalysis, or asymptotic notations. Also, we develop a mutual communication protocol that ensures security between different parties peer-to-peer devices, and devices-server. We concertize the provided fundamentals in a concrete framework that is experimentally validated. [ABSTRACT FROM AUTHOR]

Private transportation has become a daily need for most people nowadays. Because of the increased use of private transportation by modern society, road accidents have become a major issue. Vehicular communication is one of the methods to reduce the number of dangerous accidents. It is possible to communicate between two vehicles, Known as Vehicle to Vehicle Communication (V2V). Road Side Unit (RSU) is a communication with a specific fixed unit. If communication is established between the vehicle and nearby infrastructure (V2I), accidents can be avoided. Inter Vehicular communication is the term for this type of communication. It also lets vehicles share information such as post-accident investigation, safety information for accident prevention, traffic jams, and many more. Europe and North America are at the forefronts of research to conclude vehicular communication standards. It recognizes technical specification for enabling the communication between vehicles and the road infrastructure and between the various manufacturers. In the existing method, Cloud-based VANET helps to monitor the road condition. Through the connected Vehicular Ad-hoc Network (VANET) and cloud computing technologies, the entities in VANET were able to access the valuable storage and computing services made available by some cloud service provider. The benefits cannot be given away for free because their combination introduces various privacy and security requirements for VANET applications. The authority should monitor real-time road condition using a cloud server, so sound responses to emergencies can be made on time, according to the cloud-based Road Condition Monitoring (RCoM) scenario examined here. Vehicles on site should report information if any dangerous road condition is detected, such as geologic hazards or accidents. Three major issues are discussed in RCoM. An efficient RCoM method was suggested to address these three issues to analyze its efficiency theoretically and to demonstrate its practicality through experiments. They were generated using random numbers and help us in authorization process. So, the malicious vehicles easily identity it. To resolve the issues mentioned above, one Improved Road Condition monitoring system (IRCOM) was initiated. Using the random key generator, the first sub authority delegation is performed, and by using the RSA algorithm, the vehicle registration is attained by generating individual keys. The distribution of the token is based on the individual key and time stamp assigned to each vehicle. Cloud will categorize the received report using the key, token and time stamp. Finally, the route authority will decode the reports and, if necessary, will take the appropriate action. [ABSTRACT FROM AUTHOR]

In the secure multicast communication, data is transmitted in such a manner that only authorized group members are able to receive the data. The main challenging issue in dynamic and secure multicast communication is to design a centralized group key distribution protocol with minimum computation and storages complexity. This paper, proposes a more efficient centralized group key distribution (CGKD) protocol that minimizes the computation cost of key server (KS) during key updating. The computation cost of members is balanced during key recovery. This reduction in computation cost of KS is achieved by performing one addition, one multiplication and one encryption during single member join and one subtraction, one division and one encryption during a single member leave operation. Moreover, the storage complexity of KS is also minimized. Further, this paper also proposes an extended CGKD protocol based on clustered tree which is very scalable and efficient to deal with enormous membership changes. By comparing with existing similar protocols, the proposed protocol has significantly reduced computation and storage complexity of KS while maintaining less and balanced communication overhead of KS and storage load of each group member. The proposed protocol is implemented and tested on key-star and cluster tree based structure. The experimental results show that the proposed protocol is efficient in terms of computational overhead of KS and group members. [ABSTRACT FROM AUTHOR]

The article is focused on issues concerning the design of all needed software for researching the speed of the RSA encryption algorithm executed on a multithreaded platform. The base structure of the application is described in detail as well as the testing plan and algorithm. Shown is a method to handle and control all threads during the processes of encryption and description. The final results are visualized graphically though diagrams. [ABSTRACT FROM AUTHOR]

RSA is one of the best well-known public key cryptosystems. This methodology is widely used at present because there is not any algorithm which can break this system that has all strong parameters within polynomial time. However, it may be easily broken when at least one parameter is weak. In fact, many weak parameters are already found and are solved by some algorithms. Some examples of weak parameters consist of a small private key, a large private key, a small prime factor and a small result of the difference between two prime factors. In this paper, the new weakness of RSA is proposed. Assuming Euler's totient value, Ø(n), can be rewritten as Ø(n) = ad + b, where d is the private key and a,b, if a divides both of Ø(n) and b and the new exponent for the decryption equation is a small integer, this condition is assigned as the new weakness for breaking RSA. Firstly, the specific algorithm which is created for this weakness directly is proposed. Secondly, two equations are presented to find a, b and d. In fact, one of two equations must be implemented to find a and b at first. After that, the other equation is chosen to find d. The experimental results show that if this weakness has happened and the new exponent is small, original plaintext, m, will be recovered very fast. Furthermore, number of steps to recover d are very small when a is large. However, if a is too large, d may not be recovered because m which must be always written as m = ha is higher than modulus. [ABSTRACT FROM AUTHOR]

RSA is one of the best well-known public key cryptosystems. This methodology is widely used at present because there is not any algorithm which can break this system that has all strong parameters within polynomial time. However, it may be easily broken when at least one parameter is weak. In fact, many weak parameters are already found and are solved by some algorithms. Some examples of weak parameters consist of a small private key, a large private key, a small prime factor and a small result of the difference between two prime factors. In this paper, the new weakness of RSA is proposed. Assuming Euler's totient value, (n), can be rewritten as (n) = ad + b, where d is the private key and a,b, if a divides both of (n) and b and the new exponent for the decryption equation is a small integer, this condition is assigned as the new weakness for breaking RSA. Firstly, the specific algorithm which is created for this weakness directly is proposed. Secondly, two equations are presented to find a, b and d. In fact, one of two equations must be implemented to find a and b at first. After that, the other equation is chosen to find d. The experimental results show that if this weakness has happened and the new exponent is small, original plaintext, m, will be recovered very fast. Furthermore, number of steps to recover d are very small when a is large. However, if a is too large, d may not be recovered because m which must be always written as m = ha is higher than modulus. [ABSTRACT FROM AUTHOR]

Copyright of Revista de Ciências da Computação is the property of Universidade Aberta and its content may not be copied or emailed to multiple sites or posted to a listserv without the copyright holder's express written permission. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)

Ghost imaging technology has been widely used in the field of optical image encryption owing to its unique non-local imaging characteristics. However, there are some problems such as long encryption and decrypting time, poor reliability and large number of keys. To solve these problems, this paper proposed a computational ghost imaging encryption scheme based on RSA algorithm and wavelet transform. Firstly, the representation relationship between measurement matrix and random integer sequence is established to reduce the transmission of key quantity. Secondly, RSA encryption algorithm is used to improve the security of the system. Finally, using wavelet decomposition for packet transmission. In addition, the cake cutting matrix is used as the measurement matrix to reduce the sampling times and improve the quality of reconstructed images. The simulation results show that the encryption system has strong information transmission security and good robustness. It provides some reference for image encryption and information security transmission. • First: Proposed an optical image encryption scheme based on computational ghost imaging. • Second: The encryption process uses improved RSA encryption algorithm and wavelet transform. • Third: The results show that the scheme has good safety and noise resistance. [ABSTRACT FROM AUTHOR]

Efficient hardware implementations of public-key cryptosystems have been gaining interest in the past few decades. To achieve the goal, a high frequency as well as low latency Rivest-Shamir-Adleman (RSA) cryptosystem is reported in this paper. To configure such cryptosystem shift-add multiplier have been re-constructed and binary digit based modular exponentiation circuitry is proposed. Such exponentiation circuitry has been implemented through binary bit distribution technique, where, most significant bit (MSB) has been discarded for the implementation, owing to increase the operating frequency. The functionality of the reported algorithms were justified and compared in Hardware Description Language (HDL), simulated in Modelsim and synthesized in Xilinx ISE 14.2 platform. The proposed hardware implementation of RSA algorithm has a maximum frequency of operation of 545 MHz and 298 MHz for the bit sizes of 8 and 64 respectively. The proposed method shows improvements in terms of speed as well as in number of Look-up-tables (LUTs). Moreover, application-specific integrated circuit (ASIC) implementation of such cryptosystem of RSA was carried out through Encounter® RTL Compiler v11.10-p005_1 of Cadence® tool. [ABSTRACT FROM AUTHOR]

The problem of unauthorized access to various content is an important task for the present. It becomes even more acute when using the existing toolkit for the processing and transmission of encrypted images with the fluctuation intensity function. The authors developed a modification of the RSA algorithm to use it in relation to the above-mentioned images. It is proposed a conceptual view for the joint use of quaternary fractional-linear transformations with elements of the basic RSA algorithm. The application of this mathematical apparatus in the basic RSA algorithm avoids contours of image objects in an encrypted sample. In addition, this combination provides additional stability to the basic RSA algorithm for unauthorized decryption. The simulation of the method was carried out in two described by the authors algorithms: using one line and four lines of the image matrix, for grayscale and color images. The high efficiency of the developed method for avoiding contours of objects on encrypted images has been confirmed. In both cases, contours after applying encryption procedures do not appear. The reverse procedure allows to get an image without visible distortion. [ABSTRACT FROM AUTHOR]

Information protection services based on the use of elements of the RSA algorithm are quite reliable because the cryptostability of this method is high (RSA keys from 2048 bits and more). However, in terms of image encryption, in some cases, this algorithm leaves outlines of objects in an encrypted image. This imposes a number of additional limitations on the application of this algorithm. Avoiding partially saving contours in encryption using RSA can be by splitting the initial image into parts so that the image coating is topologically locally finite, that is, compact. The paper proposes a method of encryption-decryption using elements of the RSA algorithm and the topological image coverage. Such a combination will provide both a avoiding of the aforementioned disadvantage and an additional increase in cryptostability. The simulation of the method was done on grayscale and color images using two developed algorithms. The absence of contours of objects of input images in encrypted images of both types is experimentally established. The proposed solution can be used for any type of image, but the greatest benefits are achieved when using images with fluctuation intensity function. [ABSTRACT FROM AUTHOR]

Modular exponentiation is an exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography. Most technological applications of modular arithmetic involve exponentials with very large numbers. In this paper, we propose a high radix reconfigurable implementation for the Right-to-Left Modular Exponentiation with NAF-Representation by exploiting the maximum possible parallelism of the internal operations. The proposed design targeted the ALTERA Cyclone IV FPGA (EP4CGX22CF19C7) along with Quartus II simulation package. The proposed design was evaluated in terms of the maximum operational frequency, the total path delay, the total design area and the total thermal power dissipation. The synthesized results revealed that the proposed high radix architecture implementation has recorded: critical path delay of 25.5 ns, maximum operational frequency of 44.59 MHz, hardware design area (number of logic elements) of 2556 LEs, and total thermal power dissipation estimated as 221.82 mW. Consequently, the proposed modular exponentiation architecture can be efficiently employed by many public key cryptographic mechanisms. [ABSTRACT FROM AUTHOR]

A new conceptual scheme of encryption-decryption of grayscale and color images is proposed. It is based on the combining use of elements of the RSA algorithm and projective transformations. Application of the latter in the proposed scheme further increases the cryptographic stability of the method. The algorithmic implementations of the method developed on the basis of the proposed scheme for both element-by-element and for two-element image encryption-decryption is presented. The simulation of the method was carried out using algorithms of element-by-element and two-element encryption-decryption of grayscale and color images. It is established that encrypted images do not have contours of the original images, which provides the requirements for encryption. In addition, the effectiveness of the decryption procedure, where the resulting images haven't visible defects, is confirmed experimentally. [ABSTRACT FROM AUTHOR]

An elastic light-trail, the advanced version of a traditional light-trail, is one of the most recent dynamic traffic grooming technologies in an elastic optical network. In such networks, Orthogonal Frequency Division Multiplexing (OFDM) is a promising technology to execute the RSA (routing and spectrum assignment) algorithm and implement an elastic light-trail as a result. However, the reconfigurable optical add-drop multiplexers (ROADMs) and bandwidth variable Wavelength Selective Switches (WSSs) are required to implement an optically switched and spectrum varying elastic lightpath. In addition to the hardware equipment mentioned above, Add Drop Couplers (ADC) and optical ON/OFF switches (OS) are required to facilitate elastic light-trail in an elastic optical network. Hereafter, deployment of Add Drop Couplers (ADC) and optical ON/OFF switches incurs a significant network cost to facilitate elastic light-trail implementation. Toward the approach for eliminating this costly hardware setup, we have highlighted the fragmentation problem that occurs in spectrum domain in an optical fiber link. In this problem, the entire spectrum range in an elastic optical link is fragmented into several non-contiguous free spectrum slots at an instance during a data transportation session. In this regard, we have proposed "Multiple multi-hop non-contiguous elastic lightpath - MMNCEL " algorithm, where the required spectrum B of a traffic demand r (s , d , B , T) is sliced into n distinct granular spectrums { b 1 , b 2 , ... b n } according to the current availability and status of fragmented spectrum slots in an elastic optical link. Moreover, to setup an elastic lightpath, the algorithm allocates the same range of spectrum from every optical link in a route to preserve Spectrum Continuity Constraint (SCC), whereas, at each hop in a multi-hop elastic lightpath the algorithm performs opto - electrical conversion. In this paper, our objective is to achieve maximum network throughput in an elastic optical network without deploying ADC and optical ON/OFF switches. However, in this work, we have investigated optical spectrum utilization efficiency for the proposed MMNCEL , existing elastic light-trail (Multi-hop Elastic Light-trail algorithm - MELT) and elastic lightpath (Multi-hop elastic Lightpath algorithm - MEL), and performed comparison measurements preciously. [ABSTRACT FROM AUTHOR]

Intrusion Detection Systems (IDSs) are an integral part of an organization's infrastructure. Without an IDS facility in place to monitor network and host activities, attempted and successful intrusion attempts may go unnoticed. This study proposed a Collaborative Knowledge Repository Architecture for Intrusion Detection (CK-RAID). It is based on a distributed network of computer nodes, each with their individual IDS with a centralized knowledge repository system, and firewall acting as a defence. When an unfamiliar attack hits any node, the first step the intrusion monitor takes is to request from Knowledge Repository Server the most effective intrusion response. To improve performance, Intrusion Update module collaborates with IDSs sensor and log by updating their expert rule and intrusion information respectively and removing the old intrusion signature from the knowledge base with the aid of Intrusion Detector Pruning. To ensure security of information exchange, RSA encryption and Digital Signature were used to encode information during transit. The result showed that CK-RAID had a detection rate of 97.2%, compared with Medoid Clustering, Y-means, FCM and K-means that have an accuracy of 96.38%, 87.15%, 82.13% and 77.25% respectively. Therefore, CK-RAID can be deployed for efficient detection of all categories of intrusion detection and response. [ABSTRACT FROM AUTHOR]

In this modern era, where technology is increasing at rapid pace and made all day new developments, security is of highest priority. To protect facts into the unrecognizable form diverse technique are used for records hiding like steganography and cryptography techniques have been advanced. This paper securing the image by way of encryption is completed by LSB bits, DWT and RSA algorithm. This paper additionally presents new strategies wherein cryptography and steganography are mixed to scramble the information and in addition to cover the insights in some other medium through image processing (IP). The encrypted picture can be hiding in some other image by way of the use of LSB bits, DWT strategies so that the secret's message exists. RSA algorithm applied, receiver will use his/her private key because the secret data have been encrypted by recipient public key. Hide encrypted image in the cover image by DWT. Extract encrypted image from cover image and decrypt text by DWT. The proposed scheme is implemented in MATLAB platform the use of preferred cryptography and steganography set of regulations. Calculate PSNR and MSE. Also calculate the entropy of cover image and stego image. This method is secure for communication in the digital world with the digital data transmission. [ABSTRACT FROM AUTHOR]

Number theory has turned out to be one of the useful when it comes to computer security. For instance, number theory helps to protect sensitive data such as credit card numbers when you shop online, when online transactions is performed. The prime application of it's is in the RSA cryptosystem. Rivest Shamir Adleman (RSA) algorithm is known to be a slower algorithm. The modular arithmetic in RSA is computationally expensive. In view of this, it has become a major challenge to implement RSA decryption in a faster manner. In this paper, we proposed an efficient method to implement RSA decryption based on Chinese Remainder Theorem and Strong prime. Three different operations, primitive traditional method, Chinese Remainder Theorem method and Chinese Remainder Theorem and strong prime criterion were used for comparisons. Our proposal achieves about 60% computational cost reduction of traditional method using Chinese Remainder method. More interesting, if the method based on Chinese Remainder Theorem and strong prime is implemented, about 84% computational cost can be reduced. Also, comparing to the Chinese Remainder method, the method based on Chinese Remainder Theorem and strong prime of RSA criterion takes about 37% of computational cost, almost 3.2 times faster than the Chinese Remainder Theorem based method. Theoretically, it was observed that our scheme is faster and it is also cheaper. [ABSTRACT FROM AUTHOR]

Microsoft Excel offers a number of data manipulation tools that are extensively used to solve many business problems. However in Engineering and Computing Science these easy to use features are seldom used to solve appropriate problems. Instead most of the problems are solved using specific tools such as MATLAB. The Rivest-Shamir-Adleman (RSA) algorithm is one of the most well-known and secure public-key encryption methods used for secured data transmission. However because of growth of mobile and wireless devices and the constraints of limited bandwidth, storage, and power associated with these devices Elliptic Curve Cryptography (ECC) is being increasingly adopted to provide adequate security with less computational resources. To determine the public key, and to encrypt and decrypt messages for ECC algorithm one has to use complex mathematical calculations. Many students of Introductory Computer Security courses without adequate mathematical background find it difficult to apply ECC algorithm to compute appropriate public keys and encrypt and decrypt messages. In this paper author attempts to show how the ECC algorithm can be modeled with Microsoft Excel, and how Excel can easily and effectively be used to encrypt and decrypt messages. The author uses several examples to show the viability of the usage of Excel to implement ECC algorithm. The author finds that the Excel can be easily used in the classroom to demonstrate how the ECC algorithm functions. The author also discusses the limitations and practical issues related to using Excel. [ABSTRACT FROM AUTHOR]

Compared to the classical cryptography, lattice-based cryptography is more secure, flexible and simple, and it is believed to be secure against quantum computers. In this paper, an efficient signature scheme is proposed from the ring learning with errors (R-LWE), which avoids sampling from discrete Gaussians and has the characteristics of the much simpler description etc. Then, the scheme is implemented in C/C++ and makes a comparison with the RSA signature scheme in detail. Additionally, a linearly homomorphic signature scheme without trapdoor is proposed from the R-LWE assumption. The security of the above two schemes are reducible to the worst-case hardness of shortest vectors on ideal lattices. The security analyses indicate the proposed schemes are unforgeable under chosen message attack model, and the efficiency analyses also show that the above schemes are much more efficient than other correlative signature schemes. [ABSTRACT FROM AUTHOR]

In this paper a RSA based security system enabling the group of users to upload the single masked message to the cloud environment is proposed. Data stored are encrypted using RSA algorithm. The data receiver is able to encrypt the message retrieved from the cloud environment using private key. Two different separate RSA systems are used. The presented approach is divided into three parts. First, an RSA key is generated for each sender. Then masking the message by newly chosen mask proposed individually by every member, additionally encrypted by individual RSA private key of each member is proceed. Next, encrypting the gathered message inside the cloud environment, using the public key of the receiver is executed. In the third step, the message is decrypted by the receiver using his private RSA key. The scheme reduces the computational load on users side and transfers calculations and storage effort to the cloud environment. The proposed algorithm was developed for storing and sending the data that originally are produced by a group of users, but the receiver of the data is single. It was implemented using Java 8 and OpenStack software. Numerical test of different key length for RSA are presented. [ABSTRACT FROM AUTHOR]

One difficult problem of mathematics that forms the basics of some public key cryptography systems like RSA, is finding factors of big numbers. To solve this problem, many factorization algorithms have been offered with different complexities. Many attempts have been made today to implement these factorization algorithms. And these implementations are different from various aspects. Each of these factorization algorithms is efficient for numbers with a specific size. These algorithms can be compared with regard to time and memory complexity. In this paper, some of these implementations are studied and compared and consequently the most appropriate one will be introduced. [ABSTRACT FROM AUTHOR]

RSA is a public key cryptosystem that is currently the most popularly used in information security. Development of RSA variants has attracted many researchers since its introduction in 1978 by Ron Rivest, Adi Shamir, and Leonard Adleman. In this paper, we propose an algebraic structure for RSA and show that the proposed structure covers all known RSA variants. The usefulness of the proposed structure is then proved by showing that, following the structure we can construct a RSA variant based on the Bergman ring. We compare the original RSA and its variants from the point of view of factoring the modulus to determine why the original RSA is widely used than its variants. [ABSTRACT FROM AUTHOR]

In today's internet era, with online transactions almost every second and terabytes of data being generated everyday on the internet, securing information is a challenge. Cryptography is an integral part of modern world information security making the virtual world a safer place. Cryptography is a process of making information unintelligible to an unauthorized person. Hence, providing confidentiality to genuine users. There are various cryptographic algorithms that can be used. Ideally, a user needs a cryptographic algorithm which is of low cost and high performance. However, in reality such algorithm which is a one stop solution does not exist. There are several algorithms with a cost performance trade off. For example, a banking application requires utmost security at high cost and a gaming application sending player pattern for analytics does not bother much about security but needs to be fast and cost effective. Thus, amongst the cryptographic algorithms existing, we choose an algorithm which best fits the user requirements. In, this process of choosing cryptographic algorithms, a study of strengths, weakness, cost and performance of each algorithm will provide valuable insights. In our paper, we have implemented and analyzed in detail cost and performance of popularly used cryptographic algorithms DES, 3DES, AES, RSA and blowfish to show an overall performance analysis, unlike only theoretical comparisons. [ABSTRACT FROM AUTHOR]

Authenticated key agreement protocol must put in a nutshell of competent and strong cryptographic algorithm which is ensure confidentiality and integrity of message. Key Agreement Protocol using Elliptic Curve Cryptography provide significant development in cryptography to protect integrity, user anonymity and confidentiality of data than RSA, DSA. To examine, at a fundamental level, the environment of existing key agreement protocol. So that improved elliptic curve cryptosystem addressing implementation of secure key agreement protocol with greater security. To study network security tools in order to establish key agreement between two party or multi party communications various techniques and algorithms for implementation elliptic curve cryptosystem are discussed. Therefore suggested protocol can apply on wireless network to condense the security, performance requirement and cost of computation. [ABSTRACT FROM AUTHOR]

Remote user authentication is one of the most commonly used mechanisms to verify the legitimacy of a remote user over insecure communication channel. In remote user authentication, the server and the user mutually authenticate each other and establish a common session key for future communication. In this paper, we propose a secure and effective two-factor remote user authentication scheme based on RSA, which achieves mutual authentication and user anonymity properties. Informal security analysis ensures that the proposed scheme is secure against various malicious attacks and its security is based on the one-way hash function, smart card, and RSA algorithm. Performance comparison shows that the proposed scheme is efficient in terms of communication and computation overhead. Furthermore we demonstrate the validity of our proposed through BAN logic, which confirm that the proposed scheme achieve mutual authentication and session key agreement securely. [ABSTRACT FROM AUTHOR]

LSBS-RSA is a variation of RSA cryptosystem with modulus primes p, q, sharing a large number of least significant bits. As original RSA, LSBS-RSA is also vulnerable to the short secret exponent attack. Sun et al. [15] studied this problem and they provided the bound for secret exponent as: ...Thier bound does not reduce to the optimal bound 0.292 for original RSA, which is provided by Boneh-Durfee. In this paper, we achieve the bound ...which reduces to the Boneh-Durfee optimal bound. [ABSTRACT FROM AUTHOR]

With the prevalence of some high bandwidth-demanding applications, such as cloud computing, traditional wavelength-division-multiplexing passive optical networks have difficulties in satisfying such growing bandwidth demands due to its limited allocation-flexibility and utilization-efficiency. Therefore, elastic optical networks (EONs). In order to realize the flexibility in EONs, sophisticated routing and spectrum allocation (RSA) algorithms areone of the keyenabling technologies. However, most of the previous RSA algorithms were proposed with invariant routing and spectrum allocation strategies, which ignored considering the time-varying characteristics of EONs due to the variable network architecture and service provisioning. And such time-varying characteristics can deteriorate the spectrum fragmentation and the service blocking performances of EONs, which stimulates the application of various machine-learning technologies in EONs. In this paper, a long short-term memory based routing and spectrum assignment (LSTM-RSA) algorithm is proposed for EONs. By employing the long short-term memory technique to sense the complex status of EONs (e.g. spectral usage on the selected paths), the proposed LSTM-RSA algorithm gradually learns successful strategies through accumulating operation experience in the process of interaction and obtains higher returns through enhanced operation, which helps improve the spectrum fragmentation and the service blocking performances in EONs. Simulation results show that the spectrum fragmentation rate and the blocking rate of the proposed LSTM-RSA algorithm are reduced by about 6% and 8.9%, respectively, when compared to the traditional shortest-path-routing first-fitting RSA algorithm. [ABSTRACT FROM AUTHOR]

Many improvements have been made since the RSA origin in terms of encryption/decryption speed and memory saving. This paper concentrates on the performance improvement. Rebalanced RSA is designed to improve the decryption speed at the cost of encryption speed. Further work was done to improve its encryption speed in terms of rebalanced Chinese Remainder Theorem (CRT) variants. Rebalanced CRT variants improved the encryption speed at the cost of decryption speed. This paper also improves the performance of the encryption side in rebalanced RSA, while still maintaining the same decryption speed as in rebalanced RSA by adding the multiprime RSA feature to the rebalanced CRT variant. Proposed scheme gains the same advantage in encryption side as in rebalanced CRT variants, besides it is 2 times faster at decryption side than rebalanced CRT variants. Due to the use of multiprime feature, the key generation time is also decreased in this case. It is decreased approximately by a factor of 2.39 from rebalanced RSA CRT variant. Comparison of the RSA variants with the new scheme is shown in tabular and graphical way for better analysis. [ABSTRACT FROM AUTHOR]

RSA Cryptosystem is considered the first practicable secure algorithm that can be used to protect information during the communication. The significance of high security and efficient implementations of RSA have formed the base of many cryptographic engineering researches. In fact, the implementation of RSA Cryptosystem is heavily based on modular arithmetic and exponentiation involving large prime numbers. In this paper, we propose an efficient FPGA design and architecture for RSA cryptosystem using ALTERA FPGA Hardware Kit. The proposed design comprises six levels: random two prime numbers, parallel multiplication of the prime numbers and their decremented values, get encryption key, get decryption key, encryption and decryption levels. As the modular multiplication is considered as the heart of RSA computations, Interleaved Algorithm was particularly chosen as an efficient solution to speed up the modular multiplication. The experimental part of this work has been synthesized for both ALTERA Cyclone IV EP4CE115F29C7 and VERTIX VII VC707 FPGA kits and resulted in a maximum frequencies of 15.725MHz, 17.629MHz respectively. These findings make our design comparable and a good choice for efficient RSA Cryptoprocessor design. The results for the FPGA implementation for EC design using these curves is also proposed in this paper. [ABSTRACT FROM AUTHOR]

RSA Cryptography is a well-known example of public key cryptographic algorithms that involves robust encryption/decryption processes. In this paper, a microcontroller based RSA is designed and proposed. Arduino Mega2560R3 microcontroller supported with external memory and a screen touch LCD as well as a double keypad has been used under the programming of C language to implement the proposed RSA coprocessor with 32 bits. It was found that the trade of between message size and the encryption time can be drawn as a liner relationship according to the block size of the encryption phase. However, such design with a MCU provided with a small solar cell (and off course with a backup battery) as well as small block sizes is considered useful for the use in wireless sensor network (WSN) applications due to the ease of connecting the MCU to the WSN which as well avoid the processing time of encryption/decryption processes that could be executed by the MCU instead of the life limited sensors. [ABSTRACT FROM AUTHOR]

RSA signature algorithms using the Chinese remainder theorem (CRT-RSA) are approximately four-times faster than straightforward implementations of an RSA cryptosystem. However, the CRT-RSA is known to be vulnerable to fault attacks; even one execution of the algorithm is sufficient to reveal the secret keys. Over the past few years, several countermeasures against CRT-RSA fault attacks have tended to involve additional exponentiations or inversions, and in most cases, they are also vulnerable to new variants of fault attacks. In this paper, we review how Shamir's countermeasure can be broken by fault attacks and improve the countermeasure to prevent future fault attacks, with the added benefit of low additional costs. In our experiment, we use the sidechannel analysis resistance framework system, a fault injection testing and verification system, which enables us to inject a fault into the right position, even to within 1 µs. We also explain how to find the exact timing of the target operation using an Atmega128 software board. [ABSTRACT FROM AUTHOR]