Ismail Fauzi Isnin

Enhanced chaotic image encryption algorithm based on Baker's map

Imaging has gained importance due to the improvements of performances in computer speed, media storage and network bandwidth. Along with this advancement, the fundamental issue of image security has become a major concern and because of this reason, research in image confidentiality has gained popularity amongst security experts. This paper discusses an alternative chaotic image encryption based on Bakers map. This enhanced symmetric-key algorithm can support a variable-size image as opposed to the algorithm which is mainly based on Bakers map that requires only square image for encryption. In addition, the algorithm also includes other functions such as password binding and pixel shifting to further strengthen the security of the cipher image. The algorithm also supports two modes of operation namely EBC and CBC. The number of iterations to be performed can vary depending on the security level required by the user. The paper also includes an example of image encryption. From the analysis done, it shows that the security level is high even though keys that are found to be weak keys for Bakers map algorithm are being used in the algorithm.

T-MQM: Testbed-Based Multi-Metric Quality Measurement of Sensor Deployment for Precision Agriculture—A Case Study

Efficient sensor deployment is one of the primary requirements of the precision agriculture use case of wireless sensor networks (WSNs) to provide qualitative and optimal coverage and connectivity. The application-based performance variations of the geometrical-model-based sensor deployment patterns restrict the generalization of a specific deployment pattern for all applications. Furthermore, single or double metrics-based evaluation of the deployment patterns focusing on theoretical or simulation aspects can be attributed to the difference in performance of real applications and the reported performance in the literature. In this context, this paper proposes a testbed-based multi-metric quality measurement of sensor deployment for the precision agriculture use case of WSNs. Specifically, seven metrics are derived for the qualitative measurement of sensor deployment patterns for precision agriculture. The seven metrics are quantified for four sensor deployment patterns to measure the quality of coverage and connectivity. Analytical- and simulation-based evaluations of the measurements are validated through testbed experiment-based evaluations which are carried out in “INDRIYA” WSNs testbed. Toward realistic research impact, the investigative evaluation of the geometrical-model-based deployment patterns presented in this paper could be useful for practitioners and researchers in developing performance guaranteed applications for precision agriculture and novel coverage and connectivity models for deployment patterns.

New secure identity-based and certificateless authenticated Key Agreement protocols without pairings

Recently, various pairing-based and pairing-free two party Key Agreement protocols in the context of Identity-Based and Certificateless cryptosystems have been published. The pairing-free Key Agreement protocols could improve the efficiency by eliminating the high expense of pairing maps. In this paper, we proposed several secure and efficient Identity-Based and Certificateless pairing-free two party Key Agreement protocols. In compare with related works, our protocols require less computational cost.

A novel secure two-party identity-based authenticated key agreement protocol without bilinear pairings

Many Identity-Based two-party Key Agreement protocols have been proposed in recent years. Some of them are built on pairing maps, whereas some others could eliminate the pairings in order to decrease the complexity of computation. In this paper, we proposed a secure pairing-free Identity-Based two-party Key Agreement protocol which besides supporting security requirements uses less computational cost in comparison with existing related works.

Secure lightweight pairing-based key-agreement cryptosystems: issues and challenges

Although a large number of pairing-based key-agreement cryptosystems have been proposed, there are still a lot of drawbacks. One of the most important disadvantages of mentioned cryptographic functions is that there is not a comprehensive system to satisfy both security and efficiency requirements. Moreover, there is not an integrated document to categorize and present possible challenges. Therefore, we paid particular attention to this issue, unlike other surveys in the area of key-agreement cryptosystems. In this paper, we presented a new method to address possible challenges. Actually, we claim that unlike existing documents, this paper determines possible challenges and open problems in the area of lightweight pairing-based key-agreement cryptosystems. We expect that our findings make other researchers able to classify all presented cryptosystems in this area and help them to follow the best way to solve possible problems in the future researches.

Secure and Authenticated Key Agreement protocol with minimal complexity of operations in the context of identity-based cryptosystems

Recently, a large variety of Identity-Based Key Agreement protocols have tried to eliminate the use of Bilinear Pairings in order to decrease complexity of computations through performing group operations over Elliptic Curves. In this paper we propose a novel pairing-free Key Agreement protocol over elliptic curve based algebraic groups. The results show that our proposed protocol is significantly less complex than related works from complexity of computation perspective.

An Efficient Pairing-Free Certificateless Authenticated Two-Party Key Agreement Protocol Over Elliptic Curves

Due to the high computation cost of bilinear pairings, pairing-free cryptosystems have received widespread attention recently. Various pairing-free two-party key agreement protocols in the context of public key cryptography (PKC) have been studied. To avoid complex certificate management in traditional PKC and key escrow problem in identity-based ones, several certificateless cryptosystems have been proposed in this research area. In this paper, we proposed a secure and efficient certificateless pairing-free two-party key agreement protocol. In comparison with related works, our protocol requires less computational cost.

Rushing attack against routing protocols in Mobile Ad-Hoc Networks

Because of the nature of wireless channels, Mobile Ad-Hoc Networks (MANETs) are vulnerable against many threats and attacks. Beside of this, the mobility of the network nodes made the security of routing protocols one of the most interesting research areas over Ad-Hoc networks. Moreover, Rushing attack became one of the common attacks against routing protocols in MANETs. Although there are many researches over Rushing attacks, the security research community suffers from a famine of evidence to present the exact position of this kind of attacks in MANETs clearly. Therefore, we paid particular attention to this issue to clarify the position of Rushing attacks against routing protocols and the functionality of this category of attacks. We hope that our document be useful for other researchers in understanding mentioned issue in face with this class of attacks.

Validation Experimentations of Local Alignment Parameters for Comparing DNA and Protein Sequences

A basic issue in aligning DNA and protein sequences is to find similar characters between two or more sequences in order to detect relations between newly defined sequences and well-known sequences stored in genetic databanks. Local Sequences Alignment (LSA) algorithms have been developed to reveal similar regions between compared sequences. LSA algorithms produced optimal alignment using similarity matrix with scoring scheme. Match, mismatch, and gap penalties are identified using substation matrix and affine gap function. The accuracy of the results relies on selecting the best values for these parameters. This paper mainly set out to validate statically parameters for calculating possible alignments.Estimated values are tested using real dataset and the optimal alignment was recorded as well as the parameters. Perfect symmetric results were obtained, when comparing mathematically and statically estimation for the LSA parameters.

Security evaluation over lightweight cryptographic protocols

Due to the applicability of a wide range of cryptosystems in recently proposed applications, a large variety of cryptographic schemes have been developed. It can be claimed that proposing a cryptographic protocol to satisfy security and efficiency requirements is one of the significant challenging issues. Nevertheless, cryptographic research community suffers from non-existence of an integrated pattern to categorize and standardize possible challenges of mentioned concerns. These drawbacks could in turn lead to much confusion for the researchers who are not expert in this research area. Therefore, we paid particular attention to assemble a powerful document to fill this gap between the beginners and the experts. Our final goal is to make other researchers able to classify the challenges over Provably Secure cryptosystems or lightweight ones, analyze the proposed scheme based on the determined components and help them to find better solutions for the future researches.