Numéro de série

thumb|Numéro de série d'une carte d'identité allemande|alt= Un numéro de série est un nombre unique qui est assigné à un objet d'une série afin de l'identifier. Chaque objet d'une même série porte donc en principe un numéro différent. L'utilisation actuelle se rapporte aussi à n'importe quelle chaîne de caractères alphanumériques unique tiré d'un grand ensemble, particulièrement dans les domaines informatiques. Tous les identifiants numériques ne sont pas forcément des numéros de série. Les numéros de série sont quasiment toujours positifs et commencent d'habitude à zéro ou à un. Ils sont identifiés par le sigle "S/N", ou bien "SNID", ou bien "Serial No". Notes et références Catégorie:Nombre Catégorie:Identifiant

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés

Chargement

Cours associés

Chargement

Séances de cours associées

Chargement

Résumé

Source officielle

À propos de ce résultat

Publications associées (2)

Publications associées

Chargement

Personnes associées

Chargement

Unités associées

Chargement

Concepts associés

Chargement

Cours associés (10)

Cours associés

Chargement

Séances de cours associées (15)

Séances de cours associées

Chargement

Short chosen-prefix collisions for MD5 and the creation of a rogue CA certificate

Arjen Lenstra, Dag Arne Osvik

We present a refined chosen-prefix collision construction for MD5 that allowed creation of a rogue Certification Authority (CA) certificate, based on a collision with a regular end-user website certificate provided by a commercial CA. Compared to the previous construction from Eurocrypt 2007, this paper describes a more flexible family of differential paths and a new variable birthdaying search space. Combined with a time-memory trade-off, these improvements lead to just three pairs of near-collision blocks to generate the collision, enabling construction of RSA moduli that are sufficiently short to be accepted by current CAs. The entire construction is fast enough to allow for adequate prediction of certificate serial number and validity period: it can be made to require about 249 MD5 compression function calls. Finally, we improve the complexity of identical-prefix collisions for MD5 to about 2 16 MD5 compression function calls and use it to derive a practical single-block chosen-prefix collision construction of which an example is given. © 2009 Springer.

Springer Verlag2009

Chargement

Parallelization of the distinct lattice spring model

Jiannong Fang, Liang Sun, Jian Zhao, Gaofeng Zhao

The distinct lattice spring model (DLSM) is a newly developed numerical tool for modeling rock dynamics problems, i.e. dynamic failure and wave propagation. In this paper, parallelization of DLSM is presented. With the development of parallel computing technologies in both hardware and software, parallelization of a code is becoming easier than before. There are many available choices now. In this paper, Open Multi-Processing (OpenMP) with multicore personal computer (PC) and message passing interface (MPI) with cluster are selected as the environments to parallelize DLSM. Performances of these parallel DLSM codes are tested on different computers. It is found that the parallel DLSM code with OpenMP can reach a maximum speed-up of 4.68x on a quad-core PC. The parallel DLSM code with MPI can achieve a speed-up of 40.886x when 256 CPUs are used on a cluster. At the end of this paper, a high-resolution model with four million particles, which is too big to handle by the serial code, is simulated by using the parallel DLSM code on a cluster. It is concluded that the parallelization of DLSM is successful.

Wiley-Blackwell2013

Chargement

EE-530: Test of VLSI systems

Test of VLSI Systems covers theoretical knowledge related to the major algorithms used in VLSI test, and design for test techniques. Basic knowledge related to computer-aided design for test techniques, and their integration into a design-flow are presented.

COM-401: Cryptography and security

This course introduces the basics of cryptography. We review several types of cryptographic primitives, when it is safe to use them and how to select the appropriate security parameters. We detail how they work and sketch how they can be implemented.

BIO-105: Cellular biology and biochemistry for engineers

Basic course in biochemistry as well as cellular and molecular biology for non-life science students enrolling at the Master or PhD thesis level from various engineering disciplines. It reviews essential notions necessary for a training in biology-related engineering fields.