1,720,962 research outputs found
Attaques quantiques et attaques par canaux cachés
No full textThis thesis focuses on two main areas of research in cryptography. The first part examines post-quantum public-key cryptographic (PQC) algorithms based on lattices, specifically ML-DSA and ML-KEM from the NIST (National Institute of Standards and Technology) competition. We analyze their resistance to side-channel attacks and propose countermeasures. The second part studies the impact of quantum computing on symmetriccryptography. We first investigate existing quantum attacks, such as those using Simon's, Ambainis's, or Child's and Eisenberg's algorithms, and then we explore potential advancements in this field.Cette thèse se focalise sur deux domaines principaux de recherche en cryptographie. La première partie examine les algorithmes cryptographiques à clé publique post-quantiques (PQC) basés sur les réseaux, en particulier ML-DSA et ML-KEM du concours du NIST (National Institute of Standards and Technology). En particulier, nous analysons leur résistance aux attaques par canaux cachés et nous proposons des contre-mesures. La deuxième partie étudie l'impact de l'informatique quantique sur la cryptographie symétrique. Nous étudions d'abord les attaques quantiques existantes, telles que celles utilisant l'algorithme de Simon, Ambainis ou Child's et Eisenberg. Ensuite, nous explorons les avancées potentielles dans ce domaine
Algorithmic study of the algebraic parameter estimation problem for a class of perturbations
No full textWe consider the algebraic parameter estimation problem for a class of standard perturbations. We assume that the measurement z(t) of a solution x(t) of a linear ordinary differential equation -- whose coefficients depend on a set θ := {θ₁, ..., θᵣ} of unknown constant parameters -- is affected by a perturbation γ(t) whose structure is supposed to be known (e.g., an unknown bias, an unknown ramp), i.e., z(t)=x(t, θ)+γ(t). We investigate the problem of obtaining closed-form expressions for the parameters θᵢ's in terms of iterative indefinite integrals or convolutions of z. The different results are illustrated by explicit examples computed using the NonA package -- developed in Maple -- in which we have implemented our main contributions
Attaques quantiques et attaques par canaux cachés
No full textThis thesis focuses on two main areas of research in cryptography. The first part examines post-quantum public-key cryptographic (PQC) algorithms based on lattices, specifically ML-DSA and ML-KEM from the NIST (National Institute of Standards and Technology) competition. We analyze their resistance to side-channel attacks and propose countermeasures. The second part studies the impact of quantum computing on symmetriccryptography. We first investigate existing quantum attacks, such as those using Simon's, Ambainis's, or Child's and Eisenberg's algorithms, and then we explore potential advancements in this field.Cette thèse se focalise sur deux domaines principaux de recherche en cryptographie. La première partie examine les algorithmes cryptographiques à clé publique post-quantiques (PQC) basés sur les réseaux, en particulier ML-DSA et ML-KEM du concours du NIST (National Institute of Standards and Technology). En particulier, nous analysons leur résistance aux attaques par canaux cachés et nous proposons des contre-mesures. La deuxième partie étudie l'impact de l'informatique quantique sur la cryptographie symétrique. Nous étudions d'abord les attaques quantiques existantes, telles que celles utilisant l'algorithme de Simon, Ambainis ou Child's et Eisenberg. Ensuite, nous explorons les avancées potentielles dans ce domaine
Attaques quantiques et attaques par canaux cachés
No full textCette thèse se focalise sur deux domaines principaux de recherche en cryptographie. La première partie examine les algorithmes cryptographiques à clé publique post-quantiques (PQC) basés sur les réseaux, en particulier ML-DSA et ML-KEM du concours du NIST (National Institute of Standards and Technology). En particulier, nous analysons leur résistance aux attaques par canaux cachés et nous proposons des contre-mesures. La deuxième partie étudie l'impact de l'informatique quantique sur la cryptographie symétrique. Nous étudions d'abord les attaques quantiques existantes, telles que celles utilisant l'algorithme de Simon, Ambainis ou Child's et Eisenberg. Ensuite, nous explorons les avancées potentielles dans ce domaine.This thesis focuses on two main areas of research in cryptography. The first part examines post-quantum public-key cryptographic (PQC) algorithms based on lattices, specifically ML-DSA and ML-KEM from the NIST (National Institute of Standards and Technology) competition. We analyze their resistance to side-channel attacks and propose countermeasures. The second part studies the impact of quantum computing on symmetriccryptography. We first investigate existing quantum attacks, such as those using Simon's, Ambainis's, or Child's and Eisenberg's algorithms, and then we explore potential advancements in this field
Going Beyond Counting First Authors in Author Co-citation Analysis
Full text linkThe present study examines one of the fundamental aspects of author co-citation analysis (ACA) - the way co-citation
counts are defined. Co-citation counting provides the data on which all subsequent statistical analyses and mappings
are based, and we compare ACA results based on two different types of co-citation counting - the traditional type that
only counts the first one among a cited work's authors on the one hand and a non-traditional type that takes into
account the first 5 authors of a cited work on the other hand. Results indicate that the picture produced through this non-traditional author co-citation counting contains more coherent author groups and is therefore considerably clearer. However, this picture represents fewer specialties in the research field being studied than that produced through the traditional first-author co-citation counting when the same number of top-ranked authors is selected and analyzed. Reasons for these effects are discussed
Variations on the Author
Full text link“Variations on the Author” discusses two of Eduardo Coutinho’s recent films (Um Dia na Vida, from 2010, and Últimas Conversas, posthumously released in 2015) and their contribution to the general question of documentary authorship. The director’s filmography is characterized by a consistent yet self-effacing form of authorial self-inscription: Coutinho often features as an interviewer that rather than express opinions propels discourses; an interviewer that is good at listening. This mode of self-inscription characterizes him as an author who is not expressive but who is nonetheless markedly present on the screen. In Um Dia na Vida, however, Coutinho is completely absent form the image, while Últimas Conversas, on the contrary, includes a confessional prologue that moves the director from the margins to the center of his films. This article examines the ways in which these works stand out in the filmography of a director who offers new insights into the notion of cinematic authorship
Appropriate Similarity Measures for Author Cocitation Analysis
Full text linkWe provide a number of new insights into the methodological discussion about author cocitation analysis. We first argue that the use of the Pearson correlation for measuring the similarity between authors’ cocitation profiles is not very satisfactory. We then discuss what kind of similarity measures may be used as an alternative to the Pearson correlation. We consider three similarity measures in particular. One is the well-known cosine. The other two similarity measures have not been used before in the bibliometric literature. Finally, we show by means of an example that our findings have a high practical relevance.information science;Pearson correlation;cosine;similarity measure;author cocitation analysis
Dispelling the Myths Behind First-author Citation Counts
Full text linkWe conducted a full-scale evaluative citation analysis study of scholars in the XML research field to explore just how different from each other author rankings resulting from different citation counting methods actually are, and to demonstrate the capability of emerging data and tools on the Web in supporting more realistic citation counting methods. Our results contest some common arguments for the continued
use of first-author citation counts in the evaluation of scholars, such as high correlations between author rankings by first-author citation counts and other citation
counting methods, and high costs of using more realistic citation counting methods that are not well-supported by the ISI databases. It is argued that increasingly available digital full text research papers make it possible for citation analysis studies to go beyond what the ISI databases have directly supported and to employ more
sophisticated methods
- …
