Sharif Digital Repository

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... 

We construct an efficient statistical zero-knowledge authentication protocol for smart cards based on general assumptions. We show how it can be instantiated using lattice-based primitives, which are conjectured to be secure against quantum attacks. We illustrate the practicality of our protocol on smart cards in terms of storage, computation, communication, and round complexities. Furthermore, we compare it to other lattice-based authentication protocols, which are either zero-knowledge or have a similar structure. The comparison shows that our protocol improves the best previous protocol in several aspects  

Cryptography algorithms are a fundamental part of a cryptographic system that is designed and implemented to increase information security. They are the center of attention of experts in the information technology domains. Although the cryptography algorithms are implemented to attain the goals such as confidentially, integrity, and authenticity of designing, but other matters that must be noticed by designers include speed, resource consumption, reliability, flexibility, usage type, and so on. For the useful allocation of hardware, software, and human resources, it is important to identify the role of each of the factors influencing the design of cryptographic algorithms to invest in the... 

LBlock is a lightweight block cipher proposed in ACNS 2011 as a solution to the security challenge in extremely constrained environments. Because biclique cryptanalysis had not been invented when this cipher was designed, the designers themselves evaluated the security of this cipher one year later in WISA 2012, where a modified key schedule was also suggested to make this cipher resistant against biclique attack. In this paper, we analyze the full-round of LBlock with this modified key schedule by the biclique attack with data complexity of 212 and computational complexity of 278-74. In the biclique attack, a shorter biclique potentially results in less data complexity, but at the expense... 

HIGHT is a lightweight block cipher introduced in CHES 2006 by Hong et al as a block cipher suitable for low-resource applications. In this paper, we propose improved impossible differential and biclique attacks on HIGHT block cipher both exploiting the permutation-based property of the cipher's key schedule algorithm as well as its low diffusion. For impossible differential attack, we found a new 17-round impossible differential characteristic that enables us to propose a new 27-round impossible differential attack. The total time complexity of the attack is 2120.4 where an amount of 259.3 chosen plaintext-ciphertext pairs and 2107.4 memory are required. We also instantiate a new biclique... 

We present a pipelined Montgomery multiplier tailored for SIKE primes. The latency of this multiplier is far shorter than that of the previous work while its frequency competes with the highest-rated ones. The implementation results on a Virtex-7 FPGA show that this multiplier improves the time, the area-time product (AT), and the throughput of computing modular multiplication by at least 2.30, 1.60, and 1.36 times over SIKE primes respectively. We have also developed a CPU-like architecture to perform SIDH and SIKE using several instances of our modular multiplier. Using four multipliers on a Virtex-7 FPGA, the encapsulation and the decapsulation of SIKE can be performed at least 1.45 times... 

In this paper via a novel method of discretized continuous-time Kalman filter, the problem of synchronization and cryptography in fractional-order systems has been investigated in presence of noisy environment for process and output signals. The fractional-order Kalman filter equation, applicable for linear systems, and its extension called the extended Kalman filter, which can be used for nonlinear systems, are derived. The result is utilized for chaos synchronization with the aim of cryptography while the transmitter system is fractional-order, and both the transmitter and transmission channel are noisy. The fractional-order stochastic chaotic Chen system is then presented to apply the... 

In the past few years, several process-algebraic frameworks have been proposed that incorporate the notion of epistemic knowledge. These frameworks allow for reasoning about knowledge-related properties, such as anonymity, secrecy and authentication, in the operational specifications given in process-algebraic languages. Hitherto, no sound and (ground-)complete axiomatization has been given for the abovementioned process-algebraic frameworks. In this paper, we define notions of bisimulation that are suitable for such process algebras with histories and give a sound and ground-complete axiomatization for the theory of CryptoPAi, which is a process algebra based on Milner's Calculus of... 

In 1998, Mu and Varadharajan proposed an anonymous e-voting scheme to be applied in both small-scale and large-scale elections. They claimed that it protects the anonymity of voters and prevents double voting. They also mentioned that if a malicious voter votes more than once, his identity will be discovered by the election authority. In 2003, Lin et al. demonstrated that the scheme fails to resist double voting and further proposed an enhanced scheme to overcome the weakness. Their scheme has received a much of interest by Yang et al. (2004), Hwang et al. (2005), and Rodriguez-Henriquez et al. (2007). They have improved Lin et al.'s scheme to prevent their proposed weaknesses. This paper... 

In this paper, we describe an impossible differential property for 2.5 rounds of Safer++. It allows an impossible differential attack on 4 rounds of Safer++. The proposed attack requires 2 23 chosen plaintexts and 2 75 bytes of memory and performs 2 84 4-round Safer++ encryptions. The method developed to attack Safer++ can be applied to other block ciphers in Safer family. 1  

This paper presents a new approach for hiding information in speech signals. In this method, the silence intervals of speech are found and the length (number of samples) of these intervals is changed to hide information. This method can be used simultaneously with other methods. © 2008 IEEE  

Steganography is a relatively new method for establishing hidden communication which gained attraction in recent years. Steganography is a method of hiding a secret message in a cover media such as image or text. In this paper a new method is proposed for steganography in English text by substituting the words which have different terms in British English and American English. © 2008 IEEE  

It is proved that the out-of-phase autocorrelation of a well-known class of multiplexed sequences for cryptographic and spread spectrum applications is necessarily high for relatively small values of the phase shifts. Related design criteria for the multiplexer generator including the use of full positive difference sets are proposed. By generalizing the classical occupancy problem, higher order statistical weaknesses of multiplexed sequences are also established. © 2002 Elsevier Science (USA)  

We present a pipelined Montgomery multiplier tailored for SIKE primes. The latency of this multiplier is far shorter than that of the previous work while its frequency competes with the highest-rated ones. The implementation results on a Virtex-7 FPGA show that this multiplier improves the time, the area-time product (AT), and the throughput of computing modular multiplication by at least 2.30, 1.60, and 1.36 times over SIKE primes respectively. We have also developed a CPU-like architecture to perform SIDH and SIKE using several instances of our modular multiplier. Using four multipliers on a Virtex-7 FPGA, the encapsulation and the decapsulation of SIKE can be performed at least 1.45 times... 

Biclique attack is one of the most recent methods for cryptanalysis of block ciphers. In this paper, we present a new biclique attack on the full round of the lightweight block cipher CLEFIA-128. We obtained 2127.44 for computational complexity while the data complexity is 264 and memory complexity is 27. To the best of our knowledge, it is the first biclique attack on the full CLEFIA-128 lightweight block cipher. Also, we show that MITM attack in the way of using partial matching with precomputation and recomputation technique can reduce the data complexity of the attack to only 2 known plaintext-ciphertext pairs  

In this paper, we propose the first provable secure certificate-based proxy signature (CBPS) with message recovery without bilinear pairing. In 2003, Gentry introduced the concept of certificate-based cryptography to solve certificate management and key escrow problems in public key infrastructure and identity-based cryptosystems, respectively. Because the overall cost of pairing computation is higher than scalar multiplication (e.g., over elliptic curve group), consequently, the CBPS schemes without pairings would be more efficient. According to the available research in this regard, our scheme is the first provable secure CBPS scheme with message recovery that is based on the elliptic... 

We follow two main objectives in this article. On the one hand, we introduce a security model called LORBACPA+ for self-synchronized stream ciphers which is stronger than the blockwise LOR-IND-CPA, where we show that standard constructions as delayed CBC or similar existing self-synchronized modes of operation are not secure in this stronger model. Then, on the other hand, following contributions of Millérioux et al., we introduce a new self-synchronized stream cipher and prove its security in LORBACPA+ model. © The British Computer Society 2018. All rights reserved  

we consider the problem of keeping sensitive data and algorithms contained in a mobile agent from discovery and exploitation by a malicious host. The paper illustrates a novel distributed protocol for multi agent environments to improve the communication security in packet-switched networks. To enrich the overall system security the approach makes use of distribution and double encryption and some other traditional methods such as digital signature. In this approach the encrypted private key and the message are broken into different parts carrying by different agents which makes it difficult for malicious entities to mine the private key for message encryption, while the private key for the...