Cryptographic applications demand much more of a pseudo-random-sequence
generator than do most other applications. Cryptographic randomness does not mean just
statistical randomness, although that is part of it. For a sequence to be cryptographically
secure pseudo-random, it must be unpredictable.
The random sequences should satisfy the basic randomness postulates; one of them is
the run postulate (sequences of the same bit). These sequences should have about the same
number of ones and zeros, about half the runs should be of length one, one quarter of length
two, one eighth of length three, and so on.The distribution of run lengths for zeros and ones
should be the same. These properties can be measured deterministicallyand then compared to
statistical expectations using a chi-square test.
In this paper the Run Criterion, is calculated, it can be calculated for any key generator
before it be implemented or constructed (software or hardware).The cryptosystems: Linear,
Product and Brüer are chosen as study cases.
In this paper, we present some numerical methods for solving systems of linear FredholmVolterra integral equations of the second kind. These methods namely are the Repeated Trapezoidal Method (RTM) and the Repeated Simpson's 1/3 Method (RSM). Also some numerical examples are presented to show the efficiency and the accuracy of the presented work.
The research aims to identify the obstacles facing the application of electronic management in our university libraries, including the central library of the University of Baghdad and the central library of Al-Mustansiriya University, the research sample, as they are among the main libraries that used electronic technologies in managing some of their work and in providing their services, and they have a website via the Internet. The research relied on the case study method to identify the obstacles by visiting the two libraries, interviewing their managers and employees responsible for the departments, and answering inquiries about the obstacles that prevent the application of electronic management in order to identify them and find appropr
... Show MoreThe anatomical features of leaves and stems of seven species belonging to five genera of the Papaveraceae family were studied, including: Fumaria bracteosa Pomel, 1875; Glaucium grandiflorum Boissier & A. Huet,1856; Hypecoum pendulum Linnaeus, 1753; Papaver fugax Poiret,1804; Papaver macrostomum Boissier & A. Huet, 1867; Papaver rhoeas Linnaeus, 1753 and Roemeria refracta de Candolle,1821. The results showed that the anticlinal cell walls of the adaxial surface were more thickened in P. fugax, H. pendulum, P. macrostomum and R.refracta, while it was thin in P. rhoeas. The cur
... Show MoreOrganizational learning is one of the most important means of human resource development in organizations, but most of the organizations, especially public ones do not realize the importance of organizational learning enough, and estimated his role accurately in building intellectual capital, the resource competitive importantly for organizations of the third millennium and who suffers is other end of lack of understanding of its meaning and how to prove its presence and measured in public organizations, so there is the need for this research, which aims to investigate the effect of organizational learning its processes (knowledge acquisition, Information transfer, Interpreting the information, Organizational me
... Show MoreGiven a matrix, the Consecutive Ones Submatrix (C1S) problem which aims to find the permutation of columns that maximizes the number of columns having together only one block of consecutive ones in each row is considered here. A heuristic approach will be suggested to solve the problem. Also, the Consecutive Blocks Minimization (CBM) problem which is related to the consecutive ones submatrix will be considered. The new procedure is proposed to improve the column insertion approach. Then real world and random matrices from the set covering problem will be evaluated and computational results will be highlighted.
In this paper, we designed a new efficient stream cipher cryptosystem that depend on a chaotic map to encrypt (decrypt) different types of digital images. The designed encryption system passed all basic efficiency criteria (like Randomness, MSE, PSNR, Histogram Analysis, and Key Space) that were applied to the key extracted from the random generator as well as to the digital images after completing the encryption process.
The sending of information at the present time requires the speed and providing protection for it. So compression of the data is used in order to provide speed and encryption is used in order to provide protection. In this paper a proposed method is presented in order to provide compression and security for the secret information before sending it. The proposed method based on especial keys with MTF transform method to provide compression and based on RNA coding with MTF encoding method to provide security. The proposed method based on multi secret keys. Every key is designed in an especial way. The main reason in designing these keys in special way is to protect these keys from the predication of the unauthorized users.