Cryptography can be thought of as a toolbox, where potential attackers gain access to various computing resources and technologies to try to compute key values. In modern cryptography, the strength of the encryption algorithm is only determined by the size of the key. Therefore, our goal is to create a strong key value that has a minimum bit length that will be useful in light encryption. Using elliptic curve cryptography (ECC) with Rubik's cube and image density, the image colors are combined and distorted, and by using the Chaotic Logistics Map and Image Density with a secret key, the Rubik's cubes for the image are encrypted, obtaining a secure image against attacks. ECC itself is a powerful algorithm that generates a pair of p

When exercising their authority in the jurisprudence, judges are subject to a set of restrictions that they must adhere to, as they do not want their jurisprudence to be accepted and welcomed by law practitioners in general, and legal scholars in particular, and in contrast to it, the arrows of criticism and defamation will extend to that jurisprudence, and then they will have to reverse them . Perhaps the most important of those restrictions imposed on judges is their observance of justice between the parties to the lawsuit through their lack of bias for one of the parties at the expense of the other, in addition to their observance of public order and public morals, as well as their observance of the legal texts that they work under its u

A remarkable correlation between chaotic systems and cryptography has been established with sensitivity to initial states, unpredictability, and complex behaviors. In one development, stages of a chaotic stream cipher are applied to a discrete chaotic dynamic system for the generation of pseudorandom bits. Some of these generators are based on 1D chaotic map and others on 2D ones. In the current study, a pseudorandom bit generator (PRBG) based on a new 2D chaotic logistic map is proposed that runs side-by-side and commences from random independent initial states. The structure of the proposed model consists of the three components of a mouse input device, the proposed 2D chaotic system, and an initial permutation (IP) table. Statist

Administrative procedures in various organizations produce numerous crucial records and data. These
records and data are also used in other processes like customer relationship management and accounting
operations.It is incredibly challenging to use and extract valuable and meaningful information from these data
and records because they are frequently enormous and continuously growing in size and complexity.Data
mining is the act of sorting through large data sets to find patterns and relationships that might aid in the data
analysis process of resolving business issues. Using data mining techniques, enterprises can forecast future
trends and make better business decisions.The Apriori algorithm has bee

Recommender Systems are tools to understand the huge amount of data available in the internet world. Collaborative filtering (CF) is one of the most knowledge discovery methods used positively in recommendation system. Memory collaborative filtering emphasizes on using facts about present users to predict new things for the target user. Similarity measures are the core operations in collaborative filtering and the prediction accuracy is mostly dependent on similarity calculations. In this study, a combination of weighted parameters and traditional similarity measures are conducted to calculate relationship among users over Movie Lens data set rating matrix. The advantages and disadvantages of each measure are spotted. From the study, a n

The rapid development of telemedicine services and the requirements for exchanging medical information between physicians, consultants, and health institutions have made the protection of patients’ information an important priority for any future e-health system. The protection of medical information, including the cover (i.e. medical image), has a specificity that slightly differs from the requirements for protecting other information. It is necessary to preserve the cover greatly due to its importance on the reception side as medical staff use this information to provide a diagnosis to save a patient's life. If the cover is tampered with, this leads to failure in achieving the goal of telemedicine. Therefore, this work provides an in

A mathematical eco-epidemiological model consisting of harvested prey–predator system involving fear and disease in the prey population is formulated and studied. The prey population is supposed to be separated into two groups: susceptible and infected. The susceptible prey grows logistically, whereas the infected prey cannot reproduce and instead competes for the environment’s carrying capacity. Furthermore, the disease is transferred through contact from infected to susceptible individuals, and there is no inherited transmission. The existence, positivity, and boundedness of the model’s solution are discussed. The local stability analysis is carried out. The persistence requirements are established. The global behavior of th

In 2010, Long and Zeng introduced a new generalization of the Bernstein polynomials that depends on a parameter  and called -Bernstein polynomials. After that, in 2018, Lain and Zhou studied the uniform convergence for these -polynomials and obtained a Voronovaskaja-type asymptotic formula in ordinary approximation. This paper studies the convergence theorem and gives two Voronovaskaja-type asymptotic formulas of the sequence of -Bernstein polynomials in both ordinary and simultaneous approximations. For this purpose, we discuss the possibility of finding the recurrence relations of the -th order moment for these polynomials and evaluate the values of -Bernstein for the functions ,  is a non-negative integer

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.