BUKU ABSTRAK - Universiti Putra Malaysia

Science, Technology & Engineering
New Evaluation Tool for Block Ciphers Symmetric Cryptosystems (NET-BC)
Assoc. Prof. Dr. Mohamad Rushdan Md. Said
Davood Rezaeipour, Kamel Ariffin Mohd. Atan and Mohamed Othman
Institute of Mathematical Research, University Putra Malaysia,
43400 UPM Serdang, Selangor, Malaysia.
+603-8946 6841; mrushdan@putra.upm.edu.my
We design a software program known as the “New Evaluation Tool for Block Ciphers Symmetric
Cryptosystems (NET-BC)” with the use of certain source codes. The Literary Work is a software program
designed for the following functions: analysing cryptographic algorithms, performing security evaluation on
the different classes of block ciphers, detecting vulnerability points in block ciphers, performing the three (3)
important properties in Cryptography, namely, Completeness; Avalanche and Static Information Leakage.
Keywords: Block ciphers, symmetric cryptosystems, cryptographic algorithms, security evaluation
Petri Net Controlled Grammars with a Bounded Number of Additional Places
Assoc. Prof. Dr. Mohd. Hasan Selamat
Sherzod Turaev
Faculty of Computer Science and Information Technology, University Putra Malaysia,
43400 UPM Serdang, Selangor, Malaysia.
+603-8946 6517; hasan@fsktm.upm.edu.my
A context-free grammar and its derivations can be described by a Petri net, called a context-free Petri net,
whose places and transitions correspond to the nonterminal symbols and the production rules of the grammar,
respectively, and tokens are separate instances of the nonterminal symbols in a sentential form. Therefore, the
control of the derivations in a context-free grammar can be implemented by adding some features to the associated
cf Petri net. The addition of new places and new arcs from/to these new places to/from transitions of the net leads
grammars controlled by k-Petri nets, i.e., Petri nets with additional k places. In the paper, we investigate the
generative power and give closure properties of the families of languages generated by such Petri net controlled
grammars, in particular, we show that these families form an infinite hierarchy with respect to the numbers of
additional places.
Keywords: Grammars, grammars with regulated rewriting, petri nets, petri net controlled grammars
254