Akleylek et al. [S. Akleylek, L. Emmungil and U. Nuriyev, Algorithm for peer-to-peer security, journal of Appl. Comput. Math., Vol. 6(2), pp.258-264, 2007.], introduced a modified algorithm with steganographic approach for security in peer-to-peer (P2P) network. In this cryptosystem, Akleylek et al. attempt to increase the security of P2P network by connecting the ElGamal cryptosystem with knap...

We propose a novel probabilistic public-key encryption, based on the RSA cryptosystem. We prove that in contrast to the (standardmodel) RSA cryptosystem each user can choose his own encryption exponent from a more extensive set of positive integers than it can be done by the creator of the concrete RSA cryptosystem who chooses and distributes encryption keys among all users. Moreover, we show t...

Biometric systems are vulnerable to certain type of attacks at various points in the biometric model. A spoofing attack which is submitting a stolen, copied biometric trait to the sensor to gain unauthorized access to the biometric system is one among them. Multimodal biometric systems are designed to increase the accuracy of the biometric system, but they are more vulnerable to spoofing attack...

In the generalized group-oriented cryptosystem, the sender can send a conditional message to a group of users such that only the specified sets of users in this group can cooperate to decrypt this message. In this paper, we will use an ElGamal cryptosystem and an elliptic curve ElGamal cryptosystem to achieve the purposes of generalization and group-orientation, respectively. Both of our scheme...

In this paper, it is proved that Lin et al.'s scheme that tried to strengthen the Hill cipher against the known-plaintext attack has several security flaws and is vulnerable to the chosenciphertext attack. This paper also introduces a secure and efficient symmetric cryptosystem based on affine transformation. The proposed cryptosystem includes an encryption algorithm that is an improved variant...

We propose a lattice-based cryptosystem by modifying the Regev’05 cryptosystem (STOC 2005), and design a proof of secret-key knowledge. Lattice-based public-key identification schemes have already been proposed, however, it is unknown that their public keys can be used for the public keys of encryption schemes. Our modification admits the proof of knowledge on its secret key, however, we need a...

The aim of this study was to reveal biometric peculiarities of New Zealand white rabbit antebrachium (radius and ulna) by means of three-dimensional (3D) reconstruction of multidetector computed tomography (MDCT) images. Under general anesthesia, the antebrachiums of a total of sixteen rabbits of both sexes were scanned with a general diagnostic MDCT. Biometric measurements of the reconstructed...

Securing the data stored on E-passport is a very important issue. RSA encryption algorithm is suitable for such application with low data size. In this paper the design and implementation of 1024 bit-key RSA encryption and decryption module on an FPGA is presented. The module is verified through comparing the result with that obtained from MATLAB tools. The design runs at a frequency of 36.3 MH...

In general, the identification and verification are done by passwords, PIN number, etc., which can be easily cracked by hackers. Biometrics is a powerful and unique tool based on the anatomical and behavioural characteristics of the human beings in order to prove their authentication. Security is the most important thing in the world. Password is used for security, but it does not provide the e...

In ISC 2002, J. Zheng [8] proposed a new public key cryptosystem whose security is based upon the algebraic problem of reducing a high degree matrix to its canonical form by similarity transformations. In this paper, we show that factoring a polynomial over a finite field can be used to break down Zheng’s public key cryptosystem. The complexity of our attack is polynomial time. In other word, t...