Abstract Real-time applications such as streaming media and voice require encryption algorithms that do not propagate errors and support fast encryption on small blocks. Since IP packets are delivered out-of-order in routed networks it is difficult to synchronize the source and the destination, therefore requiring encryption algorithms to support out-of-order generation of key stream. In this p...

Through block cipher method, this paper demonstrates using preorder and post traversal sequence of a binary tree with 64 nodes to implement symmetric encryption/decryption. The different traversal sequences may determine a binary tree, so the method is vulnerable to be attacked. The paper’s further deduction involves improvement using multiple binary trees, so that more secure and efficient sym...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

We have proposed a novel way of symmetric encryption utilizing interleaving salting, Binary Tree traversal, and an Artificial Neural Network in sequential manner. presented the use as invertible(reversible) mathematical function so that decryption encrypted output may be possible. Knowledge pipeline, salt, neural network weights is required for decryption. As same set values decryption, our app...

Given the inorder and preorder traversal of a binary tree whose labels are all distinct, one can reconstruct the tree. This article examines two existing algorithms for rebuilding the tree in a functional framework, using existing theory on function inversion. We also present a new, although complicated, algorithm by trying another possibility not explored before.

The aim of this note is to generalize some recent results for binary trees by Panholzer and Prodinger [15] to a larger class of rooted trees. The number of descendants of a node j is the number of nodes in the subtree rooted at j, and the number of ascendants is the number of nodes between j and the root. Recently, Panholzer and Prodinger [15] studied the behavior of these parameters in binary ...

Testing and debugging a program P may require computing an input I such that the execution of P on input I goes through some given path T of P . We describe how to compute such an input for programs coded in a simple imperative language with generic expressions including user-defined abstract data types. For example, consider the following program which computes iteratively a preorder traversal...

It is well-known that, given inorder traversal along with one of the preorder or postorder traversals of a binary tree, the tree can be determined uniquely. Several algorithms have been proposed to reconstruct a binary tree from its inorder and preorder traversals. There is one study to reconstruct a binary tree from its inorder and postorder traversals, and this algorithm takes running time of...

Code generation aims to automatically generate a piece of code given an input natural language utterance. Currently, among dominant models, it is treated as sequence-to-tree task, where decoder outputs sequence actions corresponding the pre-order traversal Abstract Syntax Tree. However, such only exploits based preceding actions, which are insufficient ensure correct action predictions. In this...