Public Key Cryptosystem Based on Two Sided Action of Different Exotic Semirings

The idempotent semirings Rmax and Rmin play a crucial role in several areas of mathematics and their applications such as discrete mathematics, algebraic geometry, computer science, computer languages, linguistic problems, optimization theory, discrete event systems, fuzzy logics. In this paper we consider the expansion of the semirings Rmax and Rmin with residuals and describe how to use these expended semirings in public key cryptography.

New Public Key Cryptosystems from Combinatorial Group Theory

External direct product of some low layer groups such as braid groups and general Artin groups, with a kind of special group action on it, provides a secure cryptographic computation platform, which can keep secure in the quantum computing epoch. Three hard problems on this new platform, Subgroup Root Problem, Multi-variant Subgroup Root Problem and Subgroup Action Problem are presented and well analyzed, which all have no relations with conjugacy. New secure public key encryption system and key agreement protocol are designed based on these hard problems. The new cryptosystems can be implemented in a general group environment other than in braid or Artin groups.

A Modified and Secured RSA Public Key Cryptosystem Based on “n” Prime Numbers

Cryptography is the study that provides security service. It concerns with confidentiality, integrity, and authentication. Public key cryptography provides an enormous revolution in the field of the cryptosystem. It uses two different keys where keys are related in such a way that, the public key can use to encrypt the message and private key can be used to decrypt the message. This paper proposed an enhanced and modified approach of RSA cryptosystem based on “n” distinct prime number. This existence of “n” prime number increases the difficulty of the factoring of the variable “N” which increases the complexity of the algorithm. In this approach, two different public key and private key generated from the large factor of the variable “N” and perform a double encryption-decryption operation which affords more security. Experiment on a set of a random number provided that the key generation time, analysis of variable “N”, encryption and decryption will take a long time compared to traditional RSA. Thus, this approach is more efficient, highly secured and not easily breakable.

Public-Key Cryptosystems with Secret Encryptor and Digital Signature

This paper describes and compares a variety of algorithms for secure transmission of information via open communication channels based on the discrete logarithm problem that do not require search for a generator (primitive element). Modifications that simplify the cryptosystem are proposed, and, as a result, accelerate its performance. It is shown that hiding information via exponentiation is more efficient than other seemingly simpler protocols. Some of these protocols also provide digital signature/sender identification. Numeric illustrations are provided.

Multivariate Public-Key Encryption Scheme Based on Error Correcting Codes

Advances in quantum computers pose potential threats to the currently used public-key cryptographic algorithms such as RSA and ECC.As a promising candidate against attackers equipped with quantum computational power,Multivariate Public-Key Cryptosystems(MPKCs)has attracted increasing attention in recently years.Unfortunately,the existing MPKCs can only be used as multivariate signature schemes,and the way to construct an efficient MPKC enabling secure encryption remains unknown.By employing the basic MQ-trapdoors,this paper proposes a novel multivariate encryption scheme by combining MPKCs and code-based public-key encryption schemes.Our new construction gives a positive response to the challenges in multivariate public key cryptography.Thorough analysis shows that our scheme is secure and efficient,and its private key size is about 10 times smaller than that of McEliece-type cryptosystems.

Public key based uniform access framework in 3G systems

This paper compares two types of access methods in 3G telecommunication systems, registration based access method and alternative access method. Through analyzing their common ground, we establish a public-key based uniform access framework, which combines different access methods into one unified model and provides more scalability and flexibility. Then an improved wireless authentication protocol is introduced into the framework, which gives an example of how unification is obtained by using public key technology. Since original protocol has flaws, an improved one is proposed based on security investigation. Improved authentication protocol overcomes the weakness of the original one, and maintains all the security features owned by old protocol. Finally, the feasibility of this framework is analyzed with consideration of current development in mobile telecommunication fields and the future trend of 3G systems. The result shows that public key technology has a promising future in 3G and Beyond 3G systems. It points out a new way for key management in future telecommunication systems.

public—key密码系统破裂问题浅介

任何一个公开密钥密码系统(pkcs)可能在非确定的多项式时间内破裂,那么,最低限度,在确定的多项式时间内pkcs则不应当破裂,证明意味着,已知系统在N≠NP时是安全的.简略地说:pkcs的“破裂问题”是一个明文信息M的计算问题,而M又是由未知当前脱密密钥的密码C编码的.典型的计算问题,转换成多项式时间的等值判定性问题,而计算问题的复杂性结构是结合判定问题的分类来度量的.从而,确立了密码复杂性转换成精确结构的论点.

FAPKC3: A New Finite Automaton PublicKey Cryptosystem

This paper deals with finite automaton public key cryptosystem and digital signatures. A new system FAPKC3 is proposed which can be used for encryption and implementing digital signatures as well. Some performances of a software implementation of FAPKC3 are presented and its security is discussed.

Batch Private Keys Generation for RSA in Security Communication Systems

RSA public key cryptosystem is extensively used in information security systems. However, key generation for RSA cryptosystem requires multiplicative inversion over finite field, which has higher computational complexity, compared with either multiplication in common sense or modular multiplication over finite field. In order to improve the performance of key generation, we propose a batch private keys generation method in this paper. The method derives efficiency from cutting down multiplicative inversions over finite field. Theoretical analysis shows that the speed of batch private keys generation for s users is faster than that of s times solo private key generation. It is suitable for applications in those systems with large amount of users.

The generalization of public key cryptosystem FAPKC4

FAPKC4, a public key cryptosystem based on automata theory, is generalized so that component automata of compound automata in user’s public key would not be restricted to memory finite automata. The generalized FAPKCA can be used in encryption and implementing digital signatures as well.

ANIMPROVEDSCHEMEFORAPKCSBASEDONTHEPRMETHOD

With the goal of minimizing the enciphered data redundancy R , we first make a feasibility analysis on the PKCS which is based on the PR method, indicating its difficulties in real applications. Then we generalize the method to such a case that an arbitrary number system can be utilized in the system. We form some conditions that should be satisfied when we want to create security keys, to encipher plaintexts or to decipher cryptograms. Finally, a qualitative analysis is made on the improved PR method with the results that the data redundancy R of enciphered text for the improved PR method is far smaller than that of the primitive PR method and its enciphering and deciphering procedures are accordingly sped up. Moreover, the security of the new scheme is by no means worse than that of the old one.

New Weak Keys in RSA

The security of the RSA system with the prime pairs of some special form is investigated. A new special-purpose algorithm for factoring RSA numbers is proposed. The basic idea of the method is to factor RSA numbers by factoring a well-chosen quadratic polynomial with integral coefficients. When viewed as a general-purpose algorithm, the new algorithm has a high computational complexity. It is shown thai the RSA number n = pq can be easily factored if p and q have the special form of p = as＋b, q=cs＋d, where a, b, c, d are relatively small numbers. Such prime pairs （p, q） are the weak keys of RSA, so when we generate RSA modulus, we should avoid using such prime pairs （p, q）.

A Group Oriented Cryptosystem for the Vector Space Access Structure

A group oriented cryptosystem for the vector space access structure was proposed. This cryptosystem adopts self-certified public keys. It allows the participants of an authorized subset to cooperatively access an encrypted message. All data delivered in the cryptosystem are public. Therefore it does not need a partial decrypting results combiner and any secure communication channel. The security of the group oriented cryptosystem is based on the intractability of the discrete log problem and difficulty of factoring large integers. The suspected attacks can not break it.

Timing Attack Analysis on AA_βCryptosystem

Timing attack is an attack on the implementation of a cryptographic primitive. The attack collects leaked secret data via certain implementation techniques either on software or hardware. This paper provides an analysis of a theoretical timing attack on the AAβ algorithm. The attack discussed in this paper gives avenues for secure implementation of AAβ against timing attacks. The simulation of the attack is important to provide invulnerability features for the algorithm in order to be implemented and embedded on applications. At the end of the attack, a method to overcome it will be introduced and it is called AAβ blinding.

Biometric Signature of Private Key by Reliable Iris Recognition Based on Flexible-ICA Algorithm

The numerical world is under a fast development generating facilities and threats. The recommended solutions are especially the protection of information in all its states. The levels of protection show a discrepancy from an application to another;governmental, commercial or even cybercriminal. The infrastructure used in modern cryptography is based on public key cryptosystem. The problem is how to make safe the private key and to memorize it without difficulties and damages. This paper introduces a biometric solution of owner signature generating an encryption of the key using the iris recognition kept in a smart card. Several precautions were taken to guarantee the safety and the availability of the use of the private key. They are two essential goals to attest: the quality of the service and the robustness of suggested safety. Being the quality of the service, the used iris recognition is based on a new emerging method founded on Flexible-ICA algorithm. This method offers a better Equal Error rate compared to other methods previously used. This quality of recognition was also reinforced by an encoding of error using a flag and finally Reed Solomon encoder. For recommended safety, a scheme based on block encryption is used. The proposed scheme is Propagating Cipher Block chaining which offers a very propagation of a high level of confusion and diffusion. Indeed, the robustness of this cryptographic process was studied by setting up strict criteria of safety.

A threshold key escrow scheme based on public key cryptosystem

In key escrow field it is important to solve the problem thatuser's secret key completely depends on the trusted escrow agency. In 1995, some methods of solving the problem were presented. But these methods are no better than that of directly using threshold cryptography. In this paper, we present a common pattern of threshold key escrow scheme based on public key cryptosystem, and a detailed design based on the improved RSA algorithm is given. The above problem is solved by this scheme.

An Efficient Heterogeneous Ring Signcryption Scheme for Wireless Body Area Networks

Wireless body area networks(WBANs)are an emerging technology for the real-time monitoring of physiological signals.WBANs provide a mechanism for collecting,storing,and transmitting physiological data to healthcare providers.However,the open wireless channel and limited resources of sensors bring security challenges.To ensure physiological data security,this paper provides an efficient Certificateless Public Key Infrastructure Heterogeneous Ring Signcryption(CP-HRSC)scheme,in which sensors are in a certificateless cryptosystem(CLC)environment,and the server is in a public key infrastructure(PKI)environment.CLC could solve the limitations of key escrow in identity-based cryptography(IBC)and certificate management for public keys in PKI.While PKI is suited for the server because it is widely used on the Internet.Furthermore,this paper designs a ring signcryption method that allows the controller to anonymously encrypt physiological data on behalf of a set of sensors,but the server does not exactly know who the sensor is.The construction of this paper can achieve anonymity,confidentiality,authentication,non-repudiation,and integrity in a logically single step.Under the computational Diffie-Hellman(CDH)problem,the formal security proof is provided in the random oracle model(ROM).This paper demonstrates that this scheme has indistinguishability against adaptive chosen ciphertext attacks(IND-CCA2)and existential unforgeability against adaptive chosen message attacks(EUF-CMA).In terms of computational cost and energy usage,a comprehensive performance analysis demonstrates that the proposed scheme is the most effective.Compared to the three existing schemes,the computational cost of this paper’s scheme is reduced by about 49.5%,4.1%,and 8.4%,and the energy usage of our scheme is reduced by about 49.4%,3.7%,and 14.2%,respectively.

New Public-Key Cryptosystem Based on the Morphism of Polynomials Problem

During the last two decades, there has been intensive and fast development in Multivariate Public Key Cryptography （MPKC）, which is considered to be an important candidate for post-quantum cryptography. However, it is universally regarded as a difficult task, as in the Knapsack cryptosystems, to design a secure MPKC scheme （especially an encryption scheme） employing the existing trapdoor construction. In this paper, we propose a new key-exchange scheme and an MPKC scheme based on the Morphism of Polynomials （MP） problem. The security of the proposed schemes is provably reducible to the conjectured intractability of a new difficult problem, namely the Decisional Multivariate Diffie-Hellman （DMDH） problem derived from the MP problem. The proposed key agreement is one of several non-number-theory-based protocols, and is a candidate for use in the post-quantum era. More importantly, by slightly modifying the protocol, we offer an original approach to designing a secure MPKC scheme. Furthermore, the proposed encryption scheme achieves a good tradeoff between security and efficiency, and seems competitive with traditional MPKC schemes.

Practical Cryptanalysis of a Public Key Cryptosystem Based on the Morphism of Polynomials Problem

Multivariate Public Key Cryptography （MPKC） has intensively and rapidly developed during the past three decades. MPKC is a promising candidate for post-quantum cryptography. However, designing it is universally regarded as a difficult task to design a secure MPKC foundation scheme, such as an encryption scheme and key exchange scheme. In this work, we investigate the security of a new public key cryptosystem that is based on the Morphism of Polynomials （MP）. The public key cryptosystem proposed by Wang et al. （Wuhan University, China） comprises a key exchange scheme and encryption scheme. Its security can be provably reduced to the hardness of solving a new difficult problem, namely, the Decisional Multivariate Diffie Hellman （DMDH） problem. This problem Js a variant of the MP problem, which is difficult to solve by random systems. We present a proposition that reduces the DMDH problem to an easy example of the MP problem. Then, we propose an efficient algorithm for the Key Recover Attack （KRA） on the schemes of the public key cryptosystem. In practice, we are able to entirely break the cryptosystem＇s claimed parameter of 96 security levels in less than 17.252 s. Furthermore, we show that finding parameters that yield a secure and practical scheme is impossible.

Cryptanalysis on a finite automaton public key cryptosystem

An attack algorithm is proposed on a finite automaton public key cryptosystem.It is proved that this attack can break FAPKCO in polynomial time.The basic idea can be used in principle to attack other FAPKCs.Therefore,while designing an FAPKC,it must be taken into account whether it is secure or not under this kind of attack.