The most active subjects in the security related communities are the necessary protection against the data thieves. This gives an importance and the value of exchanged data over the Internet or other media types. In many RSA cryptosystems, we usually select a small value for the public key e. This kind of choice can only speed up the encryption operation but do not forget that by this way, the ...

NTRUEncrypt is unusual among public-key cryptosystems in that, with standard parameters, validly generated ciphertexts can fail to decrypt. This affects the provable security properties of a cryptosystem, as it limits the ability to build a simulator in the random oracle model without knowledge of the private key. We demonstrate attacks which use decryption failures to recover the private key. ...

Hummingbird is a novel ultralightweight Cryptographic Algorithm aiming at resource-constrained devices. It has a hybrid structure of block cipher and stream cipher and was developed with both lightweight software and lightweight hardware implementations for constrained devices in mind. Moreover, Hummingbird has been shown to be resistant to the most common attacks to block ciphers and stream ci...

Based on the Chinese Remainder Theorem (CRT), Quisquater and Couvreur proposed an RSA variant, RSA-CRT, to speedup RSA decryption. According to RSA-CRT, Wiener suggested another RSA variant, Rebalanced RSA-CRT, to further speedup RSA-CRT decryption by shifting decryption cost to encryption cost. However, such an approach will make RSA encryption very time-consuming because the public exponent e...

Purpose: Encryption algorithm allows users to extend the assurance found in physical world electronic carrying out of our day-to-day activities. This research attempts make a comparative evaluation two encryption algorithms (Advanced Standard (AES) and Rivest Shamir Algorithm (RSA) order ascertain most reliable terms their time, decryption Key length, cipher length.
 Methodology: Java prog...

We present a protocol for two parties to generate an RSA key in a distributed manner. At the end of the protocol the public key: a modulus N = PQ, and an encryption exponent e are known to both parties. Individually, neither party obtains information about the decryption key d and the prime factors of N : P and Q. However, d is shared among the parties so that threshold decryption is possible.

Root finding is the most time-consuming stage of McEliece cryptosystem decryption. The best method to find the zeroes of a polynomial for cryptographic parameters is the Berlekamp Trace Algorithm (BTA). Our idea is to mix BTA with ad-hoc methods proposed by Zinoviev. We obtain a significant gain in terms of time complexity for finding roots and so we decrease McEliece decryption time. This pape...

With rapid growth in communication and computer technologies, there is a huge datatransaction in mobile, internet, TV, teleconferencing, telemedicine and military applications. Data security is important.Encryption is one of way to give security for data,in this regard this paper proposed a scanpattern technique for image encryption.It involves rearranging of mapping image based on scanpattern....

The design of new elliptic curve cryptosystem is still an interest to community of cryptographers. In this article, we propose a new secure and efficient elliptic curve cryptosystem. The scheme requires a single public and private keys and needs 59 and 30 for encryption and decryption algorithm respectively. The communication costs is given by 2| |. The estimated computational speed for the enc...

We propose the encryption and decryption algorithm to produce authenticator. In local execute grid node, we use this authenticator to build user information data base and do authentication application. In supervisor grid node, we use the authenticator to build remote user information data base and do authentication application. When these algorithms install in all grid nodes, we can run authent...