scholarly journals DSA with SHA-1 for Space Telecommand Authentication: Analysis and Results

2009 ◽  
Vol 5 (1) ◽  
pp. 26
Author(s):  
Susanna Spinsante ◽  
Ennio Gambi

The issue of securing Telecommand data communications in civil and commercial space missions, by means of properly located security services and primitives, has been debated within the Security Working Group of the ConsultativeCommittee for Space Data Systems since several months. In the context of Telecommand transmissions, that can be vital in determining a successful operational behavior of a space system, the interest is mainly focused on authentication, more than encryption. The object of this paper is to investigate, under the perspective of computational overhead, the possible applicability of a standard scheme, Digital Signature Algorithm with SHA-1, to the authentication of Telecommand data structures, andto discuss the pros and cons related to its adoption in such a peculiar context, through numerical simulations and comparison with an alternative solution relying on the widely used MD5 hash algorithm.

2013 ◽  
Vol 427-429 ◽  
pp. 806-809 ◽  
Author(s):  
Lei Wang ◽  
Yan Yan Yu ◽  
Qian Huang ◽  
Jun Yang ◽  
Zheng Peng Zhao

This paper introduces the principle of digital signature algorithm MD5, focused on the calculation phase of the algorithm, the algorithm structure iteration of the loop, and to optimize its calculation phase, and given FPGA design icon, the experiment can be drawn based on FPGA with less resource, fast implementation of the MD5 algorithm. The hardware implementation of the MD5 hash algorithm HMACs build encryption accelerator which has some practical value.


Author(s):  
Muhammad Asghar Nazal ◽  
Reza Pulungan ◽  
Mardhani Riasetiawan

Data security is a very important compilation using cloud computing; one of the research that is running and using cloud technology as a means of storage is G-Connect. One of the developments made by the G-Connect project is about data security; most of the problems verification of the data sent. In previous studies, Keccak and RSA algorithms have implemented for data verification needs. But after a literature study of other algorithms that can make digital signatures, we found what is meant by an algorithm that is better than RSA in rectangular speeds, namely Digital Signature Algorithm (DSA).DSA is one of the key algorithms used for digital signatures, but because DSA still uses Secure Hash Algorithm (SHA-1) as an algorithm for hashes, DSA rarely used for data security purposes, so Keccak is used instead of the hash algorithm on DSA. Now, Keccak become the standard for the new SHA-3 hash function algorithm. Because of the above problems, the focus of this research is about data verification using Keccak and DSA. The results of the research are proven that Keccak can run on DSA work system, obtained a comparison of execution time process between DSA and RSA where both use Keccak.


Author(s):  
О.С. Циганенко

The development of computing resources in the post-quantum period calls into question the provision of the required level of stability of symmetric and asymmetric cryptography algorithms. The advent of a full-scale quantum computer based on the Shore and Grover algorithms greatly increases the capabilities of cybercriminals and reduces the resilience of cryptosystems used in protocols for basic security services. The article analyzes the main requirements for resistance to post-quantum cryptography algorithms. In such conditions, it is necessary to use modified cryptosystems that provide an integrated required level of stability and efficiency of cryptocurrencies. One such mechanism is the crypto-code constructs of McEliece and Niederriter, which provide the required indicators of durability, efficiency and reliability. The paper analyzes the construction of the crypto-code structure of the Niederriter on elliptical (EC), modified elliptical codes (MEC) shortened and / or extended, and defective codes, practical algorithms for their implementation. An advanced protocol for the formation of a digital signature using Niederriter crypto-code constructions is proposed.


Sign in / Sign up

Export Citation Format

Share Document