a pedestrian is every person who is walking, especially along or the width of a street or other place used by cars. growth, development and industrialization of societies, threatens the safety of pedestrians. increase and acceleration of vehicles and traffic, lack of road and street standards, weakness of laws or inappropriate executive guarantees, causing to insecurity and incidence of physica...

Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build a UOWHF which compresses by "n bits, at the cost of "n invocations of the one-way permutation. We show that this construction is not far from optimal, in the following sense: there exists an oracle relative to which t...

M. S. Tame,1, 2, ∗ B. A. Bell,3 C. Di Franco,4 W. J. Wadsworth,5 and J. G. Rarity3 1University of KwaZulu-Natal, School of Chemistry and Physics, 4001 Durban, South Africa 2National Institute for Theoretical Physics, University of KwaZulu-Natal,Durban 4001, South Africa 3Photonics Group, Department of Electrical and Electronic Engineering, University of Bristol, Merchant Venturers Building, Woo...

This paper presents the Generalized Randomized Iterate of a (regular) one-way function f and show that it can be used to build Universal One-Way Hash Function (UOWHF) families with O(n) key length. We then show that Shoup’s technique for UOWHF domain extension can be used to improve the efficiency of the previous construction. We present the Reusable Generalized Randomized Iterate which consist...

Present day's efforts for building up an operative quantum computer soon will take shape. One of the main challenges to this task is to implement qubit coherence in a practical way. We make emphasis on the structure of the nuclear qubits in a one-way quantum computer as a source of coherence enhancement. The form factor, accounting for the nuclear qubit structure of the model, is the magnetogyr...

We examine the conjecture that no polynomial can upper bound the increase in the number of states when a one-way nondeterministic finite automaton (1nfa) is converted into an equivalent two-way deterministic finite automaton (2dfa). We study the problem of liveness, which admits 1nfas of polynomial size and is known to defy 2dfas of polynomial size if and only if the conjecture is true. We focu...

We describe three regular expression-based methods to characterize as a regular language the language defined by a two-way automaton. The construction methods yield relatively simple techniques to directly construct one-way automata that simulate the behavior of two-way automata. The approaches also offer conceptually uncomplicated alternative equivalence proofs of two-way automata and one-way ...