In modern era, which requires the use of networks in the transmission of data across distances, the transport or storage of such data is required to be safe. The protection methods are developed to ensure data security. New schemes are proposed that merge crypto graphical principles with other systems to enhance information security. Chaos maps are one of interesting systems which are merged with cryptography for better encryption performance. Biometrics is considered an effective element in many access security systems. In this paper, two systems which are fingerprint biometrics and chaos logistic map are combined in the encryption of a text message to produce strong cipher that can withstand many types of attacks. The histogram analysis of ciphertext shows that the resulted cipher is robust. Each character in the plaintext has different representations in the ciphertext even if the characters are repeated through the message. The strength of generated cipher was measured through brute force attackers, they were unable to deduce the key from the knowledge about pairs of plaintext- ciphertext due to the fact that each occurrence of characters in the message will have different shift value, and as a result a diverse representation will be obtained for same characters of the message.
Arabic text classification is a challenging task because of the complex morphology of the language, the existence of different writing forms and a multitude of dialects, which can result in sparser common text representations. While transformer models such as AraBERT have obtained superior results on many Arabic NLP tasks, their high computational requirements make them difficult to deploy in environments with limited hardware resources. In some cases this can also make the model less practical for researchers working with basic computer systems. This study focuses on a more practical issue: how much accuracy a simple classifier may lose when the amount of required computation is reduced. We use a combined TF-IDF representation based on bo
... Show MoreThe idea of ech fuzzy soft bi-closure space ( bicsp) is a new one, and its basic features are defined and studied in [1]. In this paper, separation axioms, namely pairwise, , pairwise semi-(respectively, pairwise pseudo and pairwise Uryshon) - fs bicsp's are introduced and studied in both ech fuzzy soft bi-closure space and their induced fuzzy soft bitopological spaces. It is shown that hereditary property is satisfied for , with respect to ech fuzzy soft bi-closure space but for other mentioned types of separations axioms, hereditary property satisfies for closed subspaces of ech fuzzy soft bi-closure space.