This work aims to develop a secure lightweight cipher algorithm for constrained devices. A secure communication among constrained devices is a critical issue during the data transmission from the client to the server devices. Lightweight cipher algorithms are defined as a secure solution for constrained devices that require low computational functions and small memory. In contrast, most lightweight algorithms suffer from the trade-off between complexity and speed in order to produce robust cipher algorithm. The PRESENT cipher has been successfully experimented on as a lightweight cryptography algorithm, which transcends other ciphers in terms of its computational processing that required low complexity operations. The mathematical model of

Honeywords are fake passwords that serve as an accompaniment to the real password, which is called a “sugarword.” The honeyword system is an effective password cracking detection system designed to easily detect password cracking in order to improve the security of hashed passwords. For every user, the password file of the honeyword system will have one real hashed password accompanied by numerous fake hashed passwords. If an intruder steals the password file from the system and successfully cracks the passwords while attempting to log in to users’ accounts, the honeyword system will detect this attempt through the honeychecker. A honeychecker is an auxiliary server that distinguishes the real password from the fake passwords and t

Because of vulnerable threats and attacks against database during transmission from sender to receiver, which is one of the most global security concerns of network users, a lightweight cryptosystem using Rivest Cipher 4 (RC4) algorithm is proposed. This cryptosystem maintains data privacy by performing encryption of data in cipher form and transfers it over the network and again performing decryption to original data. Hens, ciphers represent encapsulating system for database tables

Implementation of TSFS (Transposition, Substitution, Folding, and Shifting) algorithm as an encryption algorithm in database security had limitations in character set and the number of keys used. The proposed cryptosystem is based on making some enhancements on the phases of TSFS encryption algorithm by computing the determinant of the keys matrices which affects the implementation of the algorithm phases. These changes showed high security to the database against different types of security attacks by achieving both goals of confusion and diffusion.

     In this paper, the botnet detection problem is defined as a feature selection problem and the genetic algorithm (GA) is used to search for the best significant combination of features from the entire search space of set of features. Furthermore, the Decision Tree (DT) classifier is used as an objective function to direct the ability of the proposed GA to locate the combination of features that can correctly classify the activities into normal traffics and botnet attacks. Two datasets  namely the UNSW-NB15 and the Canadian Institute for Cybersecurity Intrusion Detection System 2017 (CICIDS2017), are used as evaluation datasets. The results reveal that the proposed DT-aware GA can effectively find the relevant features from

The main goal of this paper is to introduce and study a new concept named d^*-supplemented which can be considered as a generalization of W- supplemented modules and d-hollow module. Also, we introduce a d^*-supplement submodule. Many relationships of d^*-supplemented modules are studied. Especially, we give characterizations of d^*-supplemented modules and relationship between this kind of modules and other kind modules for example every d-hollow (d-local) module is d^*-supplemented and by an example we show that the converse is not true.

     The -s-extending modules will be purpose of this paper, a module M  is -s-extending if each submodule in M is essential in submodule has a supplement that is direct summand. Initially, we give relation between this concept with weakly supplement extending modules and -supplemented modules. In fact, we gives the following implications:

Lifting modules   -supplemented modules   -s-extending modules  weakly supplement extending modules.

It is also we give examples show that, the converse of this result is not true. Moreover, we study when the converse of this result is true.

Background: Malignant lymphomas represent about 5% of all malignancy of the head and neck region which can involve lymph nodes as well as soft tissue and bone of the maxillofacial region. Apoptosis is considered a vital component of various processes including normal cell turnover, proper development and functioning of the immune system. Inappropriate apoptosis is a factor in many human conditions including neurodegenerative diseases, ischemic damage, autoimmune disorders and many types of cancer. Expression of p53 Proteins in Hodgkin׳s and Non Hodgkin׳s lymphomas suggested that it can help in monitoring of patients and the markers may aid in controlling the progression of lymphoma and detect the degree of aggressiveness of the diseas

Concealing the existence of secret hidden message inside a cover object is known as steganography, which is a powerful technique. We can provide a secret communication between sender and receiver using Steganography. In this paper, the main goal is for hiding secret message into the pixels using Least Significant Bit (LSB) of blue sector of the cover image. Therefore, the objective is by mapping technique presenting a model for hiding text in an image. In the model for proposing the secret message, convert text to binary also the covering (image) is divided into its three original colors, Red, Green and Blue (RGB) , use the Blue sector convert it to binary,  hide two bits from the message in  two bits of the least significant b