Many identification schemes have been proposed in which security are based on the intractability of factoring or DLP (Discrete Logarithm Problem). In 2009, Massoud et.al gave identification scheme whose security was based on solving ECDLP (Elliptic Curve Discrete Logarithm Problem). The security of this scheme is improved in order to propose a more secure and efficient scheme. The security of p...

Secure identification is an important security issue to avoid computer fraud due to masquerading. This can be achieved with zero-knowledge based smart cards. We present very efficient new zero-knowledge schemes in a general algebraic setting. Particular cases of our scheme improve the performance of the Guillou-Quisquater and the Chaum-Evertsevan de Graaf schemes. Our scheme is formally proven ...

This paper presents a scheme for the identification of a system which operates in closed-loop and in the presence of bounded output disturbances. Two algorithms are proposed to solve this identification problem. The first algorithm is an Optimal Bounding Ellipsoid (OBE) type algorithm. This first algorithm is analyzed and sufficient conditions for stability and convergence are established. Rela...

star identification is one of the most important stages in attitude determination with star trackers. this can be performed using matching algorithms between observed stars and a master star catalogue. the main challenge in this approach is to provide a fast and reliable identification algorithm that is sufficiently robust in different pointing views of the star tracker optical system in the sp...

We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Overview One of the most desirable cryptographic functions is a secure, small, zero-knowledge public-key identification scheme. The applications are many and obvious – even the single application of credit/smartcard secur...

The identification of dynamical models in the errors-in-variables (EIV) framework has seen renewed interest during the last decades. One of the main advantages of such a framework is the symmetrical treatment of all variables. One important EIV identification method is the Frisch scheme, which yields estimates for the measurement noise variances as well as the model parameters. Building on a re...

In this paper we present efficient implementations of several code-based identification schemes, namely the Stern scheme, the Véron scheme and the Cayrel-Véron-El Yousfi scheme. We also explain how to derive and implement signature schemes from the previous identification schemes using the Fiat-Shamir transformation. For a security of 80 bits and a document to be signed of size 1 kByte, we reac...

This thesis concerns two problems of robustness in the modeling and control of nonlinear dynamical systems. First, I examine the problem of selecting a stable nonlinear state-space model whose open-loop simulations are to match experimental data. I provide a family of techniques for addressing this problem based on minimizing convex upper bounds for simulation error over convex sets of stable n...

A blind image restoration for non-linear motion blurs with non-uniform point spread functions based on multiple blurred versions of a same scene is proposed. The restoration is separately considered as identification and deconvolution problems. In the proposed identification process, an identification difficulty is introduced to rank an order of blur identification. A blurred image with the low...