Due to internet expansion web applications have now become a part of everyday life. As a result a number of incidents which exploit web application vulnerabilities are increasing. A large number of these incidents are SQL Injection attacks which are a serious security threat to databases which contain sensitive information, the leakage of which cause a large amount of loss. SQL Injection Attacks occur when an intruder changes the query structure by inserting any malicious input. There are a number of methods available to detect and prevent SQL Injection Attacks. But these are too complex to use. This paper proposes a very simple, effective and time saving technique to detect SQLIAs which uses combined static and dynamic analysis and also defines an attack other than existing classification of SQLIAs.

This paper presents, a low power 128-bit Advanced Encryption Standard (AES) algorithm based on a novel asynchronous self-timed architecture for encryption of audio signals. An asynchronous system is defined as one where the transfers of information between combinatorial blocks without a global clock signal. The self-timed architectures are asynchronous circuits which perform their function based on local synchronization signals called hand shake, independently from the other modules. This new architecture reduced spikes on current consumption and only parts with valid data are working, and also this design does not need any clock pulse. A combinational logic based Rijndael S-Box implementation for the Substitution Byte transformation in AES is proposed, its low area occupancy and high throughput therefore proposed digital design leads to reduction in power consumption. Mix-columns transformation is implemented only based on multiply-by-2 and multiply-by-3 modules with combinational logic. The proposed novel asynchronous self-timed AES algorithm is modeled and verified using FPGA and simulation results from encryption of sound signals is presented, until original characteristics are preserved anymore and have been successfully synthesized and implemented using Xilinx ISE V7.1 and Virtex IV FPGA to target device Xc4vf100. The achieved power consumption is 283 mW in clock frequency of 100 MHz.

Today, there are known the basic principles of decision-making on the safety control of distributed computer systems in the face of uncertainty and risk. However, in this area there are no practical methods for the quantitative risk analysis and assessment, taking into account the dynamic changes of security threats, which is typical for distributed computer systems.
In this paper is suggested an approach to assesment and minimization of the security risks, which allows to reduce the potential losses due to the realization of threats, to analyze the dynamics of intrusions into computer systems and to select the effective security tools.
As a result, there is designed the structure of the tools for risk minimization in the distributed computer systems and are formalized the main functions of this structure. Also, in the paper is suggested the assessment of risk factors of the security threats and the probability of the threats realization, which are based on their division into appropriate groups. The proposed tools for security risk minimization allow effectively identify, classify and analyze threats to the security of the distributed computing systems.

Defending against virus attacks in network is a vital part of network security. With the rapid evolution of viruses, its defense mechanism has also been evolved over the years. But given the diversity and complexity of virus propagation and its attack behavior, no defense mechanism is equipped fully to protect the network from such attacks. Several antiviruses are available in the market. But none can give full proof solution to malicious attacks in communication networks. In this paper we present a mechanism to measure and compare the relative ability of antivirus against various kinds of viruses. We construct a hierarchical structure for different virus defense mechanism. Using Analytical Hierarchy Process (AHP) we construct a pair wise comparison matrix and find the value of corresponding Eigen vectors; we then apply the theory of AHP to calculate weight of each defense index. We validated our technique with an example. Our method can provide a strong reference to design an optimal network security solution.

The basic idea of scrambling is to change the image pixel positions through matrix transform to achieve the visual effect of disorder. Cellular automata can be successfully applied for this purpose. This paper presents digital image scrambling based on two dimensional cellular automata. The proposed scheme is shown high quality of confusion in a few evolution steps. When the original image is compared with the descrambled image by human visual system, it is not recognizable which one is descrambled image and which one is the original image. The paper is organised as follows: first the concept of cellular automata is introduced, and then accordingly the game of life rules and the proposed model followed by the experimental results with discussions.

Voting is regarded as one of the most effective methods for individuals to express their opinions to select their democratic leader in the public elections. As the computing, communicating, and cryptographic techniques progress rapidly, increasing emphasis has been placed on developing electronic voting schemes capable of providing more efficient voting services than conventional paper-based voting methods. A receipt-free e-voting scheme based on the virtual voting booth that can be implemented with a smart card. Receipt-freeness is achieved by distributing the voting procedure between the voter and the smart card. By using smart cards to randomize part of content of the ballot, the voter cannot construct a receipt. The voter and the smart card jointly contribute randomness for the encryption of the ballot. To provide convenience to voters, sufficient voting facilities are supplied in sufficient public voting booths.

This paper describes the performance of one-bit hard combination scheme of cooperative spectrum sensing for different number of cognitive radio users. We evaluate cooperative spectrum sensing by simulating OR rule as a hard combination data fusion rule. Energy detector is used to observe the presence of primary user (PU) signal. It improves the probability of detection by collaborating to detect PUs signal in cognitive radio (CR) system. Simulation result shows that the probability of missed detection is decreasing for both conventional hard combination and 1-bit hard combination scheme with OR rule correspondingly with increasing the probability of false alarm. It is shown that 1-bit scheme has much better performance than the conventional hard combination scheme. This is also shown that the probability of missed detection is decreased even though CR user is increased. Here missed detection probability is decreased when the number of user increases.

In simple wavelength-division multiplexed (WDM) networks, a connection must be established along a route using a common wavelength on all of the links along the route. The introduction of wavelength converters into WDM cross connects increases the hardware cost and complexity. Given a set of connection requests, the routing and wavelength assignment problem involves finding a route (routing) and assigning a wavelength to each request. This paper has presented the WDM technology is being extensively deployed on point to point links within transport networks in the EGYPT. However, WDM promises advantages for switching and routing as well as for transmission. Optical cross connects are currently being developed which can switch an entire wavelength from an input fiber to an output fiber so that large bandwidth circuits can be routed through the network according to wavelength. High speed, fixed bandwidth, end to end connections called lightpaths can then be established between different nodes. Our suggested Trans-Egypt Network (TEGYNET) which uses optical cross connects to route lightpaths through the network are referred to as wavelength routing networks. The average setup time, average link utilization, traffic load, blocking probability, and achievable link utilization in the presence of both single path and multi math routing are the major interesting parameters in the design of TEGYNET topology.