All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 151

Showing per page

A tight bound for exhaustive key search attacks against Message Authentication Codes

Vinícius G. P. de SÁ, Davidson R. Boccardo, Luiz Fernando Rust, Raphael C. S. Machado (2013)

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications

A Message Authentication Code (MAC) is a function that takes a message and a key as parameters and outputs an authentication of the message. MAC are used to guarantee the legitimacy of messages exchanged through a network, since generating a correct authentication requires the knowledge of the key defined secretly by trusted parties. However, an attacker with access to a sufficiently large number of message/authentication pairs may use a brute force algorithm to infer the secret key: from a set...

A topological asymptotic analysis for the regularized grey-level image classification problem

Didier Auroux, Lamia Jaafar Belaid, Mohamed Masmoudi (2007)

ESAIM: Mathematical Modelling and Numerical Analysis

The aim of this article is to propose a new method for the grey-level image classification problem. We first present the classical variational approach without and with a regularization term in order to smooth the contours of the classified image. Then we present the general topological asymptotic analysis, and we finally introduce its application to the grey-level image classification problem.

A variational model in image processing with focal points

Andrea Braides, Giuseppe Riey (2008)

ESAIM: Mathematical Modelling and Numerical Analysis

We propose a model for segmentation problems involving an energy concentrated on the vertices of an unknown polyhedral set, where the contours of the images to be recovered have preferred directions and focal points. We prove that such an energy is obtained as a Γ-limit of functionals defined on sets with smooth boundary that involve curvature terms of the boundary. The minimizers of the limit functional are polygons with edges either parallel to some prescribed directions or pointing to some fixed...

Access structures for finding characteristic-dependent linear rank inequalities

Victor Peña-Macias (2023)

Kybernetika

Determining information ratios of access structures is an important problem in secret sharing. Information inequalities and linear rank inequalities play an important role for proving bounds on these ratios. Characteristic-dependent linear rank inequalities are rank inequalities which are true over vector spaces with specific field characteristic. In this paper, using ideas of secret sharing, we show a theorem that produces characteristic-dependent linear rank inequalities. These inequalities are...

Active fault diagnosis based on stochastic tests

Niels K. Poulsen, Henrik Niemann (2008)

International Journal of Applied Mathematics and Computer Science

The focus of this paper is on stochastic change detection applied in connection with active fault diagnosis (AFD). An auxiliary input signal is applied in AFD. This signal injection in the system will in general allow us to obtain a fast change detection/isolation by considering the output or an error output from the system. The classical cumulative sum (CUSUM) test will be modified with respect to the AFD approach applied. The CUSUM method will be altered such that it will be able to detect a change...

Adaptive tests for periodic signal detection with applications to laser vibrometry

Magalie Fromont, Céline Lévy-leduc (2006)

ESAIM: Probability and Statistics

Initially motivated by a practical issue in target detection via laser vibrometry, we are interested in the problem of periodic signal detection in a Gaussian fixed design regression framework. Assuming that the signal belongs to some periodic Sobolev ball and that the variance of the noise is known, we first consider the problem from a minimax point of view: we evaluate the so-called minimax separation rate which corresponds to the minimal l2-distance between the signal and zero so that the detection...

Algebra of Polynomially Bounded Sequences and Negligible Functions

Hiroyuki Okazaki (2015)

Formalized Mathematics

In this article we formalize negligible functions that play an essential role in cryptology [10], [2]. Generally, a cryptosystem is secure if the probability of succeeding any attacks against the cryptosystem is negligible. First, we formalize the algebra of polynomially bounded sequences [20]. Next, we formalize negligible functions and prove the set of negligible functions is a subset of the algebra of polynomially bounded sequences. Moreover, we then introduce equivalence relation between polynomially...

Currently displaying 81 – 100 of 151