Title |
HYBRID PUBLIC KEY ENCRYPTION SCHEME FOR NETWORKING |
| Adv Comput Res Vol:5 Iss:1 (2013-12-14) : 138-140 |
Authors |
ABOUD S.J. |
Published on |
14 Dec 2013 Pages : 138-140 Article Id : BIA0001811 Views : 1041 Downloads : 1265 |
|
Abstract |
Full Text |
PDF | XML |
PubMed XML |
CNKI |
Cited By |
Open Access |
In this paper, we analyze the Akleylek, et al. scheme and their try to enhance a security of peer-to-peer network by merging ElGamal scheme with knapsack system. We demonstrate that this combination disclose a security and causes a scheme weak to cipher-text only attack. So, in a network a hacker can use this attack and easily decrypt an encrypted message. Also, we illustrate that a receiver cannot recover an encrypted message in polynomial time. Thus, this scheme is entirely inappropriate to employ in the peer-to-peer networks. We will change this scheme to enhance security and efficiency.
|
|
Title |
DISCOVERY OF GOOD DOUBLE AND TRIPLE CIRCULANT CODES USING MULTIPLE IMPULSE METHOD |
| Adv Comput Res Vol:5 Iss:1 (2013-12-20) : 141-148 |
Authors |
ASKALI M., NOUH S., AZOUAOUI A., BELKASMI M. |
Published on |
20 Dec 2013 Pages : 141-148 Article Id : BIA0001862 Views : 1025 Downloads : 1365 |
|
Abstract |
Full Text |
PDF | XML |
PubMed XML |
CNKI |
Cited By |
Open Access |
The construction of optimal linear block error-correcting codes is not an easy problem, for this, many studies describe methods for generating good error correcting codes in terms of minimum distance. In a previous work, we have presented the multiple impulse method (MIM) to evaluate the minimum distance of linear codes. In this paper we will present an optimization of the MIM method by genetic algorithms, and we found many new optimal Double and Triple Circulant Codes (DCC & TCC) with the highest known parameters using the MIM method as an evaluator of the minimum distance. Two approaches are used in the exploration of the space of generators; the first is based on genetic algorithms, however the second is on the random search algorithm.
|
|
Title |
FRACTAL TEXTURE: A SURVEY |
| Adv Comput Res Vol:5 Iss:1 (2013-12-25) : 149-152 |
Authors |
RANI M., AGGARWAL S. |
Published on |
25 Dec 2013 Pages : 149-152 Article Id : BIA0001896 Views : 1023 Downloads : 1119 |
|
Abstract |
Full Text |
PDF | XML |
PubMed XML |
CNKI |
Cited By |
Open Access |
The places where you can find fractals include almost every part of the universe, from bacteria cultures to galaxies to your body. Many natural surfaces have a statistical quality of roughness and self-similarity at different scales. Mandelbrot proposed fractal geometry and is the first one to notice its existence in the natural world. Fractals have become popular recently in computer graphics for generating realistic looking textured images. This paper presents a brief introduction to fractals along with its main features and generation techniques. The concentration is on the fractal texture and the measures to express the texture of fractals.
|
|
Title |
A NOVEL ALGORITHM FOR EFFICIENT MEMORY MANAGEMENT WITH PARALLEL COPROCESSOR FOR GARBAGE COLLECTION |
| Adv Comput Res Vol:5 Iss:1 (2013-12-31) : 153-156 |
Authors |
KAPADIA V.V., THAKKER V.K. |
Published on |
31 Dec 2013 Pages : 153-156 Article Id : BIA0001942 Views : 941 Downloads : 1085 |
|
Abstract |
Full Text |
PDF | XML |
PubMed XML |
CNKI |
Cited By |
Open Access |
Memory management on which researchers are mainly focusing are the different techniques related to memory management i.e. garbage collection techniques, scheduling, real time system, user oriented design and many more. The major problem found out in memory management is processor and operating system delays. Here a new design of processor is discussed in the paper that will improve to the over all system performance.
|