Distributed Denial of Service (DDoS) attacks on Web-based services have grown in both number and sophistication with the rise of advanced wireless technology and modern computing paradigms. Detecting these attacks in the sea of communication packets is very important. There were a lot of DDoS attacks that were directed at the network and transport layers at first. During the past few years, attackers have changed their strategies to try to get into the application layer. The application layer attacks could be more harmful and stealthier because the attack traffic and the normal traffic flows cannot be told apart. Distributed attacks are hard to fight because they can affect real computing resources as well as network bandwidth. DDoS attacks can also be made with smart devices that connect to the Internet, which can be infected and used as botnets. They use Deep Learning (D.L.) techniques like Convolutional Neural Network (C.N.N.) and variants of Recurrent Neural Networks (R.N.N.), such as Long Short-Term Memory (L.S.T.M.), Bidirectional L.S.T.M., Stacked L.S.T.M., and the Gat G.R.U.. These techniques have been used to detect (DDoS) attacks. The Portmap.csv file from the most recent DDoS dataset, CICDDoS2019, has been used to test D.L. approaches. Before giving the data to the D.L. approaches, the data is cleaned up. The pre-processed dataset is used to train and test the D.L. approaches. In the paper, we show how the D.L. approach works with multiple models and how they compare to each other.
(2)
(2)
This paper contains an equivalent statements of a pre- space, where are considered subsets of with the product topology. An equivalence relation between the preclosed set and a pre- space, and a relation between a pre- space and the preclosed set with some conditions on a function are found. In addition, we have proved that the graph of is preclosed in if is a pre- space, where the equivalence relation on is open.
On the other hand, we introduce the definition of a pre-stable ( pre-stable) set by depending on the concept of a pre-neighborhood, where we get that every stable set is pre-stable. Moreover, we obtain that
... Show More
(4)
(1)
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.
(7)
(2)
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
(1)
(22)
(20)
The aim of this work is to design an algorithm which combines between steganography andcryptography that can hide a text in an image in a way that prevents, as much as possible, anysuspicion of the hidden textThe proposed system depends upon preparing the image data for the next step (DCT Quantization)through steganographic process and using two levels of security: the RSA algorithm and the digitalsignature, then storing the image in a JPEG format. In this case, the secret message will be looked asplaintext with digital signature while the cover is a coloured image. Then, the results of the algorithmare submitted to many criteria in order to be evaluated that prove the sufficiency of the algorithm andits activity. Thus, the proposed algorit
... Show More
(2)
Let be a ring. Given two positive integers and , an module is said to be -presented, if there is an exact sequence of -modules with is -generated. A submodule of a right -module is said to be -pure in , if for every -Presented left -module the canonical map is a monomorphism. An -module has the -pure intersection property if the intersection of any two -pure submodules is again -pure. In this paper we give some characterizations, theorems and properties of modules with the -pure intersection property.
Controls Scanning on the slippers a study fiqhiat Comparison
The subject of this research is an important topic, which is frequently repeated, and people need to know its wisdom, and has made it in front and the preface and three detectives, showed through discussion the meaning of the survey on the socks, its wisdom, its rules and conditions, and the duration of the survey on it, spoiled and reasoned and compared to the doctrinal doctrines, And the most correct statement of words I have concluded with a number of things, as follows:
- The need to ensure that the slippers are clean, visible and inwa
A Multiple System Biometric System Based on ECG Data
(1)