Online ISSN
1751-8717
Print ISSN
1751-8709
IET Information Security
Volume 5, Issue 3, September 2011
Volumes & issues:
Volume 5, Issue 3
September 2011
-
- Author(s): H. Mala ; M. Dakhilalian ; M. Shakiba
- Source: IET Information Security, Volume 5, Issue 3, p. 129 –134
- DOI: 10.1049/iet-ifs.2010.0094
- Type: Article
- + Show details - Hide details
-
p.
129
–134
(6)
Camellia, a 128-bit block cipher that has been accepted by ISO/IEC as an international standard, is increasingly being used in many cryptographic applications. In this study, the authors present a new impossible differential attack on a reduced version of Camellia-256 without FL/FL−1 functions and whitening. First, the authors introduce a new extension of the hash table technique and then exploit it to attack 16 rounds of Camellia-256. When, in an impossible differential attack, the size of the target subkey space is large and the filtration, in the initial steps of the attack, is performed slowly, the extended hash table technique will be very useful. The proposed attack on Camellia-256 requires 2124.1 known plaintexts and has a running time equivalent to about 2249.3 encryptions. In terms of the number of attacked rounds, our result is the best published attack on Camellia-256. - Author(s): R. Leszczyna ; I.N. Fovino ; M. Masera
- Source: IET Information Security, Volume 5, Issue 3, p. 135 –144
- DOI: 10.1049/iet-ifs.2010.0261
- Type: Article
- + Show details - Hide details
-
p.
135
–144
(10)
This study presents an approach to the security assessment of the information systems of critical infrastructures. The approach is based on the faithful reconstruction of the evaluated information system in a computer security laboratory followed by simulations of possible threats against the system. The evidence collected during the experiments, stored and organised using a proprietary system InSAW, may later be used for the creation of trust cases which provide valuable information for the end users of the infrastructure. Another new proposal is MAlSim – mobile agent-based simulator of malicious software (viruses, worms, etc). To the best of the authors' knowledge, such a simulator has not been proposed before. The present approach was applied to the verification of the security of industrial control systems and power plants. In the study, one of the experiments related to the security study of an information system of a power plant, a simulation of zero-day worm attack, is described. - Author(s): A.K. Das
- Source: IET Information Security, Volume 5, Issue 3, p. 145 –151
- DOI: 10.1049/iet-ifs.2010.0125
- Type: Article
- + Show details - Hide details
-
p.
145
–151
(7)
The author first reviews the recently proposed Li-Hwang's biometric-based remote user authentication scheme using smart cards; then shows that the Li-Hwang's scheme has some design flaws in their scheme. In order to withstand those flaws in their scheme, an improvement of their scheme is further proposed. The author also shows that the improved scheme provides strong authentication with the use of verifying biometric, password as well as random nonces generated by the user and the server as compared to that for the Li-Hwang's scheme and other related schemes. - Author(s): W.-T. Huang ; C.H. Chang ; C.W. Chiou ; S.-Y. Tan
- Source: IET Information Security, Volume 5, Issue 3, p. 152 –162
- DOI: 10.1049/iet-ifs.2010.0139
- Type: Article
- + Show details - Hide details
-
p.
152
–162
(11)
Finite field arithmetic has been widely used in many cryptosystems, particularly in the elliptic curve cryptosystem (ECC) and the advanced encryption standard (AES) as a method for speeding up their encryption/decryption processes. Low-cost design for finite field arithmetic is more attractive for various mobile applications. It is a factor that a large number of Exclusive OR (XOR) gates have been used in the arithmetic operations under the traditional finite field arithmetic implementation. Thus, the cost of the traditional finite field arithmetic cannot be effectively lowered, because a typical XOR gate design consists of 12 transistors. To address this, a novel non-XOR approach consisting of eight transistors, for realising low-cost polynomial basis (PB) multiplier over GF(2m) was developed in this study. The authors proposed that non-XOR architecture for bit-parallel PB multiplier uses the multiplexer function instead of the traditional XOR function in its design. Based on the proposed non-XOR methodology, three popular low-cost irreducible polynomials – trinomial, pentanomial and all-one-polynomial – are proposed and designed in this study. The results indicate that the proposed non-XOR architecture can reduce space complexity by 22%, compared with that of the traditional design. - Author(s): L.J. García Villalba ; J. Garcia Matesanz ; D. Rupérez Cañas ; A.L. Sandoval Orozco
- Source: IET Information Security, Volume 5, Issue 3, p. 163 –169
- DOI: 10.1049/iet-ifs.2010.0085
- Type: Article
- + Show details - Hide details
-
p.
163
–169
(7)
The design of routing protocols for mobile ad hoc networks rarely contemplates, in most cases, hostile environments. Consequently, it is common to add security extensions afterwards. One of the most important routing protocols is the optimised link state routing (OLSR), which in its specification assumes the trust of all nodes in the network, making it vulnerable to different kinds of attacks. This study presents an extension of OLSR, called COD-OLSR, which provides security for OLSR in the case of incorrect message generation attacks which can occur in two forms (identity spoofing and link spoofing). This is one of its main features, which takes into account the current topology of the node sending the message. The behaviour of COD-OLSR against different attackers in a variety of situations is evaluated. The simulation results show that COD-OLSR adds a slight overhead to OLSR and barely affects performance. The results also show that COD-OLSR is an interesting alternative to provide integrity in OLSR compared with classical mechanisms making use of cryptography, which is more complex and has a high overhead. - Author(s): X. Li ; J. Liu ; J. Sun ; X. Yang ; W. Liu
- Source: IET Information Security, Volume 5, Issue 3, p. 170 –180
- DOI: 10.1049/iet-ifs.2010.0218
- Type: Article
- + Show details - Hide details
-
p.
170
–180
(11)
Quantisation index modulation (QIM) is an important class of watermarking methods, which has been widely used in blind watermarking applications. It is well known that spread transform dither modulation (STDM), as an extension of QIM, has good performance in robustness against random noise and re-quantisation. However, the quantisation step-sizes used in STDM are random numbers not taking features of the image into account. The authors present a step projection-based approach to incorporate the perceptual model with STDM framework. Four implementations of the proposed algorithm are further presented according to different modified versions of the perceptual model. Experimental results indicate that the step projection-based approach can incorporate the perceptual model with STDM framework in a better way, thereby providing a significant improvement in image fidelity. Compared with the former proposed modified schemes of STDM, the author's best performed implementation provides powerful resistance against common attacks, especially in robustness against Gauss noise, salt and pepper noise and JPEG compression.
Impossible differential cryptanalysis of reduced–round Camellia–256
Approach to security assessment of critical infrastructures’ information systems
Analysis and improvement on an efficient biometric-based remote user authentication scheme using smart cards
Non-XOR approach for low-cost bit-parallel polynomial basis multiplier over GF(2m)
Secure extension to the optimised link state routing protocol
Step-projection-based spread transform dither modulation
Most viewed content for this Journal
Article
content/journals/iet-ifs
Journal
5
Most cited content for this Journal
-
High accuracy android malware detection using ensemble learning
- Author(s): Suleiman Y. Yerima ; Sakir Sezer ; Igor Muttik
- Type: Article
-
Crypto-based algorithms for secured medical image transmission
- Author(s): Ali Al-Haj ; Gheith Abandah ; Noor Hussein
- Type: Article
-
Pseudorandom bit generator based on non-stationary logistic maps
- Author(s): Lingfeng Liu ; Suoxia Miao ; Hanping Hu ; Yashuang Deng
- Type: Article
-
Constructing important features from massive network traffic for lightweight intrusion detection
- Author(s): Wei Wang ; Yongzhong He ; Jiqiang Liu ; Sylvain Gombault
- Type: Article
-
Empirical analysis of Tor Hidden Services
- Author(s): Gareth Owen and Nick Savage
- Type: Article