PL EN


Preferencje help
Widoczny [Schowaj] Abstrakt
Liczba wyników
Tytuł artykułu

On Some Crypto-messages Parser

Wybrane pełne teksty z tego czasopisma
Identyfikatory
Warianty tytułu
Języki publikacji
EN
Abstrakty
EN
Some methods of automatic verification of cryptographic protocols require creating specially designed formal languages based on suitable algebra of terms (called crypto-terms or crypto-messages). Sometimes in verification process it is essential to check whether a given crypto-term is a sub term of another one or in general whether some crypto-term belongs to the specified crypto-Language (a set of some crypto-terms) or not. Another problem is creating the set of all ant chains of subterms of a given term wit h respect to the order introduced by a subterm relation. The main goal of this paper is to present a tool for verification whether crypto-term belongs to the specified crypto-language or not. Our main purpose is to check lexical analysis and syntax analysis. Finally, after checking that a crypto-sentence is correct, we convert it into the special format, purpose was to check lexical analysis and syntax analysis. For our investigation Flex and Bison - the well known grammar tools – have been used. We believe that our tool will be usefull in research on the topic of symbolic verification of cryptographic protocols.
Twórcy
autor
  • Institute of Mathematics and Computer Science Jan Długosz University of Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland
autor
  • Institute of Mathematics and Computer Science Jan Długosz University of Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland
  • Institute of Mathematics and Computer Science Jan Długosz University of Częstochowa al. Armii Krajowej 13/15, 42-200 Częstochowa, Poland
Bibliografia
  • [1] M. Kurkowski. Dedukcyjne metody weryfikacji poprawności protokołów uwierzytelniania) Deduction methods oj verification of authentication protocols. PhD dissertation, Institute of Computer Science of The Polish Academy of Sciences, Warsaw, Poland 2003.
  • [2] M. Kurkowski, W. Penczek. Verifying cryptographic protocols modeled by networks of automata. In: Proceedings of XV CS&P (Concurrency, Specification and Programming), Humboldt University Press, Berlin, pp. 292-303, 2006
Typ dokumentu
Bibliografia
Identyfikator YADDA
bwmeta1.element.baztech-4082b0bf-6190-49e6-bd4f-ef2dac575ec5
JavaScript jest wyłączony w Twojej przeglądarce internetowej. Włącz go, a następnie odśwież stronę, aby móc w pełni z niej korzystać.