Publications (167)66.16 Total impact

Designs Codes and Cryptography 01/2014; DOI:10.1007/s1062301400030 · 0.73 Impact Factor

[Show abstract] [Hide abstract]
ABSTRACT: RC4 has been the most popular stream cipher in the history of symmetric key cryptography. Its internal state contains a permutation over all possible bytes from 0 to 255, and it attempts to generate a pseudorandom sequence of bytes (called keystream) by extracting elements of this permutation. Over the last twenty years, numerous cryptanalytic results on RC4 stream cipher have been published, many of which are based on nonrandom (biased) events involving the secret key, the state variables, and the keystream of the cipher. Though biases based on the secret key are common in RC4 literature, none of the existing ones depends on the length of the secret key. In the first part of this paper, we investigate the effect of RC4 keylength on its keystream, and report significant biases involving the length of the secret key. In the process, we prove the two known empirical biases that were experimentally reported and used in recent attacks against WEP and WPA by Sepehrdad, Vaudenay and Vuagnoux in EUROCRYPT 2011. After our current work, there remains no bias in the literature of WEP and WPA attacks without a proof. In the second part of the paper, we present theoretical proofs of some significant initialround empirical biases observed by Sepehrdad, Vaudenay and Vuagnoux in SAC 2010. In the third part, we present the derivation of the complete probability distribution of the first byte of RC4 keystream, a problem left open for a decade since the observation by Mironov in CRYPTO 2002. Further, the existence of positive biases towards zero for all the initial bytes 3 to 255 is proved and exploited towards a generalized broadcast attack on RC4. We also investigate for longterm nonrandomness in the keystream, and prove a new longterm bias of RC4.Journal of Cryptology 01/2014; 1(1). DOI:10.1007/s0014501291381 · 0.77 Impact Factor 
Article: Differential Fault Attack against Grain family with very few faults and minimal assumptions
IEEE Transactions on Computers 01/2014; DOI:10.1109/TC.2014.2339854 · 1.47 Impact Factor 
[Show abstract] [Hide abstract]
ABSTRACT: Most of the existing conditional accessbased systems (CAS) follow a standard methodology. The service provider shares two copies for single information (specifically image for this work). One copy is a lowresolution version which is shared in the public domain for preview purpose. The other one is a highresolution version to be provided to the customers through a secure channel on demand (after payment). We propose a novel scheme that can be efficiently adapted in such a scenario. We analyze the images in the discrete cosine transform (DCT) domain and note that polynomials of suitable degree, representing the sorted DCT coefficients together with original index locations, can uniquely represent an image. We show that the arrangement of DCT index locations, after the actual coefficients have been sorted by magnitude, is significantly different for various images and we exploit this to design an efficient CASbased scheme. We also show that the amount of private data, which a service provider needs to transmit through a secure channel to the customers on demand, is reduced significantly. This reduction in transmitted data makes the system apt for realtime secure applications.Journal of RealTime Image Processing 01/2014; DOI:10.1007/s115540140409y · 1.11 Impact Factor 
Conference Paper: Improved differential fault attack on MICKEY 2.0
[Show abstract] [Hide abstract]
ABSTRACT: In this paper we present a differential fault attack on the stream cipher MICKEY 2.0 which is in eStream's hardware portfolio. While fault attacks have already been reported against the other two eStream hardware candidates Trivium and Grain, no such analysis is known for MICKEY. Using the standard assumptions for fault attacks, we show that if the adversary can induce random single bit faults in the internal state of the cipher, then by injecting around 216.7 faults and performing 232.5 computations on an average, it is possible to recover the entire internal state of MICKEY at the beginning of the keystream generation phase. We further consider the scenario where the fault may affect at most three neighbouring bits and in that case we require around 218.4 faults on an average.Proceedings of the 15th international conference on Cryptographic Hardware and Embedded Systems; 08/2013 
[Show abstract] [Hide abstract]
ABSTRACT: Let a Boolean function be available as a blackbox (oracle) and one likes to devise an algorithm to test whether it has certain property or it is $\epsilon$far from having that property. The efficiency of the algorithm is judged by the number of calls to the oracle so that one can decide, with high probability, between these two alternatives. The best known quantum algorithm for testing whether a function is linear or $\epsilon$far $(0 < \epsilon < \frac{1}{2})$ from linear functions requires $O(\epsilon^{\frac{2}{3}})$ many calls [Hillery and Andersson, Physical Review A 84, 062329 (2011)]. We show that this can be improved to $O(\epsilon^{\frac{1}{2}})$ by using the DeutschJozsa and the Grover Algorithms. 
[Show abstract] [Hide abstract]
ABSTRACT: RC4 is the most popular stream cipher in the domain of cryptology. In this paper, we present a systematic study of the hardware implementation of RC4, and propose the fastest known architecture for the cipher. We combine the ideas of hardware pipeline and loop unrolling to design an architecture that produces 2 RC4 keystream bytes per clock cycle. We have optimized and implemented our proposed design using VHDL description, synthesized with 130, 90, and 65 nm fabrication technologies at clock frequencies 625 MHz, 1.37 GHz, and 1.92 GHz, respectively, to obtain a final RC4 keystream throughput of 10, 21.92, and 30.72 Gbps in the respective technologies.IEEE Transactions on Computers 04/2013; 62(4):730743. DOI:10.1109/TC.2012.19 · 1.47 Impact Factor 
[Show abstract] [Hide abstract]
ABSTRACT: Ultralow power dissipation for nanoscale circuits and future technologies such as quantum computing require reversible logic. Existing methods of reversible logic synthesis attempt to minimize gate count, quantum cost, garbage count and try to achieve scalability for large Boolean functions. Several notable heuristics for reversible logic synthesis employ a method based on repeated transformation, demonstrating excellent performance compared to available optimal results. In this paper, we suggest two novel techniques to the transformationbased synthesis flow for improving synthesis outcome. The first technique is based on properties of Boolean functions and the second technique incorporates generalized Fredkin gates during synthesis flow. We present theoretical results and experimental evidence in support of our strategies.Proceedings of The International Symposium on MultipleValued Logic 01/2013; DOI:10.1109/ISMVL.2013.14 
[Show abstract] [Hide abstract]
ABSTRACT: In this paper we study weaknesses of two variants of RSA: Dual RSA and Common Prime RSA. Several schemes under the framework of Dual RSA have been proposed by Sun et al. (IEEE Trans Inf Theory 53(8):2922–2933, 2007). We here concentrate on the Dual CRTRSA scheme and present certain range of parameters where it is insecure. As a corollary of our work, we prove that the Dual Generalized RebalancedRSA (Scheme III of Sun et al.) can be efficiently broken for a significant region where the scheme has been claimed to be secure. Next we consider the Common Prime RSA as proposed by Wiener (IEEE Trans. Inf. Theory 36:553–558, 1990). We present new range of parameters in Common Prime RSA where it is not secure. We use lattice based techniques for the attacks.Designs Codes and Cryptography 01/2013; 66(13). DOI:10.1007/s1062301296755 · 0.73 Impact Factor 

[Show abstract] [Hide abstract]
ABSTRACT: A Heron triangle is a triangle whose sides are area are all integers. In the paper under review, the authors fix two positive integers a and b, and give upper bounds for the function H(a,b) which counts the number of Heron triangles with two fixed sides a and b. They obtain that if the factorization of ab is ab=2 α 0 ∏ i=1 s p i a i ∏ j=1 r q j e j , where p i ≡3(mod4) and q j ≡1(mod4) are primes, then H(a,b)≤3+(1) ab 2∏ j=1 r (2e j +1)1· In particular, H(ab)=0 if all prime factors of ab are congruent to 3 modulo 4, and H(p,q)≤8 if p and q are primes. They prove a better estimate for H(p,q) according to the residue classes of p and q modulo 4. They also show that H(p,q)=0 for special pairs of primes, such as when p=2q+1 (Sophie Germain primes) or when p and q are both Mersenne primes. They also prove some other results concerning Heron triangles such as that there are no isosceles Heron triangles with square sides and give a lower bound for the number of Heron triangles with a fixed integer height h.01/2013; 
Conference Paper: A differential fault attack on grain128a using MACs
[Show abstract] [Hide abstract]
ABSTRACT: The 32bit MAC of Grain128a is a linear combination of the first 64 and then the alternative keystream bits. In this paper we describe a successful differential fault attack on Grain128a, in which we recover the Secret Key by observing the correct and faulty MACs of certain chosen messages. The attack works due to certain properties of the Boolean functions and corresponding choices of the taps from the LFSR. We present methods to identify the fault locations and then construct a set of linear equations to obtain the contents of the LFSR and the NFSR. Our attack requires less than 211 fault injections and invocations of less than 212 MAC generation routines.Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering; 11/2012 
Conference Paper: Some results on related KeyIV pairs of grain
[Show abstract] [Hide abstract]
ABSTRACT: In this paper we explain how one can obtain KeyIV pairs for Grain family of stream ciphers that can generate output keystreams which are either (i) almost similar in the initial part or (ii) exact shifts of each other throughout the generation of the stream. Let lP be the size of the pad used during the key loading of Grain. For the first case, we show that in expected $2^{l_P}$ many invocations of the Key Scheduling Algorithm and its reverse routine, one can obtain two related KeyIV pairs that can produce same output bits in 75 (respectively 112 and 115) selected positions among the initial 96 (respectively 160 and 160) bits for Grain v1 (respectively Grain128 and Grain128a). Similar idea works for the second case in showing that given any KeyIV, one can obtain another related KeyIV in expected $2^{l_P}$ many trials such that the related KeyIV pairs produce shifted keystreams. We also provide an efficient strategy to obtain related KeyIV pairs that produce exactly ibit shifted keystreams for small i. Our technique precomputes certain equations that help in obtaining such related KeyIV pairs in 2i many expected trials.Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering; 11/2012 
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we study efficient algorithms towards the construction of any arbitrary Dicke state. Our contribution is to use proper symmetric Boolean functions that involve manipulations with Krawtchouk polynomials. DeutschJozsa algorithm, Grover algorithm and the parity measurement technique are stitched together to devise the complete algorithm. Further, motivated by the work of Childs et al (2002), we explore how one can plug the biased Hadamard transformation in our strategy. Our work compares fairly with the results of Childs et al (2002).Quantum Information Processing 09/2012; 13(9). DOI:10.1007/s1112801407978 · 2.96 Impact Factor 
Conference Paper: Side channel attack to actual cryptanalysis: breaking CRTRSA with low weight decryption exponents
[Show abstract] [Hide abstract]
ABSTRACT: Towards the cold boot attack (a kind of side channel attack), the problems of reconstructing RSA parameters when (i) certain bits are unknown (Heninger and Shacham, Crypto 2009) and (ii) the bits are available but with some error probability (Henecka, May and Meurer, Crypto 2010) have been considered very recently. In this paper we exploit the error correction heuristic proposed by Henecka et al to show that CRTRSA schemes having low Hamming weight decryption exponents are insecure given small encryption exponents (e.g., e=216+1). In particular, we show that the CRTRSA schemes presented by Lim and Lee (SAC 1996) and Galbraith, Heneghan and McKee (ACISP 2005) with low weight decryption exponents can be broken in a few minutes in certain cases. Further, the scheme of Maitra and Sarkar (CTRSA 2010), where the decryption exponents are not of low weight but they have large low weight factors, can also be cryptanalysed. We also identify a few modifications of the error correction strategy that provides significantly improved experimental outcome towards the cold boot attack.Proceedings of the 14th international conference on Cryptographic Hardware and Embedded Systems; 09/2012 
[Show abstract] [Hide abstract]
ABSTRACT: Parker considered a new type of discrete Fourier transform, called negaHadamard transform. We prove several results regarding its behavior on combinations of Boolean functions and use this theory to derive several results on negabentness (that is, flat negaspectrum) of concatenations, and partially symmetric functions. We derive the upper bound $\lceil {{ n}\over { 2}} \rceil $ for the algebraic degree of a negabent function on $n$ variables. Further, a characterization of bent–negabent functions is obtained within a subclass of the Maiorana–McFarland set. We develop a technique to construct bent–negabent Boolean functions by using complete mapping polynomials. Using this technique, we demonstrate that for each $\ell \geq 2$, there exist bent–negabent functions on $n = 12\ell $ variables with algebraic degree $ {{ n}\over { 4}}+1 = 3\ell + 1$. It is also demonstrated that there exist bent–negabent functions on eight variables with algebraic degrees 2, 3, and 4. Simple proofs of several previously known facts are obtained as immediate consequences of our work.IEEE Transactions on Information Theory 06/2012; 58(6):40644072. DOI:10.1109/TIT.2012.2186785 · 2.65 Impact Factor 
Article: On Deterministic Polynomialtime Equivalence of Computing the CRTRSA Secret Keys and Factoring
Defence science journal 03/2012; 62(2):122126. DOI:10.14429/dsj.62.1716 · 0.31 Impact Factor 
Conference Paper: Designing highthroughput hardware accelerator for stream cipher HC128
[Show abstract] [Hide abstract]
ABSTRACT: Due to ubiquitous deployment of embedded systems, security and privacy are emerging as major design concerns and new stream ciphers are being proposed by the cryptographic community. HC128 is one of the recent stream ciphers that received attention after its selection as an eStream candidate. Till date, the cipher is believed to have a good security margin. In this paper we study several implementation issues for HC128 in a disciplined manner. We first discuss the experience on embedded and customizable processors. Then we consider a dedicated hardware accelerator implementation. Further we explore several parallelization strategies for improving throughput. To the best of our knowledge such a detailed implementation exercise has not been presented in the literature. Our novel implementation strategies mark the fastest HC128 execution reported till date.Circuits and Systems (ISCAS), 2012 IEEE International Symposium on; 01/2012 
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we investigate some algebraic and combinatorial properties of a special Boolean function on n variables, defined using weighted sums in the residue ring modulo the least prime p≥n. We also give further evidence relating to a question raised by Shparlinski regarding this function, by computing accurately the Boolean sensitivity, thus settling the question for prime number values p=n. Finally, we propose a generalization of these functions, which we call laced functions, and compute the weight of one such, for every value of n.Discrete Applied Mathematics 07/2011; 159:10591069. DOI:10.1016/j.dam.2011.03.022 · 0.68 Impact Factor 
[Show abstract] [Hide abstract]
ABSTRACT: In this paper, we analyze how to calculate the GCD of k ( ≥ 2) many large integers, given their approximations. This problem is known as the approximate integer common divisor problem in literature. Two versions of the problem, presented by HowgraveGraham in CaLC 2001, turn out to be special cases of our analysis when k = 2. We relate the approximate common divisor problem to the implicit factorization problem as well. The later was introduced by May and Ritzenhofen in PKC 2009 and studied under the assumption that some of Least Significant Bits (LSBs) of certain primes are the same. Our strategy can be applied to the implicit factorization problem in a general framework considering the equality of (i) most significant bits (MSBs), (ii) least significant bits (LSBs), and (iii) MSBs and LSBs together. We present new and improved theoretical as well as experimental results in comparison with the state of the art work in this area.IEEE Transactions on Information Theory 07/2011; DOI:10.1109/TIT.2011.2137270 · 2.65 Impact Factor
Publication Stats
2k  Citations  
66.16  Total Impact Points  
Top Journals
Institutions

1999–2013

Indian Statistical Institute
 Applied Statistics Unit (ASU)
Baranagore, West Bengal, India


2007

University of Ottawa
Ottawa, Ontario, Canada


2002

Lund University
 Department of Electrical and Information Technology
Lund, Skåne, Sweden 
Indian Institute of Management Calcutta
Kolkata, West Bengal, India
