Search

Currently, every electronic transaction involving important information requires a digital signature (DS). The procedure used to prove the authenticity of the DS, the authenticity of the sender's identity, and the non-repudiation of the DS can be carried out with authentication techniques. Signing the DS is done using a hash function. The message digest (MD) generated by the hash function (ℎ) will be encrypted by reversing the roles of the private and public keys in the Rivest-Shamir-Adleman (RSA) cryptographic algorithm. The main objective of this research is to propose DS authentication using the RSA algorithm. The signature is signed through MD encryption using the RSA algorithm using a private key PR{d, n}. The signature is verified by decrypting the DS using the public key PU{e, n}, thus getting the ℎ value. The h value is compared with the ℎ' value obtained from the value of the DI hash function of the checked DS. The result of this research is that the signature is verified to be authenticated, if the result is h = h′, then means that the received DS is genuine and comes from the signed user (user authentication), never modified (data integrity), and the sender can't deny the signature (non-repudiation). [ABSTRACT FROM AUTHOR]

Since the RSA algorithm is no longer secure and a lot of research has been done to break down RSA security, it is necessary to do research by making a combination of modifications of RSA algorithms, in this case using enhanced RSA using fake modules, with RCCM (RC4 Chaotic Map) algorithms to produce a Hybrid Cryptosystem that is expected to be able to improve the security of secret messages. The combination process is done by encrypting the messages using the RCCM algorithm first, then the messages that have been encrypted back in the encryption using the enhanced RSA algorithm with fake modules. So the security of messages has been improved. As for the results of this study, the key generation process is automatically generated which produces keystream for RCCM and fake public key and fake private key for enhanced RSA. In addition, what distinguishes enhanced RSA from ordinary RSA is the use of four primes p, q, r, and s. as well as the application of chaotic maps to RCCM gives the advantage of the unnecessary use of generating keys manually. With these keys, the process of encryption and decryption can be carried out to generate a secret message. In addition, the program resulting from this research applies the kraitchik factorization algorithm as a medium of attack against the key. The conclusion of this study is that by doing a hybrid cryptosystem enhanced RSA and RCCM can be safer due to the occurrence of double encryption processes. In addition, an enhanced RSA algorithm determines a fake module where the value of X is a prime number so that if attacked using a kraitchik factorization algorithm it is difficult to find a factorization of X values that corresponds to the number of p, q, r, and s. [ABSTRACT FROM AUTHOR]

The complexity of public key algorithms like RSA and variants of Elgamal is based on the involvement of exponentiation in encryption and decryption. RSA is based on integer factorization and variants of Elgamal or based on discrete logarithms and are formed as hard problems. To achieve the perceived level of security, the required key length for public key cryptosystem needs to be determined. Quantum computers are capable of conducting an exponential number of simultaneous computations because of which they can find factors in polynomial time. Shor's algorithm is popular algorithm for factoring huge integers in polynomial time on quantum computers. This paper presents RSA algorithm followed by various possible attacks for factoring and demonstrates Shor's algorithm for factoring and discuss results for interpretations. [ABSTRACT FROM AUTHOR]

In the future, this study aspires to evaluate and contrast Rivest Shamir Adleman utilizing the existing state-of-the- art in the safety of cloud data through Secure Socket Layer. In this study, we divided the sample size into two groups: one using the SSL method and the other using the RSA technique. To achieve the target precision of 80% with a limit of 0.05% and a confidence interval of 95%, device measurements were collected and processed 10 times. When compared to the RSA algorithm 79.30% precision, SSL's 90.20% is much greater. The variation among the two groupings is not statistically important (P=0.35, p>0.05). In terms of safety of data, the SSL approach outperforms the RSA method. [ABSTRACT FROM AUTHOR]

Enormous amounts of electronic data are produced and exchanged each day. However, two main concerns arise wherever electronic data is involved-privacy and security. Apart from protecting information, confidentiality and integrity of the original data should also be preserved. This is where an emerging technology called Reversible Data Hiding (RDH) comes into play. RDH is a method that allows the insertion of information into an encrypted image, without needing to decrypt the image first. It maintains the confidentiality of the data alongside retaining the original image pixels and reducing the degree of distortion. Hence because of its features, RDH proves to be a versatile solution for data transmission. Many reversible data hiding schemes were proposed like bit modification, integer transform-based RDH, error correction coding, etc. However, the main drawbacks were low hiding capacity and high distortion. Hence, steganography with cryptography was proposed. Cryptography encrypts data and is decrypted and processed by the intended users. Steganography hides the messages such that its existence could be detected only by the authorized users. The development of a graphical user interface (GUI) is a highlight of this review, as it showcases the combination of RSA and AES encryption algorithms. The GUI serves as a visual representation of the use of hybrid encryption and steganography to enhance security. [ABSTRACT FROM AUTHOR]

Immediate and appropriate treatment for severely ill patients should be a top priority in healthcare. To get the treatment they need, they should have to go quite a distance. Patients may have significant health complications as a result of this journey. It is imperative that we shift away from this outdated model of healthcare and towards a more modern one so that people from all over the globe may get the care they need. The idea behind remote healthcare is that patients may access their physicians and other medical professionals from any location with the tap of a finger on a smartphone. From the standpoint of illness prevention, monitoring, hospital administration, and medical research, this distant healthcare incorporates several features made possible by contemporary information technology. Network of Things, fifth-generation wireless technology, data analytics on the cloud, microelectronics, AI, etc. All parts of remote healthcare may be improved by these technology. The healthcare business relies on data security measures to safeguard patients' private health information. Internet of Things (IoT) devices should provide privacy and security features in addition to remote data transmission. Such safety issues are addressed by constructing a hybrid database environment. Secure storage of patient data is an important design goal of the hybrid database system. Public and private data coexist in a hybrid database. A private database stores the personally identifiable information of patients, whereas a public database stores the rest of the raw data. Public data is encrypted using an advanced encryption standard technique, while private data is encrypted using the Fernet scheme. An advantage of using a hybrid database to store sensitive and non-sensitive data is the increased security it provides. Total calculation time, encryption time, and decryption time of AES and Fernet encryption are some of the metrics used to assess the suggested system's performance. [ABSTRACT FROM AUTHOR]

Financial management application is the most effective way to organize every expense of daily life. As technology today is moving forward at an exponential rate, self-financial management has become a common trend. Thus, the financial management system played an important role in daily life. Nevertheless, the financial management system nowadays is confronted with several problems that ought to be enhanced further for improvement such as Data Security Authentication Issue, Data Security Transmission Issue and User Experience Issue. To solve these problems, Firebase Password Authentication and RSA Encryption have been equipped as the authentication method for this proposed mobile application, namely Finant due to their strong security features in encryption algorithms to ensure that passwords are safely stored and transmitted. Secondly, User Experience Issues have been improved by implementing E-Wallet Function. This e-wallet function can guarantee that users' financial information is constantly up to date. In this application, the expected deliverable functions are Expenses Analysis, Plan Budget, Preview PDF as main functions, and also E-Wallet as new features for all users. Surveys on user experience were conducted before and after the application development. Positive feedback on the proposed application has demonstrated its effectiveness and usefulness. [ABSTRACT FROM AUTHOR]

The primary goal of this study is to provide hashed private keys of big size and authentication mechanisms in order to increase security and decrease the time complexity of transferring private data over a computer network. Thus, the solutions to the encryption and decryption processes increase both security and privacy. The use of a combination of keys is crucial, since it allows for simplification. Group 1 consists of RSA, Group 2 is RSA-CRT, and Group 3 is Novel N-PRIME RSA, all of which are employed in this research. N=10 was chosen as the sample size to apply this study's findings for each group. Pre-test confidence levels were maintained at 80%. Comparing the performance of Novel N-PRIME RSA with that of RSA and RSA-CRT, we find that it excels in both the encryption and decryption phases of the process, with a time complexity rate that seems low for the former. The 95 percent confidence interval for the means of accuracy for RSA, RSA-CRT, and N-PRIME RSA is p(0.003), 84.8900 sec, and 80.245 sec, respectively. It can be shown from the complexity figures that Novel N-PRIME RSA performs better than both RSA and RSA-CRT. [ABSTRACT FROM AUTHOR]

As life developed, cryptography became crucial. As its utility is not limited to changing the structure of information and making it difficult to interpret (even if it reaches unauthorized individuals), it proves that the information is real from its source and has not been modified during the transmitting or saving process. In this research modifying the NTRU (Number Theory Research Unit) cryptosystem by employing QKD (quantum key distribution) to change the mathematical structure with a physical structure for the public as well as text encryption and decryption. As a result, to obtain higher security to detect EAV and automatically change the key if EAV detects and intercepts the data when the transmutation between ALICE and BOB is quantum-mechanically approved, the laws of quantum mechanics can be used to make cryptographic protocols that are always safe. [ABSTRACT FROM AUTHOR]

Encryption based on singular cubic curves cryptosystem is still being actively researched. This paper provides a secure public key cryptosystem based on a singular cubic curve. Isomorphism theorems are addressed in singular cubic curves and applied as a tool for RSA, and their effectiveness and level of security are determined by encrypting a text message and comparing it to an RSA algorithm. [ABSTRACT FROM AUTHOR]

Nowadays, Images play a big part in many applications, so it's important to safeguard sensitive data from unwanted access or even manipulation. Encryption is one of the best ways to achieve this goal. Researchers have developed a number of image encryption methods in recent years. They use a variety of concepts as image encryption tools to increase security. In this work Laplace transformation will be a tool to encrypt images for the first proposed algorithm. RSA public key cryptosystem will be involved together with Laplace transformation for the second and third proposed algorithms to make the transform of image is more efficient. Mean square error, peak signal to noise ratio and unified average changing intensity were used to test the proposed algorithms, demonstrating their speed and high level of security. [ABSTRACT FROM AUTHOR]

Twenty-first century is the era of globalization and digitization. Nowadays, internet rules every aspect of life. Today, human life and activities are not limited to a society or locality. By means of social networking and service oriented architecture each and every emotion and action is computerized. Therefore, data security and privacy preservation need ultimate priority and attention. Cryptography is the part of computer science which deals with information security. Diverse cryptographic methodologies are available for different media. Ensuring and enhancing security of text data is of utmost importance, as, majority of online communication still happens via text media. The method of transforming original text into unintelligible cipher text before sending it through insecure channel is called encryption and the reverse process is decryption. Modern day encryption is broadly classified into two categories – Symmetric key or private key cryptography and Asymmetric key or public key cryptography. This paper presents a detail survey on symmetric key cryptography, where same key is used for both encryption and decryption. All available private key encryption methods have been properly reviewed and analyzed, enlisting their advantages and limitations over each other. [ABSTRACT FROM AUTHOR]

This study discusses the design and manufacture of applications for electronic service scripts in accordance with MENPAN-RB Regulations Number 6 of 2011 regarding electronic service scripts. The application is built based on the existing requirements in the MENPAN-RB Regulation by securing data in the database using the SHA-3 algorithm, RSA digital signature, and comparing the AES and Blowfish encryption algorithms to find which algorithm is better for applications with a bandwidth of 10mbps. The Blowfish algorithm is superior in speed of encryption, decryption, and better throughput value than AES, so that in this application the Blowfish algorithm is used as the data encryption algorithm. [ABSTRACT FROM AUTHOR]

Wireless Sensor Networks (WSNs) are susceptible to various attacks due to node deployment in hard and hostile environments. In order to mitigate the impact of those offensives, the security of the data in WSNs depends heavily on cryptographic techniques. As a result, different cryptographic methods ensure network security. Symmetric and asymmetric are the two methods of cryptography. However, there are still some issues. For example, the symmetric method needs more storage to distribute the key to all nodes in the network, while the asymmetric method needs more computation. In this paper, a hybrid cryptographic algorithm is proposed. It combines high security with fast decryption and encryption via the use of symmetric and asymmetric cryptographic methods to minimize memory overhead and computation. It enables the use of three cryptographic objectives: integrity, confidentiality, and authentication. The idea is to encrypt using Rivest Cipher 4 (RC4) and Blowfish, ensure integrity using Message Digest 5 (MD5), and authenticate using Elliptic Curve Diffie Hellman (ECDH). A Raspberry Pi and two PCs are used to check the performance of the proposed algorithm. It is better than many other existing algorithms in terms of throughput, ciphertext size, encryption time, and decryption time. By using a Raspberry Pi and a 184,162 B plaintext size, the proposed algorithm achieves a reduction in ciphertext size of 37% when compared to an algorithm named HA, a reduction in encryption time of 88.5% when compared to an algorithm named HCA, a reduction in decryption time of 39.5% when compared to HCA, and boosts the throughput by 866% compared to HCA. [ABSTRACT FROM AUTHOR]

Cryptography is the study of secret writing. Cryptography comprises of numerous customary algorithms like DES, AES, IDEA and so on for encoding the message in a secured way. IOT plays a very important role by providing approvals and verifications to the users. These benefits are hampered by attackers. Also, existing measures cannot safeguard the IoT from information leakages. Most of the researchers has aimed at constructing solutions for light weight cryptography like RSA (Rivest–Shamir–Adleman) technique, which provides enhanced security of data. In this paper, RSA-Homomorphic Encryption-based lightweight cryptography is used which generates keys using semi-primes [2]. Generation of prime factors plays an important role for this technique. Mathematical operations are performed on sum of four squares of semi prime number that would generate prime factors which would lead to brute force attacks on RSA keys. In this paper, we propose a novel scheme that recovers quickly one of the factors of semi-prime by applying operations on sum of squares with modified greatest common divisor (GCD)[1]. This technique uses Brahma Gupta Fibonacci identity for generating prime numbers and also the keys. Homomorphic encryption scheme using RSA encryption technique is used which enhances the security of the system [3][4]. The algorithm employs mathematical operations on sum of four squares to obtain the prime factors of a semi-prime using brahma Gupta identity which enhances security by preventing attacks. [ABSTRACT FROM AUTHOR]

Pusat Penelitian dan Pengabdian Masyarakat (P2M Center) Politeknik Negeri Batam manages researches and community services activities for academic purposes. One of the activities have been conducted regularly is an internal funding for research and community services. Sistem Informasi Pusat Penelitian & Pengabdian Masyarakat (SIMP3M) has been provided as an information system to facilitate the activity. On a conventional system, a reviewer could assess the proposal, made a review and signed the assessment paper. However, current information system doesn't provide those processes. Authentication on the reviewer at a specific assessment as well as the assessment was nothing. Thus, the originality of the assessment process has been questioned. In this study, we proposed an implementation of digital signature on the SIMP3M to address the authentication issue. Rivest-Shamir-Adleman (RSA) cryptographic algorithm and (Secure Hash Algorithm) SHA were used as algorithm to build the digital signature. An avalanche effect analysis was used as a method to prove the concept. As digital signature has been proved to solve the issue, results show that about 90% the originality of assessment can be shown and authentication can be preserved. [ABSTRACT FROM AUTHOR]

The contemporary breakthrough in the field of technology have facilitated us with plethora of technological devices such as computers and so on. With this tremendous advancement, an individual heavily rely on technology to secure the electronic data and communications. Internet neither gives nor takes away security. Although internet provide countless assistance but the risk of loss of crucial data is always there. In order to secure the confidential data like financial records, health records and many more, a techniquenamed Cryptography proved to be a boon for users. It converts some undisclosed information to not readable texts by using secure algorithm. RSA algorithm is used by information security professionals to encode and decode messages and for solving recurrent problem. RSA algorithm has a level of complexity which is linked to increased bit length. It's a slow process in cases where large chunk of data needs to be encrypted by the same computer. It is pressingpriority to introduce a more secure method in order to safeguard our data from any illegal attempt. To resolve this problem, we proposed an elliptic curve two factor authentication scheme. It has proved to be the best encryption method which is far better than existing norms. Implementation also demonstrates the efficiency in term of computation cost, it will also show the comparative analysis of existing schemes. [ABSTRACT FROM AUTHOR]

Information security plays a crucial role in data protection. All our data is secured and protected by cryptographic algorithms. This paper aims to consider the performance of cryptographic algorithms such as AES (Advanced Encryption Standard), ElGamal, RSA (Rivest Shamir Adelman), and Hybrid Cryptography and further compare them. We have done a comparison on parameters like the CPU execution time, memory space, and encryption-decryption time for different key sizes and file sizes. [ABSTRACT FROM AUTHOR]

During the last three decades, Information Technologies created a revolution in the field of Computer Networks, and now every information or data is an asset. As an asset when we transfer any information or data from one system to another system over internet, it needs to be secured from unauthorized attacks. So, Cryptography has an important role for security of it. Cryptography ensures for security, integrity, and confidentiality of any information or data during transmitting over internet. Elliptical Curve Cryptography (ECC) is betterment in the area of Cryptography that provides a faster and more secure algorithm for encryption and decryption of information or data. The main objective of this paper is focusing on Elliptical Curve Cryptography (ECC) so here we will describe ECC algorithms and how ECC is better than RSA for encryption and decryption of any information or data. [ABSTRACT FROM AUTHOR]

Internet became a salient part in our every day life. We use internet for making transactions and sending important and sensitive files. If the information to be sent is very important and sensitive we require a secure means of communication inorder to send the data. Cryptography is meant for that purpose which will provide security to our data. Here security is given to the data by implementing both aes and sha algorithms. The design is Synthesized using verilog. The design of AES algorithm is customized to implement simply on Xilinx software. AES is a symmetric key cipher algorithm that can be used for transfer of data from sender to receiver in an effective manner. Encryption is performed at sender side which is a means of converting original message into certain pattern of codes called cipher text for security reasons. Decryption is performed at receiver side to get original message from the coded message. In AES depending upon rounds different key sizes(194,128,256) bits can be used. AES consists of different steps like pre round transformation, key expansion, shift rows and mix columns. Some key advantages of AES encryption and decryption algorithm are fast in execution and it uses higher length size128 bits for encryption which gives more security to the data as it requires 2^128 attempts to deploy or hack the data. Secure hashing is used for generating hash codes from the input and this method is considered to be secure because it is impossible to deploy the original message from hash code. In this project SHA-1 is implemented. SHA-1 works on data having length of 512 bits and generates a 160 bit data called as hash codes or digest. SHA uses different logic operations like and shift and xor..SHA is used for generating the key to encryption algorithm which leads to more security. [ABSTRACT FROM AUTHOR]

The Advanced Encryption Standard (AES) algorithm is a symmetric encryption algorithm which is much faster, secure and consumes less power when compared to the previous cryptographic algorithms like DES and RSA. It can be implemented in software as well as hardware. The paper compares the advantages and disadvantages of various implementation of AES algorithm and proposes the design of standard cells and macro cells for Application-Specific Integrated Circuit (ASIC) of AES. A total of 212 standard cells and 20405 instances were designed and implemented using cadence virtuoso. The cells were fully custom designed using 45 nm technology with minimum channel length of 50 nm. The total number of cells in proposed implementation was lesser than other ASIC implementations. There was a significant percentage of decrease in area, power and timing constraints when compared to GPDK045_SC. [ABSTRACT FROM AUTHOR]

Cryptography is the study of methodologies to promote secure communications by hiding or converting the original information to some unintelligible form. Graph Labeling is allocation of integers to edges and vertices of a graph following a set of conditions. Cryptography and graph theory are inextricably linked to each other since time immemorial. Here we implement cryptographic writing by combining the concepts of symmetric and asymmetric encryption techniques namely Pairwise Alternating Nested Caesar Cipher and RSA Algorithm with graph labeling. The former is an improved version of the popular symmetric encryption technique namely Caesar Cipher whereas the latter is an asymmetric cryptography algorithm widely used by modern computers to encrypt and decrypt messages. The plaintext undergoes hybrid encryption producing a Hybrid ciphertext which the sender passes to receiver as a Cryptographic writing comprising of Cipher Graph accompanied with a clue. We embrace Simply Sequential Additive labeling technique for ciphertext identification and the original plaintext is retrieved through corresponding decryption. The proposed methodology thus adopts the positive traits of both symmetric and asymmetric encryption ensuring double layer security of encrypted messages from adversaries, as knowledge of both Cryptography and Graph labeling is essential to proceed further. [ABSTRACT FROM AUTHOR]

Homomorphic Encryption, a magic wand in the field of cryptography that enables the user to perform secure computation over encrypted data, without decrypting the data. It allows cloud service providers to have access to encrypted data instead of original data, which also facilitates secure computation over encrypted data along with the secure transmission of it. NTRU, open-source public-key cryptography, based on lattices, is one of the standards of Homomorphic Encryption, can be used for secure outsourcing, the transmission of data, and performing computation on encrypted data. NTRU scheme is not vulnerable to quantum computer-based attacks, unlike existing traditional cryptographic techniques. In this paper, NTRU, the homomorphic encryption scheme is reviewed. The different variants of NTRU are also explainedthrough a detailed literature studybased on ring structure.The analysis also has been done that may help researchers to have a clear understanding of NTRU and its different variants and to distinguish them easily. The availability of different types of fields, rings based on different structures, different algebra, etc. for implementation of NTRU opens a new way for researchers to explore them to achieve a more efficient NTRU scheme for real-life applications. [ABSTRACT FROM AUTHOR]

Modular inversion is a crucial operation for performance and security of the public key cryptography. Unfortunately its use cases in the most popular algorithms like ECC and RSA are a bit different. It makes development of universal system/ algorithm for both of them difficult. This paper presents results of the constant time modular inversion algorithm development process which achieves high level of security in context of Timing Attacks and Simple Power Analysis which are basic but serious danger for cryptographic implementations. [ABSTRACT FROM AUTHOR]

A multi-dimensional QTRU public-key cryptosystem improves NTRU by replacing the original ring in NTRU by quaternion algebra. In this paper, we introduce QMNTR an improvement of QTRU by using a new mathematical structure of two public keys and five private keys. This modification has enhanced the public key system to be more robust and secure. [ABSTRACT FROM AUTHOR]

One of the uses of the Chinese Remainder Theorem (CRT) is to shorten the time in the RSA Cryptosystem decryption process. However, in applying a combination of the CRT method and the RSA Algorithm with Python programming modules, recursion errors often occurred when determining the inverse modulus to establish the private key. The error was caused by limitation iterations of the related algorithm. Some Python library needs more iteration processes to calculate the inverse modulus for larger key size. This is a pure computational problem. The standard RSA algorithm uses two prime numbers to generate their key pairs. The multi-prime RSA modification based on more than two prime numbers can be applied to solve the problem. A modified RSA was applied in Python programming that generates keys based on 2, 4, 8, 16, and 32 prime numbers. Regarding on our experiments, the combination of the CRT method and RSA algorithm based on four prime numbers can be applied without recursion error up to a key length of 6280 bits, with eight primes up to 12,560 bits, with sixteen primes up to 25,120 bits, and with thirty-two primes up to 50,240 bits. Implementation of more multi-prime numbers can expand to combine the CRT method and RSA Algorithm for longer key sizes by approximation relation y = 1567,8x + 63,333, which y is the key size and x is the number of primes numbers. The method also can increase key generation and decryption rate significantly. [ABSTRACT FROM AUTHOR]

Every day the number of attacks increases to break the encryption algorithms. Therefore, it is considered necessary for designing a new algorithm with higher security. Any cryptographic system must have some fundamental features to resist any effective attack, preserve the transmitted information, and robust the statistical characteristics. This article aims to improve the RSA algorithm using a three-dimensional chaotic dynamic system with sophisticated attributes, which proposed for this purpose. It is derived from Memristive's and Sprott's chaotic systems. We call it a 3D-hyperchaotic Memristive Sprott system (3D-HMSS). This new system is adopted in generating keys for the RSA encryption algorithm. Some tests are used to show the efficiency of the proposed cryptosystem. [ABSTRACT FROM AUTHOR]

Li and Li et al. proposed the HER-XOR scheme in 2013 which differs from the work by Ivy et al. To Li-Li scheme, there have errors since they misused RSA algorithm. In this paper the author would like to point out this incorrect and also fixed it. [ABSTRACT FROM AUTHOR]

In 2015, Thangavel et al. proposed the MRSA scheme which differs from the work by Ivy et al. Thangavel’s scheme has error since they misused RSA algorithm. In this paper the author would like to examine this error and also correct it. [ABSTRACT FROM AUTHOR]

The rapid increase of the number of motorized vehicles, increase exposure to more accidents both in terms of the number and the severity. The road safety audit (RSA) is one of the measures to overcome this problem. An RSA is a form of official test of a road section (along its stages of construction) conducted independently by a trusted auditor who is capable to assess the potential accident. To conduct the road safety audit comprehensively, systematically and independently, it is required to recruit auditors who are capable to carry on road and street furniture design and construction based on a specified standard. At present, there are no guidelines regarding recruitment and training for road safety auditors. This paper is intended to develop such guidelines. Hypothetically to be successful, the road safety auditors not only need to be intelligent but also got suitable personalities to undertake road safety audit tasks. [ABSTRACT FROM AUTHOR]

The study of recent crustal movements is one of the priority areas of the Earth sciences. Geodetic methods occupy a particularly important place in the general complex of measurements and investigations of crustal movements because they provide quantitative information on the condition and development of geodynamic processes. The paper outlines the newly accepted project with main goal monitoring the geodynamic processes in the area of Sofia. This goal will achieve by periodic GNSS measurements over the Sofia geodynamic network and using data from continuously operating reference stations from National GNSS Network. The study will give estimates of the recent crustal movements in the area; active strain and strain rate and correlation between the crust movements, seismic events and tectonic structures. DInSAR method, based on interferometric images, will also apply to obtain independent estimates of the crustal movements from RSA data. The paper summarizes the geodetic, geological and seismotectonic information about the territory around Sofia obtained up to now. A description of the existing geodynamic geodetic network in the studied area is given and main characteristics of the geological setting are made. The data show the presence of active faults in the area that need to be investigate. The research project can be seen as a new stage in the study of an area with a clear seismic hazard. It is propose to develop current issues related to the joint interpretation of geodetic, geological and seismotectonic information for the assessment of recent geodynamic processes. The expected results will be a contribution to the assessment of natural risk and seismic hazard in the studied area. [ABSTRACT FROM AUTHOR]

Thangavel and Varalakshmi proposed "Enhanced Schmidt-Samoa cryptosystem for data confidentiality in cloud computing" in 2016, they modified the Schmidt-Samoa (SS) scheme, namely Enhanced Schmidt-Samoa (ESS) scheme into cloud computing environment. According to this algorithm, the authors develop two tiny programs those are Android app and HTML version used to mobile phone in any where. In the same time; the authors also analyze the security flaw of ESS algorithm in this article. [ABSTRACT FROM AUTHOR]

Due to the impact of network technology, all information are transmitted in digital mode and the security of information is ever more important. In order to ensure the secret messages are not been stolen when transmitting, it will be a good countermeasure to encrypt the secret message before transmitting. The level of security of information is based on the number of participants. Security is definite when a single person is involved. In the scenario, if many people are involved, security may be ensured if secrets are kept in. This lead the direction for researchers to develop new cryptographic scheme in the past two decades. This paper proposes techniques for transmission of secret messages between two parties and also sharing of messages between multiple parties. These methods uses well known public key cryptography algorithm RSA and Hilbert matrix for authentication and encryption. The proposed method overcome the issues addressed by the existing scheme and ensures secure transmission of text messages with less computational Complexity and no additional code book. The proposed (N, N) Secret sharing Scheme also reduces the overhead of generation of keys for each pair of parties. [ABSTRACT FROM AUTHOR]

The information technology rapidly development and dramatically changed the life style people, in addition to shortening the distance of communication, but also promote the smooth exchange of information flows. However, derivatives to facilitate the relative safety of these issues, since into the digital information age, the majority of the practitioners of engineering and technical personnel and technical workers in terms of technology, information security is increasingly becoming an important issue. The RSA algorithm was published in 1978. It is a kind of very popular and widely application modem cryptosystem in the world. Especially to electronic commerce and finance industries urgent demand, it is a real time rain. As time flies, the hardware, software and computation skill have upgraded, does RSA algorithm really secure as they claimed or hide the fact that unspecified? It will be one of all at our research in near future. [ABSTRACT FROM AUTHOR]

In the communication area, user is more focus on communication instead of security of the data communication. Many cryptosystems have been improvised to achieved the effectiveness in communication. RSA cryptosystem is one of well-known cryptosystem used to secure the information and protect the communication by providing a difficulty to the attackers specifically in encryption and decryption. As need arises for guarantee the security of the cryptosystem while the communication must be ensured, we propose a new RSA cryptosystem which is based on fuzzy set theory whereby the plaintext and the ciphertext are in terms of Triangular Fuzzy Number (TFN). Decryption result shows that the message obtained is the same as the original plaintext. This study reveals that the fuzzy set theory is suitable to be used as an alternative tool in securing other cryptosystem. [ABSTRACT FROM AUTHOR]

With the rapid development of Internet and the extensive application of computer technology, the security of information becomes more and more serious, and the information security technology with data encryption technology as the core has also been developed greatly. Data encryption technology not only can encrypt and decrypt data, but also can realize digital signature, authentication and authentication and other functions, thus ensuring the confidentiality, integrity and confirmation of data transmission over the network. In order to improve the security of data in network communication, in this paper, a hybrid encryption system is used to encrypt and decrypt the triple DES algorithm with high security, and the two keys are encrypted with RSA algorithm, thus ensuring the security of the triple DES key and solving the problem of key management; At the same time to realize digital signature using Java security software, to ensure data integrity and non-repudiation. Finally, the data encryption system is developed by Java language. The data encryption system is simple and effective, with good security and practicality. [ABSTRACT FROM AUTHOR]

Mobile payment system is defined as an electronic payment method, also it is defined as mobile money transfer and mobile wallet. Since mobile payment has been generated to be an attractive alternative for the traditional payments systems such as credit cards. In this paper Elliptic curve cryptography is used to mobile payment system. Meanwhile, the proposed mobile payment system includes three main processes: Authentication process, Member recognition process, and Payment process. Moreover, Elliptic Curve Integrated Encryption Scheme ECIES and Elliptic Curve Digital Signature Algorithm ECDSA cryptographic protocols have been applied to enhance the security of the proposed mobile payment system. However, the proposed system is secure, easy and straightforward payment process. As well as, USSD technology is used in this system for PIN authentication process with high security performance. [ABSTRACT FROM AUTHOR]

The efficiency of encryption-decryption procedures has become a major problem in asymmetric cryptography. Compression-RSA technique is developed to overcome the efficiency problem by compressing the numbers of kplaintext, where k ∈ Z+ and k > 2, becoming only 2 plaintext. That means, no matter how large the numbers of plaintext, they will be compressed to only 2 plaintext. The encryption-decryption procedures are expected to be more efficient since these procedures only receive 2 inputs to be processed instead of kinputs. However, it is observed that as the numbers of original plaintext are increasing, the size of the new plaintext becomes bigger. As a consequence, it will probably affect the efficiency of encryption-decryption procedures, especially for RSA cryptosystem since both of its encryption-decryption procedures involve exponential operations. In this paper, we evaluated the relationship between the numbers of original plaintext and the size of the new plaintext. In addition, we conducted several experiments to show that the RSA cryptosystem with embedded Compression-RSA technique is more efficient than the ordinary RSA cryptosystem. [ABSTRACT FROM AUTHOR]

We put forward a probable hard problem based on a Diophantine equation that has characteristics to become an asymmetric primitive. Motivated by rearranging the equation representing the RSA modulus, N together with its Euler-phi function, [lowercase_phi_synonym](N) we define the Diophantine Equation Hard Problem (DEHP) on a definitive setting. Relation between the RSA factorization problem, RSA's e-th root problem and the DEHP is also discussed. A proposed asymmetric cryptosystem that manipulates DEHP together with the difficulty of factoring a product of strong primes is presented. [ABSTRACT FROM AUTHOR]

Microcontroller can be easily adopted in various applications with a variety of peripherals due to its merits of small size, simple architecture and etc. However, the limited computing power restricts its application in cryptography. In this paper, we try to integrate microcontroller with different peripheral devices to support more powerful cryptography computation in a simple and efficient way. Based on the most popular open source microcontroller development platform, Arduino, we design and develop a cryptographic hardware device for a real-life application which provides data protection functions for authority and integrity with RSA cryptography supported. With the peripherals Java card, our Arduino-cored solution is able to efficiently generate digital signature of photos taken by smart phone using the asymmetric cryptographic algorithm, RSA, which has a poor performance if it is directly implemented on microcontroller. The experimental results show that the device can finish a RSA 1024-bit encryption in 82.2 microseconds, which is reasonable in real application scenario and illustrates the feasibility of implementing more complicated cryptographic system using microcontroller. [ABSTRACT FROM AUTHOR]

We focus on text based watermarking techniques based on Pseudo-Random Number Generator(PRNG) for Cryptography application. We survey related workin digital watermarking, cryptography and design methodology, then develop our own text based watermarking method (embedded and extract/detection of watermarks). Our implementation result have shown that better accuracy of extracted watermark and PRNG random bit sequence made its strengthen the security of protecting data. Our RSA Key generator therefore holds potential for future implementations of PRNG in practical parallel applications such as parallel grid computing, parallel genetic programming, parallel cryptography, and parallel computation analysis. This paper is intended to provide a reference finding for newcomer's security designer and to promote more activities in these security issues. [ABSTRACT FROM AUTHOR]

This paper will propose i-RSA algorithm, this algorithm is focus on key generation algorithm. Enhancement of this algorithm is user identity can be used as a public key such as email address. Previous algorithm was successful used email identity as a public key, but not all type of email can used as a public key. So we propose i-RSA algorithm that can produces 66.6% compared to previous algorithm (46.67%) email can be a string public key. The differences between i-RSA and previous algorithm are looping process in key generation, to get new value of p and q parameter, looping process will stop when value of k is equal to 1, and the email can be a public key. RSA algorithm and CRC 32 hash function will be explain in preliminaries section. Detail explanations of i-RSA algorithm in propose algorithm section. In future, i-RSA algorithm can be improved, so that 100% of email can be a public key. [ABSTRACT FROM PUBLISHER]

The security of cloud computing has always been an important aspect of quality of service from cloud service providers. However, cloud computing poses many new security challenges which have not been well investigated. This paper focusing on issues relating to the cloud data storage methods and security in virtual environment. We propose a method for providing data storage and security in cloud using public key cryptosystem RSA. Further, describes the security services includes key generation, encryption and decryption in virtual environment. [ABSTRACT FROM PUBLISHER]

The threshold proxy signature scheme allows the original signer to delegate a signature authority to the proxy group member to cooperatively sign message on behalf of an original signer. In this paper, we also propose a new scheme which includes the features and benefits of the RSA scheme which is a popular security technique. Also, we will evaluate a security of undeniable threshold proxy signature scheme with known signers. We find that the existing threshold proxy scheme is insecure versus the original signer forgery. We also demonstrate that a threshold proxy signature suffers from a conspiracy of an original signer and a secret share dealer, and that the scheme is commonly forgeable, and cannot offer undeniable. We claim that the proposed scheme offers the undeniable characteristic. [ABSTRACT FROM AUTHOR]

The need for preserving secrecy of sensitive data has been ever-increasing with the new developments in digital communication. In this paper, we present an advanced method for embedding encrypted secret data in grayscale images to provide high level security of data for communication over unsecured channels. The proposed system combines the features of Cryptography and Steganography. Cryptography involves converting the secret message into a non-recognizable cipher. Steganography is then applied using Double-stegging to embed this encrypted data into a cover media and hides its existence. [ABSTRACT FROM PUBLISHER]

In Wireless Sensor Network compromised node and denial of service are two key attacks. In this thesis the data delivery mechanisms that can with high probability circumvent black holes formed by these attacks. The classic multipath routing approaches are vulnerable to such attacks, mainly due to their deterministic nature. So once the adversary acquires the routing algorithm, it can compute the same routes known to the source, hence, making all information sent over these routes vulnerable to its attacks. A mechanism is developed that generate randomized multipath routes. Under this designs, the routes taken by the “shares” of different packets change over time. Each and every packet gets encrypted before sends and decrypted after receiving all the packets. So even if the routing algorithm becomes known to the adversary, the adversary still cannot pinpoint the routes traversed by each packet. Besides randomness, the generated routes are also highly dispersive and energy efficient, making them quite capable of circumventing black holes. [ABSTRACT FROM PUBLISHER]

Data mining extracts pattern or knowledge from a large amount of data. In the applications that are based on information sharing, an additional challenge is faced; while dealing with data containing sensitive or private information. Common data mining techniques do not address this problem. Therefore, the knowledge extracted from such data may disclose patterns with sensitive or private information. This may put the privacy of individuals or groups, the business strategies and classified information at risk [1]. In the recent past years, Privacy Preserving Data Mining (PPDM) has attracted research interest with potential for wide applications. This paper considers all data repositories and one node for pattern extraction at distributed locations. Many techniques like anonymity, randomization and cryptography have been experimented with privacy preserving data mining . This paper considers information system based approach as not all attributes may store same level of sensitive data. Therefore, some attribute values may require higher degree of privacy preservation than some others. This paper explores the use of cryptography, namely DES algorithm for encrypted data sharing to achieve privacy preservation. The experiments have been carried out on the size of the secret key that is proportional to the level of sensitivity of the attribute for multilevel security. The RSA algorithm has been used to encrypt the DES algorithm key for enhancing secured communication. [ABSTRACT FROM AUTHOR]

Elliptic curve cryptosystems are more efficient and secure than the conventional cryptosystems like RSA cryptosystems. We develop a Secret Key in the EKR Modified Montgomery Inversion Algorithm to avoid leaks the value of function f in Almost Montgomery Inversion Algorithm. The attacker can not guess the Secret key (t) to retrieve the valuable information in smart cards and mobile devices. We want to develop the new cryptosystem based on EKR Modified Montgomery Inversion Algorithm to resistance against Simple Power Analysis Attacks in Side- channel Attacks in Elliptic Curve Cryptosystems like RSA Cryptosystems. [ABSTRACT FROM AUTHOR]

Wireless sensor nodes have less power (uses battery) when compared with the wired network nodes. So routing protocol used in WSN must consume less power to increase the operational lifetime of the WSN. Use of single path routing protocols in WSN will lead to holes in the network because the data load is not shared among many paths like multipath routing protocol. So, multipath routing protocols are recommended for WSN. Node disjoint multiple paths are selected for data transmission to spread the load among different nodes. After selecting the multiple paths, the transmission range of the nodes are adjusted based on their neighbor node's location. If the neighbor node is nearer then the transmission range of the node is reduced which leads to the low energy consumption. To provide security digital signature based cryptographic system is used with the RSA algorithm and MD5 hash function. [ABSTRACT FROM PUBLISHER]