Military Communications and Information Technology: A Trusted ...
Share Embed Flag
Download ePaper

Military Communications and Information Technology: A Trusted ...

Military Communications and Information Technology: A Trusted ... Military Communications and Information Technology: A Trusted ...

wil.waw.pl
22.01.2015 Views

472 Military Communications and Information Technology... Diagram 1. Average time of non-linear register and 10 prime numbers generation Diagram 2. Generation time for a set of 10 devices, 100 keys each and encryption of 10 files with pseudo-random numbers, 10 KB each The performance metric of generating large prime numbers necessary for the proper operations of public key systems is presented on Diagram 1. The efficiency of prime numbers generation depends on the number of generation threads. The best results were achieved with four generation threads. The generation of prime numbers is a complex process in terms of calculation and does not require using disk resources. Therefore, it can perfectly enable increasing the number of generated numbers while increasing the number of threads. Symmetric keys are necessary for the operations of block ciphers. The generation of symmetric keys is not a complicated process in terms of calculation because they constitute random sequences. However, in the process of keys generation, their integrity should be secured by calculating the abbreviation and ensuring confidentiality through encryption. Once generated and secured, the keys are saved to the stand disk. The generation of symmetrical keys is not as susceptible to turning parallel as the disk generation, although their generation efficiency may

Chapter 4: Information Assurance & Cyber Defence 473 be increased twofold. The time of data generation using a single thread amounts to ca. 1.5 minutes, whereas the average time of a set generation using 2 threads is reduced by half. Afterwards, the encryption performance and shortening of files containing sequences of pseudo-random numbers was tested. In the encryption time, the files are saved in blocks of a few hundred bytes on the disk. As the main problem consists in the saving time of a large number of short blocks to a disk, the increase in the generation threads number does not improve the generation station performance. VI. Conclusions Although the test comprised merely a few performance metrics, it was sufficient to confirm that the processes complicated in terms of calculation are prone to turning parallel and improving the generation time. Poorer results were obtained for operations that required saving of large amount of data to a disk. It seems that it will be possible to eliminate the restriction through the use of its buffering in the operational memory. The CDGC stand was installed on a multi-core computer using the parallel cryptographic material generation method. This solution is well suited to be used in cryptographic data generation systems for the currently operated and future communication networks. This will allow for increasing their performance several times. At the same time, this method will not deteriorate the security of the generated data, what is more, it will improve it by being able to perform additional procedures to verify this data, e.g. constant testing of the random sequence quality derived from the random generator. References [1] J. Kirk, Estonia recovers from Massie denial of service attack, IDG News Service, Inforworld, http://www.infoworld.com/article/07/05/17/estonia-denial-of-serviceattack_1.html, May 17, 2007. [2] C. Wilson, Computer Attack and Cyberterrorism: Vulnerabilities and Policy Issues for Congress, CRS Report RL32114, Updated April 1, 2005, p. 18. [3] N. Granado, G. White, Cyber security and government fusion center, Center for Infrastructure Assurance and Security, The University of Texas at San Antonio, 41st International Conference on System Science, Hawaii 2008. [4] October Cyberattacks on Poland, www.rp.pl/artykul/2,375962_Cyberatak_ na_Polske. html, 2009. [5] A.J. Menezes, P.C. van Oorschot, S.A. Vanstone, Applied cryptography, WNT 2005.

472 <strong>Military</strong> <strong>Communications</strong> <strong>and</strong> <strong>Information</strong> <strong>Technology</strong>...<br />

Diagram 1. Average time of non-linear register <strong>and</strong> 10 prime numbers generation<br />

Diagram 2. Generation time for a set of 10 devices, 100 keys each <strong>and</strong> encryption<br />

of 10 files with pseudo-r<strong>and</strong>om numbers, 10 KB each<br />

The performance metric of generating large prime numbers necessary for<br />

the proper operations of public key systems is presented on Diagram 1. The efficiency<br />

of prime numbers generation depends on the number of generation threads.<br />

The best results were achieved with four generation threads. The generation of prime<br />

numbers is a complex process in terms of calculation <strong>and</strong> does not require using<br />

disk resources. Therefore, it can perfectly enable increasing the number of generated<br />

numbers while increasing the number of threads.<br />

Symmetric keys are necessary for the operations of block ciphers. The generation<br />

of symmetric keys is not a complicated process in terms of calculation because<br />

they constitute r<strong>and</strong>om sequences. However, in the process of keys generation,<br />

their integrity should be secured by calculating the abbreviation <strong>and</strong> ensuring<br />

confidentiality through encryption. Once generated <strong>and</strong> secured, the keys are<br />

saved to the st<strong>and</strong> disk. The generation of symmetrical keys is not as susceptible<br />

to turning parallel as the disk generation, although their generation efficiency may

logo

products

Resources

Company

Terms of service
Privacy policy
Cookie policy
Cookie settings
Imprint
Change language
Made with love in Switzerland
© 2024 Yumpu.com all rights reserved

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!