Inspired by fast correlation attacks on stream ciphers, we present a stream cipher-like construction for a public-key cryptosystem whose security relies on two problems: finding a low-weight multiple of a given polynomial and a Hidden Correlation problem. We obtain a weakly secure public-key cryptosystem we call TCHo (as for Trapdoor Cipher, Hardware Oriented). Using the Fujisaki-Okamoto constr...

Received Oct 5 th , 2012 Accepted Oct 30 th , 2012 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...

We report a break for a recently proposed class of cryptosystems. The cryptosystem uses constant points of a periodic secret orbit to encrypt the plaintext. In order to break the system, it suffices to sort the constant points and find the initial fixed point. We also report breaks for the modified versions of the cryptosystem. Besides, we discuss some efficiency issues of the the cryptosystem.

At the 1990 EuroCrypt Conference, Niemi proposed a new public-key cryptosystem based on modular knapsacks. Y.M. Chee in Singapore, A. Joux and J. Stern in Paris independently found that this cryptosystem is insecure. Our two cryptanalytic methods are slightly different, but they are both based on the LLL algorithm. This is one more example of a cryptosystem that can be broken using this powerfu...

We show a new cryptosystem based on non-commutativ calculations of matrices, more specially nilpotent matrices. The cryptosystem seems powerful to restsist against usual attacks.

Biometric systems were proposed and developed to provide a better and stronger factor of authentication. Such systems authenticate individuals based on physical and behavioral traits such as fingerprints, iris, face, palm print, hand geometry, voice, etc. The use of biometric traits to replace existing passwords or as access keys has proven to be highly secure against physical attacks. It is a ...

A crypto-Biometric based system has been more convenient compared to password based systems, which enhances the security and also being user friendly, due to its maturity and reliability. Fingerprint has been studied along with biocrypt to meet the cryptographic requirement. In this paper we explore realization of fuzzy vaults with fingerprint minutiae data. Helping in hiding encryption key wit...

Biometric recognition refers to the process of matching an input biometric to stored biometric information. In particular, biometric verification refers to matching the live biometric input from an individual to the stored biometric template about that individual. Examples of biometrics include face images, fingerprint images, iris images, retinal scans, etc. Thus, image processing techniques p...

Biometric techniques are gaining importance for personal authentication and identification as compared to the traditional authentication methods. Biometric templates are vulnerable to variety of attacks due to their inherent nature. When a person’s biometric is compromised his identity is lost. In contrast to password, biometric is not revocable. Therefore, providing security to the stored biom...

McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key. We show that it is possible to use some properties of the automorphism groups of the codes to ...