Large Key Size Research Articles

On Constrained Implementation of Lattice-Based Cryptographic Primitives and Schemes on Smart Cards

Most lattice-based cryptographic schemes with a security proof suffer from large key sizes and heavy computations. This is also true for the simpler case of authentication protocols that are used on smart cards as a very-constrained computing environment. Recent progress on ideal lattices has significantly improved the efficiency and made it possible to implement practical lattice-based cryptography on constrained devices. However, to the best of our knowledge, no previous attempts have been made to implement lattice-based schemes on smart cards. In this article, we provide the results of our implementation of several state-of-the-art lattice-based authentication protocols on smart cards and a microcontroller widely used in smart cards. Our results show that only a few of the proposed lattice-based authentication protocols can be implemented using limited resources of such constrained devices; however, cutting-edge ones are suitably efficient to be used practically on smart cards. Moreover, we have implemented fast Fourier transform (FFT) and discrete Gaussian sampling with different typical parameter sets, as well as versatile lattice-based public-key encryptions. These results have noticeable points that help to design or optimize lattice-based schemes for constrained devices.

Efficient techniques of key management and quantum cryptography in RFID networks

An efficient way of handling security keys using quantum cryptography QC for increasing security in radio frequency identification RFID networks is being investigated by network security industries. To establish secure RFID network, communication between any two nodes that hold RFID tags and/or readers merged with existing networks should be protected. In order to maximize the data security and secure transmission around RFID network, theoretical model of the quantum key management KM system based on RFID is introduced as a proposed research. This model not only manages the secure keys but also it defends passive eavesdropping attacks and other potential attacks. Novelties in this research are security keys of which QC is being utilized in RFID network with continuous key updates. To establish future security around RFID networks, efficient KM protocol and QC, which deal with quantum mathematical procedures and quantum physics, should be analyzed without affecting the legacy. Computational complexities in KM are increasing with the large key sizes, which are manageable through QC. To maximize the security and minimize the complexity in KM, QC with Grover's algorithm is introduced as a method in RFID network environments. So, we have proved that a number of operations with key sizes obtained in KM are reduced. In this proposal, QC will help to reduce the complexity of algorithms used in KM protocols and maximize the security. Copyright © 2014 John Wiley & Sons, Ltd.

AAB Public-Key Cryptosystem - A Practical Implementation of the New Asymmetric

This paper aims to provide a practical implementation one of a probabilistic cipher proposed by M.R.K. Ariffin, M.A. Asbullah and N.A. Abu called as AAβ. We provide details on designing and implementing the AAβ algorithm. Furthermore, to support our understanding by providing a statistical analysis of times taken to implement the key generation, encryption and decryption algorithm for the key sizes 3072, 6144, 9216 and 12288 bits for message spaces of 4n where n = 512, 1024, 1536 and 2048 bits. We show the working of the AAβ algorithm purely from a practical standpoint to justify if it is practically implementable even for large data sets operating on large key sizes.

Analysis for Memory Reduction of the UOV Scheme with the Application of PRNG

 Abstract—In case we use a quantum computer, we have to construct the countermeasure. Due to the high efficiency and fast computation time, the multivariate quadratic public key systems are considered as an alternative to RSA or ECC based systems. However, the large key size is a fatal disadvantage of the multivariate quadratic public key systems. For this reason, the multivariate quadratic public key systems are not widely used. In this paper, we measure how much the private key memory size can be reduced by using a secure pseudo-random number generator in the UOV scheme. Almost 93% of the private key memory size is reduced.

Implementation of Variable Tone Variable Bits Gray-Scale Image Stegnography Using Discrete Cosine Transform

Secure exchange of information is the basic need of modern digital world of e-communication which is achieved either by encrypting information or by hiding information in other information called cover media. Concealing information requires a well designed technique of Stegnography. This work presents a technique, variable tone variable bits (VTVB) Stegnography, to hide information in a cover image. The VTVB Stegnography hides variable data in discrete cosine transform (DCT) coefficients of the cover image. VTVB Stegnography provides variable data hiding capacity and variable distortion. Additional large data hiding this technique provide extra security due to the large key size making VTVB Stegnography technique much more immune to steganalysis. The hiding makes the existence of information imperceptible for steganalysis and the key of keeping a secret makes the recovering of information difficult for an intruder. The key size is depending on cover image and numbers of bits of discrete cosine transform (DCT) coefficients used for information embedding. This is a very flexible technique and can be used for low payload applications, e.g. watermarking to high payload applications, e.g. network Stegnography.

Performance Analysis of Parallel Implementation of Advanced Encryption Standard (AES) Over Serial Implementation

Cryptography is the study of mathematical techniques related to aspects of information security such as confidentiality, data integrity, entity authentication, and data origin authentication. Most cryptographic algorithms function more efficiently when implemented in hardware than in software running on single processor. However, systems that use hardware implementations have significant drawbacks: they are unable to respond to flaws discovered in the implemented algorithm or to changes in standards. As an alternative, it is possible to implement cryptographic algorithms in software running on multiple processors. However, most of the cryptographic algorithms like DES (Data Encryption Standard) or 3DES have some drawbacks when implemented in software: DES is no longer secure as computers get more powerful while 3DES is relatively sluggish in software. AES (Advanced Encryption Standard), which is rapidly being adopted worldwide, provides a better combination of performance and enhanced network security than DES or 3DES by being computationally more efficient than these earlier standards. Furthermore, by supporting large key sizes of 128, 192, and 256 bits, AES offers higher security against brute-force attacks. In this paper, AES has been implemented with single processor. Then the result has been compared with parallel implementations of AES with 2 varying different parameters such as key size, number of rounds and extended key size, and show how parallel implementation of the AES offers better performance yet flexible enough for cryptographic algorithms.

Light Weight Encryption Technique for Group Communication in Cloud Computing Environment

Cloud computing is a typical example of distributed computing and emerged as a new paradigm that moves computing and data away from desktop and portable PCs into large data centers. Cloud services have three broad categories based on the fundamental nature of the cloud-based solution they provide: infrastructure-as-a-service (IaaS), platform-as-aservice (PaaS), or software-as-aservice (SaaS). In this work we have focused on the SaaS services provided by the Cloud service providers (CSP). The issue with SaaS is data security and confidentiality that makes the cloud user reluctant towards the cloud services. Data confidentiality can be achieved by encrypted outsourced content before outsourcing to cloud servers. But due to excessive computation of existing cryptographic algorithms and distributed nature of cloud computing, there is a need of a light weight cryptographic technique that has less computational overhead and high throughput. In this paper a light weight encryption technique is proposed which has less computational time and overall good performance. In order to prove it, the proposed algorithm is compared with the existing encryption techniques and results are analyzed. The key distribution of the shared key and secret key between the two group members is also handled efficiently using the same algorithm. Enormous overhead due to the large key size has been effectively ruled out in this paper. Light weight nature of proposed algorithm is well suited for distributed nature of cloud servers for an efficient processing with greatly enhanced user‘s confidence in cloud computing.

A Review on Elliptic Curve Cryptography for Embedded Systems

Importance of Elliptic Curves in Cryptography was independently proposed by Neal Koblitz and Victor Miller in 1985.Since then, Elliptic curve cryptography or ECC has evolved as a vast field for public key cryptography (PKC) systems. In PKC system, we use separate keys to encode and decode the data. Since one of the keys is distributed publicly in PKC systems, the strength of security depends on large key size. The mathematical problems of prime factorization and discrete logarithm are previously used in PKC systems. ECC has proved to provide same level of security with relatively small key sizes. The research in the field of ECC is mostly focused on its implementation on application specific systems. Such systems have restricted resources like storage, processing speed and domain specific CPU architecture.

Parallel Key Encryption for CBC And Interleaved CBC

In current day scenario, the need to protect information has become very important and hence the need for cryptographic algorithms is high. Here, we extend the parallel key encryption algorithm and bring out its full potential by implementing the various cryptographic modes such as cipher block chaining and interleaved cipher block chaining where commendable increase in efficiency and reduction in encryption and decryption time can be seen. We have also considerably increased the key size by using 1024 bit and 2048 bit keys for the algorithmic implementation and in CBC and interleaved CBC execution. Our practical analysis has brought to front the salient features of the parallel key encryption algorithm and its ability to provide enhanced data protection when using a larger key size along with its randomness property. In theoretical analysis, it can be shown that remarkable reduction in encryption and decryption time of cryptographic systems is achieved and an enhanced strength to the system against brute force attacks is achieved. Furthermore, PCA can be extended for different cryptographic modes, using varying key size and number of keys used in the process.

A Cryptosystem Using the Concepts of Algebraic Geometric Code

Problem statement: Cryptosystem using linear codes was developed in 1 978 by Mc-Eliece. Later in 1985 Niederreiter and others developed a m odified version of cryptosystem using concepts of linear codes. But these systems were not used frequ ently because of its larger key size. In this study we were designing a cryptosystem using the concepts of algebraic geometric codes with smaller key size. Error detection and correction can be done efficien tly by simple decoding methods using the cryptosystem developed. Approach: Algebraic geometric codes are codes, generated usi ng curves. The cryptosystem use basic concepts of elliptic cur ves cryptography and generator matrix. Decrypted information takes the form of a repetition code. Du e to this complexity of decoding procedure is reduced. Error detection and correction can be carr ied out efficiently by solving a simple system of linear equations, there by imposing the concepts of security along with error detection and correction . Results: Implementation of the algorithm is done on MATLAB and comparative analysis is also done on various parameters of the system. Attacks are co mmon to all cryptosystems. But by securely choosing curve, field and representation of element s in field, we can overcome the attacks and a stabl e system can be generated. Conclusion: The algorithm defined here protects the informatio n from an intruder and also from the error in communication c hannel by efficient error correction methods.

A Novel Multiple Key Block Ciphering Mechanism with Reduced Computational Overhead

Cryptanalysis of symmetric key cryptography encourages large key size and complex operations to achieve message confidentiality. All these techniques pose computational overhead at both the sender & receiver ends. In this paper, we propose a simple yet powerful Block Cipher Multiple Key Symmetric Encryption (BCMKSE) algorithm for achieving both confidentiality & integrity with reduced computational and message overheads. Our algorithm changes the key after encrypting/decrypting a piece of the whole message. While the key changes during the whole message encryption/decryption process without increasing network traffic or message overhead. This methodology becomes faster as it uses the simplest operations like shift, XOR, addition and comparison operations.

Robust iris verification for key management

In this paper, we present a method for secret key generation and recovery based on iris verification that, unlike typical systems which store iris templates persistently, stores recovery information on a smart card carried by the user. The scheme uses error-correcting codes to overcome the noisiness inherent in biometric readings. Our iris template incorporates reliable region selection, reliable bit estimation and one-sided masking techniques that provide for both robust verification and large key sizes. An implementation and experiments with the University of Bath iris dataset indicate that our scheme provides for generation and recovery of 260-bit keys with an EER of 0%.

Key-Lock Mechanisms for Object Protection in Single-Address-Space Systems

This paper focuses on memory addressing environments that support the notion of a single address space. We consider the problem of hampering access attempts to the private objects of a given thread, when these attempts are generated by unauthorized threads of different processes. We introduce two different forms of access privilege representation - handles and gates - which are designed to coexist within the boundaries of the same protection system. The handle concept is a generalization of the classical protected pointer concept. A handle associates several keys (passwords) with an object name. Each key grants a specific access right to the named object. A gate is a compact representation of access privileges, which uses a single bit to encode an access right. Handles are protected from forgery by key sparseness. They can be freely mixed in memory with ordinary data. On the other hand, gates are sensitive data that must be kept segregated in private memory regions of the protection system. The dualism of handles and gates makes it possible to take advantage of the simplicity of access right distribution and object sharing between threads, which is characteristic of key-based protection systems, and to avoid the negative impact on overall system performance, which results from the large key size and the high costs of lengthy processing that are connected with key validation.

Large Key Sizes and the Security of Password-Based Cryptography

We expose a potential vulnerability in the common use of password-based cryptography. When employing a user-chosen password to generate cryptographic keys which themselves are larger than the digest size of the underlying hash function, a part of the resulting key is produced deterministically and this, in turn, may lead to an exploitable weakness.

Reversible Sketches: Enabling Monitoring and Analysis Over High-Speed Data Streams

A key function for network traffic monitoring and analysis is the ability to perform aggregate queries over multiple data streams. Change detection is an important primitive which can be extended to construct many aggregate queries. The recently proposed sketches are among the very few that can detect heavy changes online for high speed links, and thus support various aggregate queries in both temporal and spatial domains. However, it does not preserve the keys (e. g., source IP address) of flows, making it difficult to reconstruct the desired set of anomalous keys. To address this challenge, we propose the reversible sketch data structure along with reverse hashing algorithms to infer the keys of culprit flows. There are two phases. The first operates online, recording the packet stream in a compact representation with negligible extra memory and few extra memory accesses. Our prototype single FPGA board implementation can achieve a throughput of over 16 Gb/s for 40-byte packet streams (the worst case). The second phase identifies heavy changes and their keys from the representation in nearly real time. We evaluate our scheme using traces from large edge routers with OC-12 or higher links. Both the analytical and experimental results show that we are able to achieve online traffic monitoring and accurate change/intrusion detection over massive data streams on high speed links, all in a manner that scales to large key space size. To the best of our knowledge, our system is the first to achieve these properties simultaneously.