The Twofish cipher is a very powerful algorithm with a fairly complex structure that permeates most data parsing and switching and can be easily implemented. The keys of the Twofish algorithm are of variable length (128, 192, or 256 bits), and the key schedule is generated once and repeated in encrypting all message blocks, whatever their number, and this reduces the confidentiality of encryption. This article discusses the process of generating cipher keys for each block. This concept is new and unknown in all common block cipher algorithms. It is based on the permanent generation of sub keys for all blocks and the key generation process, each according to its work. The Geffe's Generator is used to generate subkeys to make each explicit block a new key that differs from block to block, gaining protection against attacks. Finally, this algorithm works almost like a One-Time Pad.
Background: The purpose of the current study was to evaluate the efficacy of a new orthodontic bonding system (Beauty Ortho Bond) involving the shear bond strength in dry and wet environments, and adhesion remnant index (ARI) scores evaluation in regard to other bonding systems (Heliosit and Resilience Orthodontic Adhesives). Materials and methods: Sixty defect free extracted premolars were randomly divided into six groups of 10 teeth each, mounted in acrylic resin, three groups for a dry environment and three for a wet one. Shear bond strength test was performed with a cross head speed of 0.5 mm/min, while surfaces of enamel and bracket-adhesive-enamel surfaces were examined with stereomicroscope For ARI scores evaluation. Data were analyz
... Show MoreSome new 2,5-disubsituted-1,3,4-oxadiazole derivatives with azo group were synthesized by known reactions sequence . The structure of the synthesized compounds were confirmed by physical and spectral means .
The Battle of Kadesh is replete with many military arrangements that reflect the tremendous development of war preparations in the thirteenth century BC; where the expressive pictures the Egyptians left on some of the walls of their temples show the tremendous ability to organize and divide the forces and the great development that affected the war machine. Furthermore, the text accompanied these pictures reveal some news about that battle, which is considered one of the most important wars in the ancient world. Thus, the importance of the study lies in the fact that it examines one of the most important battles of the ancient Near East, the results of which had great repercussions on the region. This is because it is the most abundant B
... Show MoreFive new ostracod species belonging to the subfamily Trachyleberidinae have been described. They are Paragrenocythere monilis and Peloriops levisulcata from the Maastrichtian of Iraq; Oertliella petraensis from the early Palaeocene (middle – late Danian) of Jordan; Reticulina syriaensis from the Palaeocene of Syria and Reticulina ninurta from the middle – late Eocene of Iraq.
In this study, a platinum(II) complex ([Pt(H2L)(PPh3)] complex) containing a thiocarbohydrazone as the ligand was tested as an anti-proliferative agent against ovarian adenocarcinoma (Caov-3) and human colorectal adenocarcinoma (HT-29) through MTT assays. Apoptotic markers were tested by the AO/PI double staining assay and DNA fragmentation test. Flow cytometry was conducted to measure cell cycle distribution, while the p53 and caspase-8 pathways were tested via immunofluorescence assay. Results demonstrated that the cytotoxic effect of the Pt(II)- thiocarbohydrazone complexes against Caov-3 and HT-29 cells was highly significant, and this effect triggered the activation of the p53 and caspase-8 pathways. Besides, apoptosis stimulated by th
... Show MoreGiven a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.