This paper describes an attack on an identification scheme based on the permuted perceptron problem (PPP) as suggested by Pointcheval. The attack finds the secret key, a vector of n binary elements, in time much faster than estimated by its designer. The basic idea in the attack is to use several applications of a simulated annealing algorithm and combine the outcomes into an improved search. I...

This paper introduces a simple but effective scattering mechanism identification scheme for analyzing mixed scattering mechanisms obtained by model-based decomposition. Using the normalized scattering vector, each pixel is represented by a point in a standard 2-simplex in R. Seven scattering category centers are represented by the three vertices, the three midpoints of sides and the centroid of...

Blind system identification is known to be an ill-posed problem and without further assumptions, no unique solution is at hand. In this contribution, we are concerned with the task of identifying an ARX model from only output measurements. We phrase this as a constrained rank minimization problem and present a relaxed convex formulation to approximate its solution. To make the problem well pose...

We present a new blur identification procedure based on a hybrid, two-level evolutionary-deterministic scheme which allows dynamic optimization of the size and the pattern of the support of the point spread function. We demonstrate that the proposed techniques can be generalized to the case of multi-band identification. Numerical simulations demonstrate the overall priority of the proposed iden...

Types of files (text, executables, Jpeg images, etc.) can be identified through file extension, magic number, or other header information in the file. However, they are easy to be tampered or corrupted so cannot be trusted as secure ways to identify file types.In the presence of adversaries, analyzing the file content may be a more reliable way to identify file types, but existing approaches of...

M. Kim and K. Kim [1] introduce a new identification scheme based on the Gap Diffie-Hellman problem, and prove that the scheme is secure against active attacks if the Gap Diffie-Hellman problem is intractable. But, their identification scheme is NOT secure. In this paper, we give the reason that why the scheme is not secure, and we also modify the scheme such that the modified scheme is secure ...

The code equivalence problem is to decide whether two linear codes over Fq are identical up to a linear isometry of the Hamming space. In this paper, we review the hardness of code equivalence over Fq due to some recent negative results and argue on the possible implications in code-based cryptography. In particular, we present an improved version of the three-pass identification scheme of Gira...

This paper describes a coherent strategy for intelligent fault detection. All of the features of the strategy are discussed in detail. These encompass: (i) a taxonomy for the relevant concepts, i.e. a precise definition of what constitutes a fault etc., (ii) a specification for operational evaluation which makes use of a hierarchical damage identification scheme, (iii) an approach to sensor pre...

We present an analysis of new and old high frequency VLBI data collected during the last 10 years at 5– 22 GHz. For the jet components in the mas-VLBI jet, two component identifications are possible. One of them with quasi-stationary components oscillating about their mean positions. Another identification scheme, which formally gives the better expansion fit, yields motion with ∼ 9 c for H0 = ...

Extracting projectile’s optimal fitting drag coefficient curve Cdf from radar measured velocity data is considered as an optimal tracking control problem (OTCP) where Cdf is regarded as a virtual control function while the radar measured velocity data are taken as the desired output trajectory to be optimally tracked. With a three-degree of freedom (DOF) point mass trajectory prediction model, ...