Dans cette thèse nous développons et améliorons des attaques de systèmes cryptographiques. Un nouvel algorithme de décomposition de signal appelé transformation de Hilbert-Huang a été adapté pour améliorer l’efficacité des attaques parcanaux auxiliaires. Cette technique permet de contrecarrer certaines contre-mesures telles que la permutation d’opérations ou l’ajout de bruit à la consommation de courant. La seconde contribution de ce travail est l’application de certaines distributions statistiques de poids de Hamming à l’attaque d’algorithmes de chiffrement par bloc tels que AES, DES ou LED. Ces distributions sont distinctes pour chaque valeur de sous-clef permettent donc de les utiliser comme modèles intrinsèques. Les poids de Hamming peuvent être découverts par des analyses de canaux auxiliaires sans que les clairs ni les chiffrés ne soient accessibles. Cette thèse montre que certaines contremesures peuvent parfois faciliter des attaques. Les contre-mesures contagieuses proposées pour RSA protègent contre les attaques par faute mais ce faisant et moyennant des calculs additionnels facilitent la découverte de la clef. Finalement, des contre-mesures à faible complexité calculatoire sont proposées. Elles sont basées sur le masquage antagoniste, c’est-à-dire, l’exécution d’une opération d’équilibrage sur des données sensibles pour masquer la consommation de courant. / The goal of the thesis is to develop and improve methods for defeating protected cryptosystems. A new signal decompositionalgorithm, called Hilbert Huang Transform, was adapted to increase the efficiency of side-channel attacks. This technique attempts to overcome hiding countermeasures, such as operation shuffling or the adding of noise to the power consumption. The second contribution of this work is the application of specific Hamming weight distributions of block cipher algorithms, including AES, DES, and LED. These distributions are distinct for each subkey value, thus they serve as intrinsic templates. Hamming weight data can be revealed by side-channel and fault attacks without plaintext and ciphertext. Therefore these distributions can be applied against implementations where plaintext and ciphertext are inaccessible. This thesis shows that some countermeasures serve for attacks. Certain infective RSA countermeasures should protect against single fault injection. However, additional computations facilitate key discovery. Finally, several lightweight countermeasures are proposed. The proposed countermeasures are based on the antagonist masking, which is an operation occurring when targeting data processing, to intelligently mask the overall power consumption.

With the intensively increasing of digital media new challenges has been created for authentication and protection of digital intellectual property. A hash function extracts certain features of a multimedia object e.g. an image and maps it to a fixed string of bits. A perceptual hash function unlike normal cryptographic hash is change tolerant for image processing techniques. Perceptual hash function also referred to as robust hash, like any other algorithm is prone to errors. These errors are false negative and false positive, of which false positive error is neglected compared to false negative errors. False positive occurs when an unknown object is identified as known. In this work a new method for raising false alarms in robust hash function is devised for evaluation purposes i.e. this algorithm modifies hash key of a target image to resemble a different image’s hash key without any significant loss of quality to the modified image. This algorithm is implemented in MATLAB using block mean value based hash function and successfully reduces hamming distance between target image and modified image with a good result and without significant loss to attacked imaged quality.

Étude de divers problèmes lies aux graphes de Hamming

Made available in DSpace on 2014-06-11T19:29:40Z (GMT). No. of bitstreams: 0 Previous issue date: 2011-05-10Bitstream added on 2014-06-13T19:38:58Z : No. of bitstreams: 1 rogeri_jg_me_sjrp.pdf: 962940 bytes, checksum: 5f86f6439d28c1cc69d98e55069b9b90 (MD5) / Nos últimos anos, a segurança tornou-se uma preocupação constante da grande maioria das pessoas. Os sistemas biométricos vem ganhando destaque em soluções ligadas à segurança, uma vez que tratam de características físicas e comportamentais para reconhecimento dos indivíduos e permissões de acesso. Este trabalho objetivou a proposição e implementação de um método para reconhecimento de indivíduos por meio de características contidas na região interna da íris com um alto percentual de exatidão no reconhecimento e uma grande diminuição no tempo de processamento, se comparado aos demais métodos encontrados na literatura. No método proposto foram utilizados operadores de morfologia matemática para localização da íris, wavelet de log-Gabor para extração das características e a distância de Hamming para o reconhecimento. Os resultados experimentais obtidos utilizando a base de dados CASIA mostraram que o método é confiável e seguro, além de se destacar com relação ao baixo custo computacional / In the recent years, the security became a constant concern of most people. Biometric systems have been highlighted in solutions related to security, since they deal with physical and behavioral characteristics for individuals recognition and access permissions. This work aims at the implementation of a method for individuals recognition based on the characteristics of the inner region of the iris, seeking a high percentage of accuracy in the recognition and a great reduction in the processing time, as compared to other methods published so far. We use mathematical morphology to search the iris in the image, the log-Gabor wavelet for feature extraction and the Hamming distance for recognition. The experimental results obtained from CASIA database show that the method is safe and reliable, and stand out with regard to the low computational cost

No description available.

The harsh radiation environment of space is known to cause bit flips in computer memory. The conventional way to combat this is through error detection and correction (EDAC) circuitry, but for low-budget space missions software EDAC can be used. One such mission is the KTH project Miniature Student Satellite (MIST), which aims to send a 3U CubeSat into low-Earth orbit. To ensure a high level of data reliability on board MIST, this thesis investigates the performance of different types of EDAC algorithms. First, a prediction of the bit flip susceptibility of DRAM memory in the planned trajectory is made. After that, data reliability models of Hamming and Reed-Solomon (RS) codes are proposed, and their respective running times on the MIST onboard computer are approximated. Finally, the performance of the different codes is discussed with regards to data reliability, memory overhead, and CPU usage. The findings of this thesis suggest that using an EDAC algorithm would greatly increase the data reliability. Among the codes investigated, three good candidates are RS(28,24), RS(196,192) and RS(255,251), depending on how much memory overhead can be accepted. / Rymdens strålningsmiljö är känd för att orsaka bitflippar i datorminnen.Vanligtvis motverkas detta genom att felrättande hårdvara installeraspå satelliten, men för lågkostnadssatelliter kan rättningen iställetskötas i mjukvaran. Ett exempel på en sådan satellit är KTH-projektetMiniature Student Satellite (MIST), vars mål är att skicka upp en 3UCubeSat i låg omloppsbana. Den här uppsatsen undersöker hur olika felrättningsalgoritmer kananvändas för att skydda data ombord på satelliten från att bli korrupt. Först görs en uppskattning av hur strålningskänsliga DRAM minnenär i den planerade omloppsbanan. Därefter föreslås datakorruptionsmodellerför Hamming- och Reed-Solomonkoder (RS) tillsammans meden uppskattning av deras respektive körtider på satellitens omborddator. Slutligen diskuteras de föreslagna koderna med hänsyn till datakorruptionsskydd,minnesanvändning och processoranvändning. Uppsatsens slutsats indikerar att användandet av felrättningsalgoritmerkraftigt minskar risken för datakorruption. Bland de kodersom undersökts framstår RS(28,24), RS(196,192) och RS(255,251) somde bästa alternativen, beroende på hur mycket extra minnesanvändningsom är acceptabelt.

Speeding up addition is the key to faster digital signal processing (DSP). This can be achieved by exploiting the properties of redundant number systems. Their expanded symbol (digit) alphabet gives them multiple representations for most values. Utilising redundant representations at the output of an adder permits addition to be performed without carry-propagation, yielding fast, constant time performance irrespective of the word length. A resource efficient implementation of this fast adder structure is developed that re-purposes the fast carry logic of low-cost field programmable gate arrays (FPGAs). Experiments confirm constant time addition and show that it outperforms binary ripple carry addition at word lengths of greater than 44 bits in a Xilinx Spartan 3 FPGA and 24 bits in an Altera Cyclone III FPGA. Redundancy also provides other properties that can be exploited for performance gain. Some redundant representations will have more zero-symbols than others. These maximise the opportunities to exploit the multiplicative absorbing and additive identity properties of zero that when exercised reduce superfluous calculations. A serial recoding algorithm is developed that generates a redundant representation for a specified value with as few nonzero symbols as possible. Unlike previously published methods, it accepts a wide specification of number systems including those with irregularly spaced symbol alphabets. A Markov analysis and analysis of the elementary cycles in the formulated state machine provides average and worst case measures for the tested number system. Typically, the average number of non-zero symbols is less than a third and the worst case is less than a half. Further to the increase in zero-symbols, zero-dominance is proposed as a new property of redundant number representations. It promotes a set of representations that have uniquely positioned zero-symbols, in a Pareto-optimal sense. This set covers all representations of a value and is used to select representations to optimise the calculation of a dot-product. The dot-product or vector-multiply is a fundamental operation in DSP, since it is employed in filtering, correlation and convolution. The nonzero partial products can be packed together, substantially reducing the calculation time. The application of redundant number systems provides a two-fold benefit. Firstly, the number of nonzero partial products is reduced. Secondly, a novel opportunity is identified to use the representations in the zero-dominant set to optimise the packing further, gaining an extra 18% improvement. An implementation of the proposed dot-product with partial product packing is developed for a Cyclone II FPGA. It outperforms a quad-multiplier binary implementation in throughput by 50% . Redundant number systems excel at increasing performance in particular DSP subsystems, those that are numerically intensive and consist of considerable accumulation. The conversion back to a binary result is the performance bottleneck in the DSP algorithm, taking a time proportional to a binary adder. Therefore, redundant number systems are best utilised when this conversion cost can be amortised over many fast redundant additions, which is typical in many DSP and communications applications.

<p>This report briefly describes the special requirements for a computer board for use in space. In particular, component selection and ways of mitigating the soft and hard errors are discussed. Furthermore, one implementation for a low-cost, relatively high performance computer that will work in the harsh space environment is presented. The report is primarily intended for those familiar with digital design, who need an introduction to construction of space or other high-reliability hardware. </p><p>As the quality (resolution) of imagers, spectrometers and other data sources in scientific satellite payloads is increasing, there is also an increasing demand for more processing power in order to compress or in other way process the data before transmitting it on the limited bandwidth microwave downlink to Earth. Scientific instruments are usually mission specific and have rather low budget, so there is a need for a powerful computer board that can be used for a number of missions in order to keep the engineering costs down.</p>

Orientador: Aledir Silveira Pereira / Banca: Aparecido Nilceu Marana / Banca: Evandro Luís Linhari Rodrigues / Resumo: Nos últimos anos, a segurança tornou-se uma preocupação constante da grande maioria das pessoas. Os sistemas biométricos vem ganhando destaque em soluções ligadas à segurança, uma vez que tratam de características físicas e comportamentais para reconhecimento dos indivíduos e permissões de acesso. Este trabalho objetivou a proposição e implementação de um método para reconhecimento de indivíduos por meio de características contidas na região interna da íris com um alto percentual de exatidão no reconhecimento e uma grande diminuição no tempo de processamento, se comparado aos demais métodos encontrados na literatura. No método proposto foram utilizados operadores de morfologia matemática para localização da íris, wavelet de log-Gabor para extração das características e a distância de Hamming para o reconhecimento. Os resultados experimentais obtidos utilizando a base de dados CASIA mostraram que o método é confiável e seguro, além de se destacar com relação ao baixo custo computacional / Abstract: In the recent years, the security became a constant concern of most people. Biometric systems have been highlighted in solutions related to security, since they deal with physical and behavioral characteristics for individuals recognition and access permissions. This work aims at the implementation of a method for individuals recognition based on the characteristics of the inner region of the iris, seeking a high percentage of accuracy in the recognition and a great reduction in the processing time, as compared to other methods published so far. We use mathematical morphology to search the iris in the image, the log-Gabor wavelet for feature extraction and the Hamming distance for recognition. The experimental results obtained from CASIA database show that the method is safe and reliable, and stand out with regard to the low computational cost / Mestre

This report briefly describes the special requirements for a computer board for use in space. In particular, component selection and ways of mitigating the soft and hard errors are discussed. Furthermore, one implementation for a low-cost, relatively high performance computer that will work in the harsh space environment is presented. The report is primarily intended for those familiar with digital design, who need an introduction to construction of space or other high-reliability hardware. As the quality (resolution) of imagers, spectrometers and other data sources in scientific satellite payloads is increasing, there is also an increasing demand for more processing power in order to compress or in other way process the data before transmitting it on the limited bandwidth microwave downlink to Earth. Scientific instruments are usually mission specific and have rather low budget, so there is a need for a powerful computer board that can be used for a number of missions in order to keep the engineering costs down.