The widespread use of the Internet of things (IoT) in different aspects of an individual’s life like banking, wireless intelligent devices and smartphones has led to new security and performance challenges under restricted resources. The Elliptic Curve Digital Signature Algorithm (ECDSA) is the most suitable choice for the environments due to the smaller size of the encryption key and changeable security related parameters. However, major performance metrics such as area, power, latency and throughput are still customisable and based on the design requirements of the device.

The present paper puts forward an enhancement for the throughput performance metric by p

     A binary stream cipher cryptosystem can be used to encrypt/decrypt many types of digital files, especially those can be considered huge data files like images. To guarantee that the encryption or decryption processes need a reasonable time to encrypt/decrypt the images, so we have to make the stream cipher key generator that acts quickly without effect in the complexity or randomness of the output key binary sequences. In this paper, we increase the size of the output sequence from binary to digital sequence in the field  to obtain byte sequence, then we test this new sequence not only as binary but also -sequence. So we have to test the new output sequence in the new mathematical field. This is done by changing the base of the

N-Benzylidene m-nitrobenzeneamines (Schiff bases) were prepared by condensation of m-nitroaniline with aromatic aldehydes. These Schiff bases were found to react with maleic anhydride to give 2-Aryl-3-(m-nitrophenyl)-2, 3-dihydro [1, 3] oxazepine–4, 7–diones and with phthalic anhydride to give 2-Aryl-3–(m-nitrophenyl)–2, 3–dihydrobenz|| 1, 2-e|||| 1, 3] oxazepine–4, 7-diones which were reacted with pyrrolidine to give the anilide–pyrrolidides of maleic acid and phthalic acid.

E-mail is an efficient and reliable data exchange service. Spams are undesired e-mail messages which are randomly sent in bulk usually for commercial aims. Obfuscated image spamming is one of the new tricks to bypass text-based and Optical Character Recognition (OCR)-based spam filters. Image spam detection based on image visual features has the advantage of efficiency in terms of reducing the computational cost and improving the performance. In this paper, an image spam detection schema is presented. Suitable image processing techniques were used to capture the image features that can differentiate spam images from non-spam ones. Weighted k-nearest neighbor, which is a simple, yet powerful, machine learning algorithm, was used as a clas

This research aims to give a splitting structure of the projective line over the finite field of order twenty-seven that can be found depending on the factors of the line order. Also, the line was partitioned by orbits using the companion matrix. Finally, we showed the number of projectively inequivalent -arcs on the conic  through the standard frame of the plane PG(1,27)

Let be a commutative ring with unity and let be a non-zero unitary module. In
this work we present a -small projective module concept as a generalization of small
projective. Also we generalize some properties of small epimorphism to δ-small
epimorphism. We also introduce the notation of δ-small hereditary modules and δ-small
projective covers.

Two unsupervised classifiers for optimum multithreshold are presented; fast Otsu and k-means. The unparametric methods produce an efficient procedure to separate the regions (classes) by select optimum levels, either on the gray levels of image histogram (as Otsu classifier), or on the gray levels of image intensities(as k-mean classifier), which are represent threshold values of the classes. In order to compare between the experimental results of these classifiers, the computation time is recorded and the needed iterations for k-means classifier to converge with optimum classes centers. The variation in the recorded computation time for k-means classifier is discussed.

  The purpose of this work is to determine the points and planes of 3-dimensional projective space PG(3,2) over Galois field GF(q), q=2,3 and 5 by designing a computer program.