Block cipher in NTRU
Journal Title: International Journal of Research in Computer and Communication Technology - Year 2016, Vol 5, Issue 1
Abstract
In every sector today, secure and efficient data transfer is essential. To guarantee the security, for the most part Public Key Cryptographic Systems (PKCS) is utilized. A RSA and NTRU framework by and large fits in with the class of PKCS. The productivity of an open key cryptographic framework is essentially measured in computational overheads, key size and transmission capacity. The way that most chips on keen cards can't handle keys broadening 1024 piece demonstrates that there is a requirement for option. NTRU [7] is such an option and it is a gathering of numerical calculations in view of controlling arrangement of whole numbers and polynomials. This permits NTRU to be effective. NTRU is the main secure open key cryptosystem not in view of factorization or discrete logarithm issues. This means that given sufficient computational resources and time, an adversary, should not be able to break the key. Basically NTRU cryptosystem encrypt and decrypt a binary message. As mentioned in NTRU[8], it takes p= 3 and q =31 to have a binary message encrypt and decrypt properly. As modulus 3 contains any of the integers 0, 1 or 2, it is not certain to decrypt a binary message properly. So NTRU came with an alternative by taking p = 2+X. In this paper we have attempted to show that it can be extended to hexadecimal system and the speed of sending and receiving can be much faster by using hexadecimal system instead of binary system.
Authors and Affiliations
Rakesh Nayak
Real Time Vehicle Tracking System Using GPS and GPRS
In this paper web based GPS-GPRS vehicle tracking system was designed and implemented. The current position of the vehicle was acquired by GPS device which is integrated to the target vehicle and the location coordin...
Design and Verification of Area Efficient High-Speed Carry Select Adder
Design of area efficient and high-speed data path logic systems forms the largest areas of research in VLSI system design. In digital adders, the speed of addition is limited by the time required to transmit a carry...
A novel Cut Detection Technique in WSN
If some of the nodes fails in wireless sensor network it can get separated into multiple connected components which is called as “cut”. This paper concentrates on the problem of detecting cuts by the help remaining n...
Evaluate the Vulnerabilities of Existing Protocols to Routing Layer Resource Depletion Attacks
We describe a Resource Depletion attack as the work of art and transmission of a message that causes more energy to be consumed by the network than if an honest node transmitted a message of identical size to the sam...
Episodic Reinforcement- Clustering technique (ERCT) based POPTVR and Modified POPTVRFNN for pattern classification
In general, a Fuzzy Neural Network (FNN) is characterized by its learning algorithm and its linguistic knowledge representation. However, it does not necessarily interact with its environment when the training data i...