Showing papers on "PKCS #1 published in 2012"

Public Key Cryptography Standards: PKCS

Abstract: Cryptographic standards serve two important goals: making different implementations interoperable and avoiding various known pitfalls in commonly used schemes. This chapter discusses Public-Key Cryptography Standards (PKCS) which have significant impact on the use of public key cryptography in practice. PKCS standards are a set of standards, called PKCS #1 through #15. These standards cover RSA encryption, RSA signature, password-based encryption, cryptographic message syntax, private-key information syntax, selected object classes and attribute types, certification request syntax, cryptographic token interface, personal information exchange syntax, and cryptographic token information syntax. The PKCS standards are published by RSA Laboratories. Though RSA Laboratories solicits public opinions and advice for PKCS standards, RSA Laboratories retain sole decision-making authority on all aspects of PKCS standards. PKCS has been the basis for many other standards such as S/MIME.

Modified RSA Encryption Algorithm (MREA)

Abstract: In asymmetric key cryptography, also called Public Key cryptography, two different keys (which forms a key pair) are used. One key is used for encryption & only the other corresponding key must be used for decryption. No other key can decrypt the message, not even the original (i.e. the first) key used for encryption. The beauty of this scheme is that every communicating party needs just a key pair for communicating with any number of other communicating parties. Once some one obtains a key pair, he /she can communicate with any one else. RSA is a well known public-key cryptography algorithm. It is the first algorithm known to be suitable for signing as well as encryption, and was one of the first great advances in public key cryptography. The security of the RSA cryptosystem is based on two mathematical problems: the problem of factoring large numbers know mathematical attack and the problem of trying all possible private keys know brute force attack. So to improve the security, this scheme presents a new cryptography algorithm based on additive homomorphic properties called Modified RSA Encryption Algorithm (MREA). MREA is secure as compared to RSA as it is based on the factoring problem as well as decisional composite residuosity assumptions which is the intractability hypothesis. The scheme is an additive homomorphic cryptosystem, this means that, given only the public-key and the encryption of m1 and m2, one can compute the encryption of m1 + m2. This scheme also presents comparison between RSA and MREA cryptosystems in terms of security and performance.

Bleichenbacher’s Attack Strikes again: Breaking PKCS#1 v1.5 in XML Encryption

Abstract: We describe several attacks against the PKCS#1 v1.5 key transport mechanism of XML Encryption. Our attacks allow to recover the secret key used to encrypt transmitted payload data within a few minutes or several hours, depending on the considered scenario.

Enhanced Method for RSA Cryptosystem Algorithm

Abstract: This paper proposed enhancing the RSA algorithm through the use of additional third prime number in the composition of the public and private key. This will increase the factoring complexity of the variable (n), where the process of its analysis with the development of equipment and tools becomes much easier nowadays.The existence of three prime numbers will give the ability to the enhanced encryption method to increase the difficulty of factoring of the variable (n), as well as speed increasing in the process of encryption and decryption. To generate a variable (n) using the original RSA algorithm, which contributes generating the public and private key that have a number of 300 digits by using two primes number with 150 digits each. In this case the multiplication process will take longer than the time of generating the same variable (n) by using three prime numbers where each number with 100 digits.We have conducted experiments on a set of numbers randomly, as they proved that the Enhanced Method for RSA Cryptosystem Algorithm is faster than the original algorithm in encryption and decryption process and generating public and private key. Also it shows that the analysis of the variable (n) will take a long time in the Enhanced Method for RSA Cryptosystem Algorithm and this indicates the increasing complexity in the analysis method.

On the instantiability of hash-and-sign RSA signatures

Abstract: The hash-and-sign RSA signature is one of the most elegant and well known signatures schemes, extensively used in a wide variety of cryptographic applications. Unfortunately, the only existing analysis of this popular signature scheme is in the random oracle model, where the resulting idealized signature is known as the RSA Full Domain Hash signature scheme (RSA-FDH). In fact, prior work has shown several "uninstantiability" results for various abstractions of RSA-FDH, where the RSA function was replaced by a family of trapdoor random permutations, or the hash function instantiating the random oracle could not be keyed. These abstractions, however, do not allow the reduction and the hash function instantiation to use the algebraic properties of RSA function, such as the multiplicative group structure of ℤn* . n. In contrast, the multiplicative property of the RSA function is critically used in many standard model analyses of various RSA-based schemes. Motivated by closing this gap, we consider the setting where the RSA function representation is generic (i.e., black-box) but multiplicative, whereas the hash function itself is in the standard model, and can be keyed and exploit the multiplicative properties of the RSA function. This setting abstracts all known techniques for designing provably secure RSA-based signatures in the standard model, and aims to address the main limitations of prior uninstantiability results. Unfortunately, we show that it is still impossible to reduce the security of RSA-FDH to any natural assumption even in our model. Thus, our result suggests that in order to prove the security of a given instantiation of RSA-FDH, one should use a non-black box security proof, or use specific properties of the RSA group that are not captured by its multiplicative structure alone. We complement our negative result with a positive result, showing that the RSA-FDH signatures can be proven secure under the standard RSA assumption, provided that the number of signing queries is a-priori bounded.

High speed implementation of RSA algorithm with modified keys exchange

Abstract: This paper aims to speed up the implementation of the RSA algorithm during data transmission between different communication networks and Internet, which is calculated to generate the keys by a program prepared in a C# language and then save these values of the keys in the databases created by SQL Server 2008 R2. Within indexed tables, this stage is called RSA-Key Generations Offline as it is an inevitable stage carried out in each gateway before using the RSA algorithm. In RSA algorithm identical database must be used in all networks gateways, the creation of the database controlled by a special protocol programmed in a C# language called RSA Handshake Database Protocol, the protocol controls each gateway that runs a RSA-Key Generations Offline according to specific issues and necessaries. In this paper a new method to exchange the values of the keys between gateways, which are exchanged indexes (Indexes Exchange) refers to the fields that contain the values of public and private keys that are stored in the tables inside the database before starting to use RSA algorithm to encrypt and decrypt the data, rather than using the exchange of real values n, e, and d.

A hybrid encryption algorithm based on RSA and Diffie-Hellman

Abstract: Internet and Network applications have seen a tremendous growth in the last decade As a result incidents of cyber attacks and compromised security are increasing This requires more focus on strengthening and securing our communication One way to achieve this is cryptography Although a lot of work has been done in this area but this problem still has scope of improvement In this paper we have focused on asymmetric cryptography and proposed a novel method by combining the two most popular algorithms RSA and Diffie-Hellman in order to achieve more security

Cryptography and Security: from theory to applications

Abstract: This paper surveys research jointly with Jean-Jacques Quisquater, primarily the joint work on DES, on exhaustive key search machines, and on information hiding.

Study and performance analysis of cryptography algorithms

Abstract: Today's world, for secure data transmission via Internet or any public network, there is no alternative to cryptography The role of Cryptography is most important in the field of network security The main goal of cryptography is Confidentiality, Integrity, Authentication, Nonrepudiation Cryptography is widely used by governmental and intelligence agencies around the world to safe transmission of any format of messages online or offline In this study is made for the cryptography algorithms, particularly algorithms are compared and performance is evaluated

Implementation of rsa algorithm using elliptic curve algorithm for security and performance enhancement

Abstract: This paper introduces the concept and implementation of RSA algorithm for security purpos e and to enhance the performance of software system using this algorithm. In this article we have done study about RSA algorithm. This study includes what is RSA algorithm and why they are used in the field of Cryptography & Network Security. After doing several works on this topic we came to conclude that RSA algorithm is important to Network Security because they are the components (i.e. Encryption & Decryption key) which interact with the Security system. Without them the system will be useless as RSA are used to fire a particular Encryption & Decryption keys process because of which Security system is build. Here we are dealing with general problem in which we have a particular Security system event of a software system and our objective is to secure that system into a software security because without software security system cannot be secure any things in this world. Here we are discuss with attacks made against the underlying structure of the RSA algorithm, which exploit weaknesses in the choice of values for the encryption and decryption keys, and their relation to the RSA modulus N. ————————————————————

Design of hierarchical visual cryptography

Abstract: This paper describes the concept of hierarchical visual cryptography. The key idea behind hierarchical visual cryptography is to encrypt the secret information in number of levels. As the number of levels in hierarchical visual cryptography increases, the secrecy of data tends to increase. An intelligent authentication system is also proposed using hierarchical visual cryptography. The shares generated out of Hierarchical visual cryptography are found to be random giving no information. The expansion ratio is also reduced to 1:2 from 1:4.

A Discussion on Elliptic Curve Cryptography and Its Applications

Abstract: Elliptic curve cryptography (ECC) is a kind of public key cryptosystem like RSA. But it differs from RSA in its quicker evolving capacity and by providing attractive and alternative way to researchers of cryptographic algorithm. The security level which is given by RSA can be provided even by smaller keys of ECC (for example, a 160 bit ECC has roughly the same security strength as 1024 bit RSA). In this paper, we will present some ECC algorithms and also gives mathematical explanations on the working of these algorithms.

Public Key Cryptography for RFID-Tags

Abstract: RFID-tags are a new generation of bar-codes with added functionality. An emerging application is the use of RFID-tags for anti-counterfeiting by embedding them into a product. Public-key cryptography (PKC) offers an attractive solution to the counterfeiting problem but whether a publickey cryptosystem can be implemented on an RFID tag or not remains unclear. In this paper, we investigate which PKC-based identification protocols are useful for these anti-counterfeiting applications. We also discuss the feasibility of identification protocols based on elliptic curve cryptography (ECC) and show that it is feasible on RFID tags. Finally, we compare different implementation options and explore the cost that side-channel attack countermeasures would have on such implementations

Serious Security Weakness in RSA Cryptosystem

Abstract: Nowadays, RSA is the well-known cryptosystem which supports most of electronic commercial communications. RSA is working on the base of multiplication of two prime numbers. Currently different kinds of attacks have indentified against RSA by cryptanalysis. This paper has shown that regardless to the size of secret key and public key, it is possible to decrypt one cipher text by different secret keys RSA algorithm and in excellent condition, there are two similar key at least available in domain of two prime numbers multiplication.

Type-Based analysis of PKCS#11 key management

Abstract: PKCS#11, is a security API for cryptographic tokens. It is known to be vulnerable to attacks which can directly extract, as cleartext, the value of sensitive keys. In particular, the API does not impose any limitation on the different roles a key can assume, and it permits to perform conflicting operations such as asking the token to wrap a key with another one and then to decrypt it. Fixes proposed in the literature, or implemented in real devices, impose policies restricting key roles and token functionalities. In this paper we define a simple imperative programming language, suitable to code PKCS#11 symmetric key management, and we develop a type-based analysis to prove that the secrecy of sensitive keys is preserved under a certain policy. We formally analyse existing fixes for PKCS#11 and we propose a new one, which is type-checkable and prevents conflicting roles by deriving different keys for different roles.

Computational Complexity Theoretical Analyses on Cryptographic Algorithms for Computer Security Application

Abstract: We know the i§signed-digit recoding algorithmi¨ has less occurrence probability of the nonzero digit than original binary number representation. The goal of study time-efficient and space-efficient algorithms for modular arithmetic comes from the applications in modern cryptography, such as RSA cryptography and El-Gamal cryptography. Taking the RSA cryptography for example, the public and private keys are functions of a pair of prime numbers, and the encryption and decryption operations are accomplished by modular exponentiation. Fast modular exponentiation algorithms are often considered of practical significance in RSA cryptosystem. By using the technique of recording the common parts in the folded sub strings can improve the efficiency of the binary algorithm, thus can effective reduce the computational complexity of modular exponentiation.

An Efficient RSA Cryptosystem with BM-PRIME Method

Abstract: Using more than two factors in the modulus of the RSA cryptosystem has the arithmetic advantage that the private key computation can be speeded up by CRT. With this idea, we present an efficient combination of two variants of RSA cryptosystem (Batch and Mprime RSA) which makes the decryption process faster than the existing variants. It can not only speed up RSA decryption but also guarantee the security of RSA cryptosystem.

Secret-Key Cryptography

Abstract: Cryptography started its life as secrete-key cryptography at least 5000 years ago, whereas public-key cryptography started its life officially in 1976. In this chapter we shall first give a formal introduction to secret-key and public-key cryptography, and then discuss the most influential and useful secret-key cryptosystems, from both a historical and a cyberspace perspective.

A hybrid reconfigurable cryptographic processor with RSA and SEA

Abstract: Data security is in Demand in everyday life of Digital World, since Digital data's can be reproduced much easily. To achieve the maximum security required a Parallel Processing, User Reconfigurable Cryptographic RISC Microprocessor is proposed in our paper. Rather than protecting the data using tools and external codes, a microprocessor is specially designed in our project to offer maximum digital security. Cryptographic processor can be classified either as asymmetric cryptography or a symmetric cryptography processor. Asymmetric cryptography has the advantage of Reception security but has the limitation of High resource Utilization. And a symmetric cryptography processor has the limitation of single key security but comparatively has the advantages of low area, resource and power consumption. Thus in this project we are proposing Hybrid architecture in which both the advantage of asymmetric and symmetric cryptographies are combined. For implementation, Asymmetric RSA cryptography and a symmetric lightweight SEA encryption is combined to mutate a reconfigurable Cryptographic processor.

Poly-alphabetic Symmetric Key Algorithm Using Randomized Prime Numbers

Abstract: Cryptography is an art and science. It is a playing major role in information and security division. The main aim of the cryptography is protecting the data from unauthorized users or hackers. "Cryptography is subject contains two parts one is encryption and another one decryption. Encryption is a process converting the plain text to cipher text using some keys. Decryption is a process of converting the cipher text to plain text using the keys". There are several algorithms in cryptography to encode and decode the data based on the key. This paper discusses types of cryptography and different keys in cryptography. The paper can give brief description about symmetric key algorithms and we are proposing new algorithm in symmetric key cryptography. The proposed algorithm contains two levels of Exclusive OR (XOR) operation. This algorithm is useful in transmission of messages and data between one user and another.

An overview of modern cryptography - TI Journals

Abstract: Cryptography is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and electrical engineering. Applications of cryptography include ATM cards, computer passwords, and electronic commerce. In this paper we want to have a short look at modern approaches in cryptography. So, terminology, history and types of modern cryptography will be talked here.

Advantages of Classical Cryptography Over the Quantum Cryptography - TI Journals

Abstract: Quantum cryptography is having lots of consideration in present time for security but it’s important to note that implementation of algorithms using QC is not viable if one wants to have the security intact. A technique needs to be theoretically strong and also practically viable. But quantum cryptography comes to naught in the latter. It can only be used to share keys using Quantum Key Distribution (QKD). Distribution of keys is just a part of securing information. In this paper first we explain the classical cryptography (CC) and the concept of quantum cryptography (QC) then we explain the various advantages of CC over QC.

Performance Evolution of RSA and New Cryptosystem

Abstract: One of the advanced cryptographic scheme for generating public key and private key. These are more significant in developed cryptography system. This paper generates a new cryptosystem of Jordon-Totient function and applied them to RSA public key cryptosystem with public key and private key which can be used for development of protocols to provide secured communication between different company authorities and customers. This new RSA cryptosystem (SA_RSA) will be fast encrypted & decrypted as compare to RSA .If we increase the size of private key it avoids the attacks on private key. It gives a high security as compare to RSA. We showed the graphical performance analysis on test results for key generation time, encryption time and decryption time respectively.

A Method for breaking RSA Security

Abstract: The security on many public key encryption schemes relied on the intractability of finding the integer factoring problem such as RSA scheme. However, there are great deals of researches related to the RSA factoring modulus compared with the other type of attacks RSA scheme. So the need for more methods of attacks other than RSA factoring modulus to obtain an efficient and faster algorithm to solve this problem is still essential. This paper introduces a new algorithm which attacks the RSA scheme. The suggested algorithm aims to obtain the private key of the RSA scheme and then factoring the modulus based on the public key e of the RSA scheme. The new idea claimed to be more efficient than the already existed algorithms especially when the public key e is small, since most of public key encryption schemes select a small encryption exponent e in order to improve the efficiency of encryption. The suggested algorithm is claim to be more efficient than the already existed algorithms of attack since it is faster and takes less running time.

A comparative analysis of the possible attacks on rsa cryptosystem

Abstract: In public-key or asymmetric cryptography, each individual has a pair of keys, ( e, d ), where e is the public key, and d is the private key. The public key is used to encrypt the message sent, and the private key is used to decrypt the ciphertext (for the verification purpose).RSA[6] is frequently used in applications such as e-mail, e-banking, etc, where security of digital data is vital. Over years, numerous attacks on RSA illustrating RSA’s present and potential vulnerability have brought our attention to the security issues of RSA cryptosystem. We will investigate some attacks and will propose a new possible attack.Here is how RSA encryption and decryption works. To encrypt a message M (

Mediated RSA cryptography specification for additive private key splitting (mRSAA)

Abstract: This document describes recommendations for the implementation of public key cryptography based on the mediated RSA algorithm. The Mediated RSA algorithm bases on fragmentation of a private key. As a result the signature process consists from multiple stages. The verification process is the same as in the case of RSA algorithm [RFC3447].

Providing Security in Data Aggregation using RSA algorithm

Abstract: The RSA algorithm proposed by Rivest, Adi Shamir and Leonard Adleman is cryptography technique. The current problem with wireless sensor network is how to protect the security of the sensor data. RSA algoritm is used as a digital signature authentication in the field of security, basically works on deciding encryption variable. In this also the basic concept is to decide a description variable and then decide the description variable using same encryption variable. It is a secure and fast cryptographic system. The major effort will be applied on the RSA encryption technique in order to make node authenticated as well as to secure data while dealing with aggregation.

A Modified Improved text encryption approach inspired by Genetic Algorithm techniques using RSA Algorithm

Abstract: In the recent times, security is the main thing that everybody is asking for; in the electronically message transferring system, data/information can be hacked anytime during transmission. The technique of keeping a message secure is cryptography. Cryptography is the study of mathematical techniques related to aspects of information security such as on fidentiality, data integrity, entity authentication, and data origin authentication.