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.

Nowadays, it is quite usual to transmit data through the internet, making safe online communication essential and transmitting data over internet channels requires maintaining its confidentiality and ensuring the integrity of the transmitted data from unauthorized individuals. The two most common techniques for supplying security are cryptography and steganography. Data is converted from a readable format into an unreadable one using cryptography. Steganography is the technique of hiding sensitive information in digital media including image, audio, and video. In our proposed system, both encryption and hiding techniques will be utilized. This study presents encryption using the S-DES algorithm, which generates a new key in each cyc

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

     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 present theoretical study analyzes the legacy of the Chicago School of Urban Sociology and evaluates it in the light of the growth and development of Chicago City and the establishment of sociology in it. Sociology has become an academic discipline recognized in the United States of America in the late nineteenth century, particularly, after the establishment of the first department of sociology in the University of Chicago in 1892. That was during the period of the rapid industrialization and sustainable growth of the Chicago City. The Chicago School relied on Chicago City in particular, as one of the American cities that grew and expanded rapidly in the first two decades of the twentieth century. At the end of the nineteenth centur

          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.

Context: The ability of implant dentistry to be a successful alternative for edentulous patients has increased in the last decade. Clinical features such as osseointegration and stability, in addition to the endurance of the integration urged the researchers towards a better understanding of the design parameters that control long term success of the implants. It is therefore necessary to quantify the effect of changing implant design parameters on interface stress distribution within the maxilla bone. Methods and Materials: A 3D-finite element study was conducted to investigate the effect of changing implant shape parameters (implant body design and implant thread depth) on stress distribution while insertion of the implant in two diff

Background: Orthodontic tooth movement is characterized by tissue reactions, which consist of an inflammatory response in periodontal ligament and followed by bone remodeling in the periodontium depending on the forces applied. These processes trigger the secretion of various proteins and enzymes into the saliva.The purpose of this study was to evaluate the activity of alkaline phosphatase (ALP) in saliva during orthodontic tooth movement using different magnitude of continuous orthodontic forces. Materials and Methods: Thirty orthodontic patients (12 males and 18 females) aged 17-23 years with class II division I malocclusion all requiring bilateral maxillary first premolar extractions were randomly divided into three groups according to t