By Topic

Information Security, IET

Issue 3 • Date Sept. 2013

Filter Results

Displaying Results 1 - 12 of 12
  • On the generalisation of special moduli for faster interleaved montgomery modular multiplication

    Page(s): 165 - 171
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (449 KB)  

    In this study, the authors give a generalisation of special moduli for faster interleaved Montgomery modular multiplication algorithm with simplified pre-computational phase for GF(pn), where p ≥ 2 is a prime number and n is a positive integer. The authors propose different sets of moduli that can be used in elliptic curve crytographic applications and pairing-based cryptography. Moreover, this method also leads to efficient implementations for the elliptic curve parameters given in standards. It is shown that one can obtain efficient Montgomery modular multiplication architecture in view of the number of AND gates and XOR gates by choosing proposed sets of moduli. The authors eliminate final substraction step with proposed sets of moduli. These methods are easy to implement for hardware. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Aryabhata remainder theorem-based non-iterative electronic lottery mechanism with robustness

    Page(s): 172 - 180
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (234 KB)  

    The lottery game has been around for centuries and gained the attention of thousands of individuals because of the chance of making a big fortune. It is often launched by a national institute or a legitimate organisation for gathering funds or raising charity monies. In this study, the authors aim to design a new, electronic lottery (e-lottery) system based on Aryabhata remainder theorem, which can help realise e-lottery games. In particular, the new mechanism can guarantee the security of this popular game involving the potential for a lot of money. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Newmultivariate hash function quadratic polynomials multiplying linear polynomials

    Page(s): 181 - 188
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (275 KB)  

    In this study the authors propose a new multivariate hash function with HAsh Iterative FrAmework framework which we call the hash function quadratic polynomials multiplying linear polynomials (QML). The new hash function is made of cubic polynomials which are the products of quadratic polynomials and linear polynomials. The authors design the quadratic-polynomial part of the compression function based on the centre map of the multivariate public key cryptosystem Matsumoto-Imai cryptosystem (MI). The hash function QML can keep the three cryptography properties and be immune to the pre-image attack, second pre-image attack, collision attack, differential attack and algebraic attack. The required memory storage is about 50% of the one which is built of the cubic polynomials and their coefficients are random. On the avalanche effect, by experiments the authors get the result that about one half of the output bits are different when one input bit is changed randomly. The one-round diffusion of the hash function QML is twice of that of Blake. Also the authors simplify the matrixes of the new hash function, analyse the rationality and show the comparable data. Finally, the authors give the advice to the parameters of the new hash function and summarise the paper. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Enhanced digital rights management authentication scheme based on smart card

    Page(s): 189 - 194
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (123 KB)  

    As a result of the explosive growth in development for computer networks and information technologies in recent years, various activities take place on the Internet, such as the multimedia services. Today, the distribution of large scale digital content (such as audio, video and images) has become easier and more efficient than ever before. However, the intellectual property violation of copyright-protected content has emerged as a major concern. Therefore digital contents are generally encrypted to prevent unauthorised access. A technology of digital rights management (DRM) refers to any of several encryption technologies used to protect digital contents against unauthorised copying, and to control the distribution of the content. Recently, Zhang et al. proposed a DRM authentication scheme based on smart card to realise session key exchange and mutual authentication among all the parties in DRM environment. The proposed scheme is efficient at server side and compact in smart card design. However, the authors will show their proposed scheme cannot resist insider attack and stolen smart card attack, then the authors will propose an improved scheme to preclude above weaknesses. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • BLAST: B-LAyered bad-character SHIFT tables for high-speed pattern matching

    Page(s): 195 - 202
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (587 KB)  

    In this study, the authors propose a new multi-pattern matching algorithm, called BLAST (B-LAyered bad-character Shift Tables with a single-byte search unit), which considers space-time tradeoff in the context of shift values during the search. Here, the term `bad character' is a character that causes a mismatch. While checking multiple bytes in scanning the text at a time, the BLAST algorithm overcomes the reduction of the average shift value in a typical search, which is caused by the dependency on the multi-byte search unit (MBSU) and the large frequency of the last character of the given patterns. From the theoretical analysis, the authors validate the correctness of the BLAST algorithm. Also, from the experimental results across different setups, the authors show that the BLAST algorithm provides the faster search time than the other algorithms. For example, the authors obtain an enhancement by as much as 212.41% on average for various numbers of attack patterns and attack traffic conditions compared with that of the modified Wu-Manber algorithm. In addition, it is shown that the BLAST algorithm drastically reduces the amount of memory required for constructing the shift table based on a MBSU from 64 KB to 1 KB. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TEAP: trust-enhanced anonymous on-demand routing protocol for mobile ad hoc networks

    Page(s): 203 - 211
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (521 KB)  

    Security plays a major role in implementing mobile ad hoc networks (MANET) for communication in an adverse environment. This study introduces the concept of anonymity for an informant who identifies and reports anonymously the misbehaviour of the users in the network. The trust-enhanced anonymous on-demand routing protocol (TEAP) is proposed to restrain the misuse of anonymity in two methods. In the first method, a user is revealed as a misbehaving user to other users, if it does not send any cooperative message, upon receiving two warnings. In the second method, if a user attempts to send multiple claims against a particular user for the same reason it will also be termed as a misbehaving user. The TEAP protocol is designed based upon broadcast with trapdoor information is a cryptography concept which is used to detect the misbehaving users anonymously in the network. The simulation results prove the necessity of anonymity in MANET and the effectiveness of this protocol in achieving such anonymity. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Security and complexity of the McEliece cryptosystem based on quasi-cyclic low-density parity-check codes

    Page(s): 212 - 220
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (188 KB)  

    In the context of public key cryptography, the McEliece cryptosystem represents a very smart solution based on the hardness of the decoding problem, which is believed to be able to resist the advent of quantum computers. Despite this, the original McEliece cryptosystem based on Goppa codes, has encountered limited interest in practical applications, partly because of some constraints imposed by this very special class of codes. The authors have recently introduced a variant of the McEliece cryptosystem including low-density parity-check codes, that are state-of-the-art codes, now used in many telecommunication standards and applications. In this study, the authors discuss the possible use of a bit-flipping decoder in this context, which gives a significant advantage in terms of complexity. The authors also provide theoretical arguments and practical tools for estimating the trade-off between security and complexity, in such a way to give a simple procedure for the system design. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Channel level crossing-based security for communications over fading channels

    Page(s): 221 - 229
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (530 KB)  

    Several key exchange methods for wireless channels have been proposed in the literature. They are referred to as physical-layer security techniques and are usually based on the channel's fading characteristics and the principle of channel reciprocity. In this study, the authors present key exchange algorithms for wireless fading channels whose operation is based on channel estimation. Specifically, the authors present a complete key exchange scheme that includes channel sampling, thresholding and error reconciliation. Two error reconciliation methods are proposed. The first one is based on neural networks and the second one is based on linear block coding. Simulations of the proposed methods' performances and levels of security are presented and conclusions are drawn regarding their overall utility. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Superpoly algebraic normal form monomial test on Trivium

    Page(s): 230 - 238
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (283 KB)  

    Recently, AIDA/cube testers have been revealed to be useful in building distinguishers for several cryptography schemes. χ2 tests, on the other hand, are well known and extensively used for distinguishing purposes. In this study, the notion of multi-χ2 test and AIDA/cube testers are utilised to introduce the superpoly algebraic normal form monomial test through which the output of reduced round Trivium is distinguished from being random. The test successfully distinguishes the keystream of Trivium with 830 out of 1152 initialisation rounds with a complexity of 239 operations, which is the most effective distinguisher on reduced Trivium thus far. Applying algebraic IV differential attack (AIDA)/cube testers to a system, one of the main concerns is the appropriate choice of the superpoly variables, in the sense that the complexity of distinguishing the system output becomes near minimal. In an effort to discover appropriate superpoly variables, the authors propose a heuristic method that determines weak combination set of bits. The notion of weak combinations is defined in this study as a property ofthe cube variables whose corresponding superpoly is distinguishable. This heuristic method is performed on reduced round Trivium and its strength on determining appropriate superpoly variables is verified for 730 and 760 rounds Trivium. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Publicly verifiable multi-secret sharing scheme from bilinear pairings

    Page(s): 239 - 246
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (164 KB)  

    In a verifiable multi-secret sharing (VMSS) scheme, multiple secrets are shared among participants during one sharing process in such a way that some qualified subsets of them can recover these secrets. Verifiable property means that one participant may verify his/her own share, but cannot check the validity of the other participants' shares. Verifiable property is deficient for some specific applications such as electronic voting and revocable electronic cash. Publicly verifiable property is more applicable than verifiable property because the shares can be verified by any party. In this study, an efficient publicly verifiable multi-secret sharing (PVMSS) scheme using bilinear pairings is proposed. Under the computational Diffie-Hellman and modified bilinear Diffie-Hellman assumptions, the authors demonstrate that the proposed scheme is a secure PVMSS scheme. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust elliptic curve cryptography-based three factor user authentication providing privacy of biometric data

    Page(s): 247 - 252
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (226 KB)  

    Recently, to achieve privacy protection using biometrics, Fan and Lin proposed a three-factor authentication scheme based on password, smart card and biometrics. However, the authors have found that Fan and Lin's proposed scheme (i) has flaws in the design of biometrics privacy, (ii) fails to maintain a verification table, making it vulnerable to stolen-verifier attack and modification attack, and (iii) is vulnerable to insider attacks. Thus, the authors propose an elliptic curve cryptography-based authentication scheme that is improved with regard to security requirements. The authors' proposed scheme overcomes the flaws of Fan and Lin's scheme and is secured from attacks. Furthermore, the authors have presented a security analysis of their scheme to show that their scheme is suitable for the biometric systems. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Strong non-repudiation based on certificateless short signatures

    Page(s): 253 - 263
    Save to Project icon | Click to expandQuick Abstract | PDF file iconPDF (205 KB)  

    In this study, the authors consider certificateless signature (CLS) schemes for strong non-repudiation. They show that previous security models which ensure that any user can have a unique key pair cannot guarantee a CLS scheme to achieve strong non-repudiation. The authors then fix the security model and propose a new CLS scheme which provides strong non-repudiation under the new model, assuming the computational Diffie-Hellman problem is intractable. View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.

Aims & Scope

IET Information Security publishes original research papers in the following areas of information security and cryptography.

Full Aims & Scope

Meet Our Editors

Publisher
IET Research Journals
iet_ifs@theiet.org