scholarly journals PDA Language for Dynamic Analysis of Cryptographic Protocols

2020 ◽  
pp. 19-29
Author(s):  
Liudmila Babenko ◽  
◽  
Ilya Pisarev ◽  

Purpose of the article: development of an algorithm for dynamic analysis of the source codes of cryptographic protocols using the PDA language for the possibility of using your own attack models. Method: a source code generation method was used to simulate the attacker’s side when transmitting messages between legal parties according to the Dolev-Yao model. The method of false termination is also used, which is used in dynamic analysis and allows detecting attacks during simulation. Results: this paper presents the PDA language for dynamic analysis of the source codes of cryptographic protocols. An approach to dynamic analysis based on the principle of false termination is described. The process of modeling an active attack by an intruder is presented. The elements of the PDA language are described and an example of the description of the test protocol in this language is given. A test protocol in the C# programming language has been implemented. The effectiveness of the dynamic analysis was tested by simulating a replay attack. The security verification of the test cryptographic protocol was carried out using the well-known verification tools Scyther and Avispa. The comparison of the main indicators of the known means and the dynamic protocol analyzer proposed by the authors is carried out. The main advantages of the approach proposed by the authors are presented. The further direction of work is described.

Author(s):  
Ashish Joshi ◽  
Amar Kumar Mohapatra

Background & Objective: Cryptographic protocols had been evident method for ensuring con dentiality, Integrity and authentication in various digital communication systems. However the validation and analysis of such cryptographic protocols was limited to usage of formal mathematical models until few years back. Methods: In this paper, various popular cryptographic protocols have been studied. Some of these protocols (PAP, CHAP, and EAP) achieve security goals in peer to peer communication while others (RADIUS, DIAMETER and Kerberos) can work in multiparty environment. These protocols were validated and analysed over two popular security validation and analysis tools AVISPA and Scyther. The protocols were written according to their documentation using the HLPSL and SPDL for analysis over AVISPA and Scyther respectively. The results of these tools were analysed to nd the possible attack an each protocol. Afterwards The execution time analysis of the protocols were done by repeating the experiment for multiple iterations over the command line versions of these tools.As the literature review suggested, this research also validates that using password based protocols (PAP) is faster in terms of execution time as compared to other methods, Usage of nonces tackles the replay attack and DIAMETER is secure than RADIUS. Results and Conclusion: The results also showed us that DIAMETER is faster than RADIUS. Though Kerberos protocol was found to safe, the results tell us that it is compromisable under particular circumstances.


2021 ◽  
Vol 2 ◽  
pp. 52-62
Author(s):  
Igor Košťál ◽  
Martin Mišút

Almost every Android user application has some kind of user interface. Android programmers who create Xamarin.Forms applications and who uses the Microsoft Visual Studio development environment to do so can create user interfaces in the XAML (the Extensible Application Markup Language) or in the C# programming language. This paper deals with a comparison of creating this user interface by the first and the second way. We demonstrate the differences in the creation of Android application user interfaces in XAML and in C# by way of using two of our Android applications which were created by the Microsoft Visual Studio 2019 Enterprise, which work as text editors with the ability to store text to disc, and have user interfaces that are visually identical. However, the user interface of the first Android application was created in XAML with a C# support code, whereas the user interface of the second Android application was created entirely in C#. While comparing the source codes of the user interfaces of both these Android applications, we identify the advantages and disadvantages of both approaches to creating a user interface and we try to find out which of these approaches is better for maintaining and modifying user interfaces. In this study, we also contrast the processes of handling events of controls of a user interface created in the XAML code for the first Android application as well as that of the same user interface created in the C# code for the second Android application. Furthermore, we were interested in determining whether the different ways of creating user interfaces affected the execution time of basic operations that included disc files that were performed on the same data by both the applications. We assume that it does not fundamentally affect the execution time, and so, we performed an experiment to confirm or refute our assumption.


Author(s):  
E.A. Perevyshina ◽  
L.K. Babenko

To assess the quality and security of cryptographic protocols, we use various formal verification tools, such as Scyther tool, Avispa, ProVerif. these formal verifiers can check the protocol for vulnerability to attacks on secrecy and authentication, as these are the most prevalent attacks on protocols. However, this is not enough to fully analyze the security of the protocol. In this article, we will use linear temporal logic (LTL) model checking with SPIN. This tool, unlike the formal verifiers listed above, is not designed for a specific application in the context of cryptographic protocols; however, it has a very wide range of possibilities. In particular, for each security property, it is possible to describe the behavior of an attacker and test for the stability of the protocol model to its various attacks. The purpose of this work is to describe the developed methodology for verifying the security of authentication properties using the SPIN verifier.


Author(s):  
Fauziah Fauziah ◽  
Andez Apriansyah ◽  
Tri Ichsan Saputra ◽  
Yunan Fauzi Wijaya

In compilation techniques, the processes and stages carried out relate to translating source languages into target languages (object programs). Source languages are high-level programming languages that are easy to understand and easy to learn by humans, while target languages are low-level languages that are only understood by machines. In this study a compiler machine called Automatic LESSIMIC Analyzer is used which can be used to analyze, including lexical, syntactic, and semantic analysis. Compiler machines that are designed can also synthesize intermediate code, using assembler codes. The compiler engine will produce an analysis of the program code that the user enters in the form of an error message, if the program code is not in accordance with the grammar that applies generally in programming languages. In this research, the simple program code that is inputted is C ++ programming language, and successfully analyzes the lexical, semantic, syntactic, intermediate code generation and successfully detects errors from the program code entered with a success rate of 99%.


10.14311/1440 ◽  
2011 ◽  
Vol 51 (5) ◽  
Author(s):  
R. Krejčí

This paper deals with the “phpHMM” software tool, which facilitates the development and optimisation of speech recognition algorithms. This tool is being developed in the Speech Processing Group at the Department of Circuit Theory, CTU in Prague, and it is used to generate the source code of a speech recogniser by means of the PHP scripting language and the MySQL database. The input of the system is a model of speech in a standard HTK format and a list of words to be recognised. The output consists of the source codes and data structures in C programming language, which are then compiled into an executable program. This tool is operated via a web interface.


2018 ◽  
Vol 12 (1) ◽  
pp. 27-33
Author(s):  
Mümine Kaya Keles ◽  
Abdullah Emre Keles

The concept of distance education systems is a concept that applies to all levels of education, including universities. The use of distance education systems has increased considerably in universities today. M any faculties in many universities use distance education systems for their courses. The purpose of this paper is to design and develop a system that can be used to upload lecture notes and assignments online via the Internet, to do online exams, to provide a compilation control of all the assignments written, especially in the C programming language, by instructors who are primarily in the Engineering Department, then all instructors in the universities using the Moodle platform. Moreover, the aim of this paper is to design and develop a system in which the students primarily in the Engineering Department using the Moodle platform and then students in all the universities can follow the course contents, upload the assignments, and discuss their questions about the course with their instructors and their friends. As a result of this paper, a scheme is provided to easily compile, run and grade the programming assignments (source codes) given in the Programming courses using the Moodle website collected in a single place.


Author(s):  
N. O. Dorodnykh ◽  
O. A. Nikolaychuk ◽  
A. Yu. Yurin

The paper is devoted to fuzzy knowledge base engineering problem. The effectiveness of this process can be improved by automated generation of source codes and analysis of data presented in different forms, in particular, in the form of conceptual models describing a certain subject domain. The knowledge base code generation is based on the transformation of conceptual models from the model-based approach and the use of metamodels. The metamodeling provides the description of the source and target formalisms of conceptual modeling and knowledge representation. We present an approach for fuzzy knowledge base engineering based on model transformations. In particular, metamodels for describing fuzzy rule-based models and fuzzy ontologies and method for automated metamodel generation are presented.


10.12737/3574 ◽  
2014 ◽  
Vol 2 (3) ◽  
pp. 16-26 ◽  
Author(s):  
Дмитриев ◽  
Vladislav Dmitriev

Both at school and at higher educational institutions the priority generally is given to standard mathematical problems, which in most cases seem to have quite evident solutions. However some of these problems can be solved in more optimal ways, which are often not been found at all. Based on a range of examples the paper considers how to seek and apply efficient algorithms when solving a specific class of problems in the course of programming teaching. The algorithm efficiency is meant that the program (as far as the current problem specifications require) meets requirements of minimal memory use and certain speed of algorithms. The author has successfully used the problems discussed in the paper for running the distant programming competition among students of physical-mathematical and engineering profiles. Source codes for the programs discussed are indicated in terms of C++ programming language.


Sign in / Sign up

Export Citation Format

Share Document