Building Intrusion Tolerant Software System

In this paper, we describe and analyze the hypothesis about intrusiontolerance software system, so that it can provide an intended server capability and deal with theimpacts caused by the intruder exploiting the inherent security vulnerabilities. Wepresent someintrusion tolerance technology by exploiting N-version module threshold method in constructingmultilevel secure software architecture, by detecting with hash value, by placing an 'antigen' wordnext to the return address on the stack thatis similar to human immune system, and by adding 'Honeycode' nonfunctional code to disturb intruder, so that the security and the availability of thesoftware system are ensured.

An FPGA Implementation of GF(p) Elliptic Curve Cryptographic Coprocessor

A GF(p) elliptic curve cryptographic coprocessor is proposed and implemented on Field Programmable Gate Array (FPGA). The focus of the coprocessor is on the most critical, complicated and time-consuming point multiplications. The technique of coordinates conversion and fast multiplication algorithm of two large integers are utilized to avoid frequent inversions and to accelerate the field multiplications used in point multiplications. The characteristic of hardware parallelism is considered in the implementation of point multiplications. The coprocessor implemented on XILINX XC2V3000 computes a point multiplication for an arbitrary point on a curve defined over GF(2192?264?1) with the frequency of 10 MHz in 4.40 ms in the average case and 5.74 ms in the worst case. At the same circumstance, the coprocessor implemented on XILINX XC2V4000 takes 2.2 ms in the average case and 2.88 ms in the worst case.

Model Checking Electronic CommerceSecurity Protocols Based on CTL

We present a model based on Computational Temporal Logic (CTL) methods forverifying security requirements of electronic commerce, protocols. The model describes formally theauthentication, confidentiality integrity, non-repudiation) denial of serviee and access control ofthe e-lectronic commerce protocols. We illustrate as case study a variant of the Lu-Smolka protocolproposed by Lu-Smolka Moreover, we have discovered two attacks that allow a dishonest user topurchase a good debiting the amountto another user. And also, we compared our work with relativeresearch works and found lhat the formal way of this paper is more general to specify securityprotocols for E-Commerce.

An Improved Non-Repudiation Protocol and Its Security Analysis

This paper proposes an improved non-repudiation protocol after pointing out two attacks on an existing non-repudiation protocol. To analyze the improved protocol, it also proposes an extension of Kailar logic. Using the extended Kailar logic, the security analysis of the improved prototocol has been presented. Key words non-repudiation protocol - extended Kailar logic - converse assumption procedure CLC number TP 393. 08 Foundation item: Supported by the National Natural Science Foundation of China (90104005) and the Doctoral Science Foundation of Ministry of Education (20020486046)Biography: Li Li(1976-), female, Ph. D candidate, research direction: network security and formal analysis of security protocol.

Wavelet-Based Denoising Attack on Image Watermarking

In this paper, we propose wavelet-based denois-ing attack methods on imagewatermarking in discrete cosine transform (DCT) or discrete Fourier transform (DFT) domain ordiscrete wavelet transform (DWT) domain Wiener filtering based on wavelet transform is performed inapproximation subband to remove DCI or DFT domain watermark, and adaptive wavelet soft thresholdingis employed to remove the watermark resided in detail subbands of DWT domain.

Trace Representations of S-boxes and Their Application

In the paper, we use trace representations of Boolean functions to obtain that a class mappings including functionsF(x)=x d over field GF(2 n ), withW(d)=n?1, have desirable cryptographic properties. Therefore we generalize an important result of Nyberg. As application, we use these conclusions to analyze cryptographic property of the S-box of AES (the Advanced Encryption Standard) and give its several equivalent representations, proving that the composition of inversion function of AES and any invertible affine transformations is impossible to satisfy strict avalanche criterion, any order propagation criteria and any order correlation immunity. Key words trace function - nonlinearity - differentially uniform - strict avalanche criterion CLC number TP 309 Foundation item: Supported by the National Natural Science Foundation of China (60373089, 60373041), Natural Science Foundation of Hubei Province (2002AB0037) and Chen-guang Plan of Wuhan City (20025001007).Biography: Zeng Xiang-yong (1973-), male, A postdoctoral fellow, research direction: cryptology and the representation theory of algebra.

Evolutionary Design of Boolean Functions

We use evolutionaly computing to synthesize Boolean functions randomly Byusing specific crossover and mutation operator, in evolving process and modifying search space andfitness function, we get some high non-linearity functions which have other good cryptographycharacteristics such as autocorrelation etc Comparing to other heuristic search techniques,evolutionary computing approach is more effective because of global search strategy and implicitparallelism.

A Proof for the Nonexistence of Some Homogeneous Bent Functions

By the relationship between the first linear spectra of a function at partialpoints and the Hamming weights of the sub-functions, and by the Hamming weight of homogenousBoolean function, it is proved that there exist no homogeneous bent functions ofdegree in in n = 2mvariables for m >3.