National Institute of Standards and Technology における超伝導研究及び生活

Im Jahre 1977 wurde der „Data Encryption Algorithm“ (DEA) vom „National Bureau of Standards“ (NBS, später „National Institute of Standards and Technology“ – NIST) zum amerikanischen Verschlüsselungsstandard für Bundesbehörden erklärt [NBS_77]. 1981 folgte die Verabschiedung der DEA-Spezifikation als ANSI-Standard „DES“ [ANSI_81]. Die Empfehlung des DES als StandardVerschlüsselungsverfahren wurde auf fünf Jahre befristet und 1983, 1988 und 1993 um jeweils weitere fünf Jahre verlängert. Derzeit liegt eine Neufassung des NISTStandards vor [NIST_99], in dem der DES für weitere fünf Jahre übergangsweise zugelassen sein soll, aber die Verwendung von Triple-DES empfohlen wird: eine dreifache Anwendung des DES mit drei verschiedenen Schlüsseln (effektive Schlüssellänge: 168 bit) [NIST_99]. Der DES basiert auf einer von Horst Feistel bei IBM entwickelten Blockchiffre („Lucipher“) mit einer Schlüssellänge von 128 bit. Da die amerikanische „National Security Agency“ (NSA) dafür gesorgt hatte, daß der DES eine Schlüssellänge von lediglich 64 bit besitzt, von denen nur 56 bit relevant sind, und spezielle Substitutionsboxen (den „kryptographischen Kern“ des Verfahrens) erhielt, deren Konstruktionskriterien von der NSA nicht veröffentlicht wurden, war das Verfahren von Beginn an umstritten. Kritiker nahmen an, daß es eine geheime „Trapdoor“ in dem Verfahren gäbe, die der NSA eine OnlineEntschlüsselung auch ohne Kenntnis des Schlüssels erlauben würde. Zwar ließ sich dieser Verdacht nicht erhärten, aber sowohl die Zunahme von Rechenleistung als auch die Parallelisierung von Suchalgorithmen machen heute eine Schlüssellänge von 56 bit zum Sicherheitsrisiko. Zuletzt konnte 1998 mit einer von der „Electronic Frontier Foundation“ (EFF) entwickelten Spezialmaschine mit 1.800 parallel arbeitenden, eigens entwickelten Krypto-Prozessoren ein DES-Schlüssel in einer Rekordzeit von 2,5 Tagen gefunden werden. Um einen Nachfolger für den DES zu finden, kündigte das NIST am 2. Januar 1997 die Suche nach einem „Advanced Encryption Standard“ (AES) an. Ziel dieser Initiative ist, in enger Kooperation mit Forschung und Industrie ein symmetrisches Verschlüsselungsverfahren zu finden, das geeignet ist, bis weit ins 21. Jahrhundert hinein amerikanische Behördendaten wirkungsvoll zu verschlüsseln. Dazu wurde am 12. September 1997 ein offizieller „Call for Algorithm“ ausgeschrieben. An die vorzuschlagenden symmetrischen Verschlüsselungsalgorithmen wurden die folgenden Anforderungen gestellt: nicht-klassifiziert und veröffentlicht, weltweit lizenzfrei verfügbar, effizient implementierbar in Hardund Software, Blockchiffren mit einer Blocklänge von 128 bit sowie Schlüssellängen von 128, 192 und 256 bit unterstützt. Auf der ersten „AES Candidate Conference“ (AES1) veröffentlichte das NIST am 20. August 1998 eine Liste von 15 vorgeschlagenen Algorithmen und forderte die Fachöffentlichkeit zu deren Analyse auf. Die Ergebnisse wurden auf der zweiten „AES Candidate Conference“ (22.-23. März 1999 in Rom, AES2) vorgestellt und unter internationalen Kryptologen diskutiert. Die Kommentierungsphase endete am 15. April 1999. Auf der Basis der eingegangenen Kommentare und Analysen wählte das NIST fünf Kandidaten aus, die es am 9. August 1999 öffentlich bekanntmachte: MARS (IBM) RC6 (RSA Lab.) Rijndael (Daemen, Rijmen) Serpent (Anderson, Biham, Knudsen) Twofish (Schneier, Kelsey, Whiting, Wagner, Hall, Ferguson).

Advanced Encryption Standard (AES).

Implementations of cryptographic algorithms continue to proliferate in consumer products due to the increasing demand for secure transmission of confidential information. Although the current standard cryptographic algorithms proved to withstand exhaustive attacks, their hardware and software implementations have exhibited vulnerabilities to side channel attacks, e.g., power analysis and fault injection attacks. This paper focuses on fault injection attacks that have been shown to require inexpensive equipment and a short amount of time. The paper provides a comprehensive description of these attacks on cryptographic devices and the countermeasures that have been developed against them. After a brief review of the widely used cryptographic algorithms, we classify the currently known fault injection attacks into low-cost ones (which a single attacker with a modest budget can mount) and high-cost ones (requiring highly skilled attackers with a large budget). We then list the attacks that have been developed for the important and commonly used ciphers and indicate which ones have been successfully used in practice. The known countermeasures against the previously described fault injection attacks are then presented, including intrusion detection and fault detection. We conclude the survey with a discussion on the interaction between fault injection attacks (and the corresponding countermeasures) and power analysis attacks.

/pdf/fault-injection-attacks-on-cryptographic-devices-theory-12qo1dda0z.pdf

Fault Injection Attacks on Cryptographic Devices: Theory, Practice, and Countermeasures

Face Recognition.- Super-Resolved Faces for Improved Face Recognition from Surveillance Video.- Face Detection Based on Multi-Block LBP Representation.- Color Face Tensor Factorization and Slicing for Illumination-Robust Recognition.- Robust Real-Time Face Detection Using Face Certainty Map.- Poster I.- Motion Compensation for Face Recognition Based on Active Differential Imaging.- Face Recognition with Local Gabor Textons.- Speaker Verification with Adaptive Spectral Subband Centroids.- Similarity Rank Correlation for Face Recognition Under Unenrolled Pose.- Feature Correlation Filter for Face Recognition.- Face Recognition by Discriminant Analysis with Gabor Tensor Representation.- Fingerprint Enhancement Based on Discrete Cosine Transform.- Biometric Template Classification: A Case Study in Iris Textures.- Protecting Biometric Templates with Image Watermarking Techniques.- Factorial Hidden Markov Models for Gait Recognition.- A Robust Fingerprint Matching Approach: Growing and Fusing of Local Structures.- Automatic Facial Pose Determination of 3D Range Data for Face Model and Expression Identification.- SVDD-Based Illumination Compensation for Face Recognition.- Keypoint Identification and Feature-Based 3D Face Recognition.- Fusion of Near Infrared Face and Iris Biometrics.- Multi-Eigenspace Learning for Video-Based Face Recognition.- Error-Rate Based Biometrics Fusion.- Online Text-Independent Writer Identification Based on Stroke's Probability Distribution Function.- Arm Swing Identification Method with Template Update for Long Term Stability.- Walker Recognition Without Gait Cycle Estimation.- Comparison of Compression Algorithms' Impact on Iris Recognition Accuracy.- Standardization of Face Image Sample Quality.- Blinking-Based Live Face Detection Using Conditional Random Fields.- Singular Points Analysis in Fingerprints Based on Topological Structure and Orientation Field.- Robust 3D Face Recognition from Expression Categorisation.- Fingerprint Recognition Based on Combined Features.- MQI Based Face Recognition Under Uneven Illumination.- Learning Kernel Subspace Classifier.- A New Approach to Fake Finger Detection Based on Skin Elasticity Analysis.- An Algorithm for Biometric Authentication Based on the Model of Non-Stationary Random Processes.- Identity Verification by Using Handprint.- Reducing the Effect of Noise on Human Contour in Gait Recognition.- Partitioning Gait Cycles Adaptive to Fluctuating Periods and Bad Silhouettes.- Repudiation Detection in Handwritten Documents.- A New Forgery Scenario Based on Regaining Dynamics of Signature.- Curvewise DET Confidence Regions and Pointwise EER Confidence Intervals Using Radial Sweep Methodology.- Bayesian Hill-Climbing Attack and Its Application to Signature Verification.- Wolf Attack Probability: A New Security Measure in Biometric Authentication Systems.- Evaluating the Biometric Sample Quality of Handwritten Signatures.- Outdoor Face Recognition Using Enhanced Near Infrared Imaging.- Latent Identity Variables: Biometric Matching Without Explicit Identity Estimation.- Poster II.- 2^N Discretisation of BioPhasor in Cancellable Biometrics.- Probabilistic Random Projections and Speaker Verification.- On Improving Interoperability of Fingerprint Recognition Using Resolution Compensation Based on Sensor Evaluation.- Demographic Classification with Local Binary Patterns.- Distance Measures for Gabor Jets-Based Face Authentication: A Comparative Evaluation.- Fingerprint Matching with an Evolutionary Approach.- Stability Analysis of Constrained Nonlinear Phase Portrait Models of Fingerprint Orientation Images.- Effectiveness of Pen Pressure, Azimuth, and Altitude Features for Online Signature Verification.- Tracking and Recognition of Multiple Faces at Distances.- Face Matching Between Near Infrared and Visible Light Images.- User Classification for Keystroke Dynamics Authentication.- Statistical Texture Analysis-Based Approach for Fake Iris Detection Using Support Vector Machines.- A Novel Null Space-Based Kernel Discriminant Analysis for Face Recognition.- Changeable Face Representations Suitable for Human Recognition.- "3D Face": Biometric Template Protection for 3D Face Recognition.- Quantitative Evaluation of Normalization Techniques of Matching Scores in Multimodal Biometric Systems.- Keystroke Dynamics in a General Setting.- A New Approach to Signature-Based Authentication.- Biometric Fuzzy Extractors Made Practical: A Proposal Based on FingerCodes.- On the Use of Log-Likelihood Ratio Based Model-Specific Score Normalisation in Biometric Authentication.- Predicting Biometric Authentication System Performance Across Different Application Conditions: A Bootstrap Enhanced Parametric Approach.- Selection of Distinguish Points for Class Distribution Preserving Transform for Biometric Template Protection.- Minimizing Spatial Deformation Method for Online Signature Matching.- Pan-Tilt-Zoom Based Iris Image Capturing System for Unconstrained User Environments at a Distance.- Fingerprint Matching with Minutiae Quality Score.- Uniprojective Features for Gait Recognition.- Cascade MR-ASM for Locating Facial Feature Points.- Reconstructing a Whole Face Image from a Partially Damaged or Occluded Image by Multiple Matching.- Robust Hiding of Fingerprint-Biometric Data into Audio Signals.- Correlation-Based Fingerprint Matching with Orientation Field Alignment.- Vitality Detection from Fingerprint Images: A Critical Survey.- Optimum Detection of Multiplicative-Multibit Watermarking for Fingerprint Images.- Fake Finger Detection Based on Thin-Plate Spline Distortion Model.- Robust Extraction of Secret Bits from Minutiae.- Fuzzy Extractors for Minutiae-Based Fingerprint Authentication.- Coarse Iris Classification by Learned Visual Dictionary.- Nonlinear Iris Deformation Correction Based on Gaussian Model.- Shape Analysis of Stroma for Iris Recognition.- Biometric Key Binding: Fuzzy Vault Based on Iris Images.- Multi-scale Local Binary Pattern Histograms for Face Recognition.- Histogram Equalization in SVM Multimodal Person Verification.- Learning Multi-scale Block Local Binary Patterns for Face Recognition.- Horizontal and Vertical 2DPCA Based Discriminant Analysis for Face Verification Using the FRGC Version 2 Database.- Video-Based Face Tracking and Recognition on Updating Twin GMMs.- Poster III.- Fast Algorithm for Iris Detection.- Pyramid Based Interpolation for Face-Video Playback in Audio Visual Recognition.- Face Authentication with Salient Local Features and Static Bayesian Network.- Fake Finger Detection by Finger Color Change Analysis.- Feeling Is Believing: A Secure Template Exchange Protocol.- SVM-Based Selection of Colour Space Experts for Face Authentication.- An Efficient Iris Coding Based on Gauss-Laguerre Wavelets.- Hardening Fingerprint Fuzzy Vault Using Password.- GPU Accelerated 3D Face Registration / Recognition.- Frontal Face Synthesis Based on Multiple Pose-Variant Images for Face Recognition.- Optimal Decision Fusion for a Face Verification System.- Robust 3D Head Tracking and Its Applications.- Multiple Faces Tracking Using Motion Prediction and IPCA in Particle Filters.- An Improved Iris Recognition System Using Feature Extraction Based on Wavelet Maxima Moment Invariants.- Color-Based Iris Verification.- Real-Time Face Detection and Recognition on LEGO Mindstorms NXT Robot.- Speaker and Digit Recognition by Audio-Visual Lip Biometrics.- Modelling Combined Handwriting and Speech Modalities.- A Palmprint Cryptosystem.- On Some Performance Indices for Biometric Identification System.- Automatic Online Signature Verification Using HMMs with User-Dependent Structure.- A Complete Fisher Discriminant Analysis for Based Image Matrix and Its Application to Face Biometrics.- SVM Speaker Verification Using Session Variability Modelling and GMM Supervectors.- 3D Model-Based Face Recognition in Video.- Robust Point-Based Feature Fingerprint Segmentation Algorithm.- Automatic Fingerprints Image Generation Using Evolutionary Algorithm.- Audio Visual Person Authentication by Multiple Nearest Neighbor Classifiers.- Improving Classification with Class-Independent Quality Measures: Q-stack in Face Verification.- Biometric Hashing Based on Genetic Selection and Its Application to On-Line Signatures.- Biometrics Based on Multispectral Skin Texture.- Application of New Qualitative Voicing Time-Frequency Features for Speaker Recognition.- Palmprint Recognition Based on Directional Features and Graph Matching.- Tongue-Print: A Novel Biometrics Pattern.- Embedded Palmprint Recognition System on Mobile Devices.- Template Co-update in Multimodal Biometric Systems.- Continual Retraining of Keystroke Dynamics Based Authenticator.

Advances in biometrics : International Conference, ICB 2007 Seoul, Korea, August 27-29, 2007 : proceedings

Several issues related to the vulnerability of fingerprint recognition systems to attacks have been highlighted in the biometrics literature. One such vulnerability involves the use of artificial fingers, where materials such as Play-Doh, silicone, and gelatin are inscribed with fingerprint ridges. Researchers have demonstrated that some commercial fingerprint recognition systems can be deceived when these artificial fingers are placed on the sensor; that is, the system successfully processes the ensuing fingerprint images, thereby allowing an adversary to spoof the fingerprints of another individual. However, at the same time, several countermeasures that discriminate between live fingerprints and spoof artifacts have been proposed. While some of these antispoofing schemes are hardware based, several software-based approaches have been proposed as well. In this article, we review the literature and present the state of the art in fingerprint antispoofing.

A Survey on Antispoofing Schemes for Fingerprint Recognition Systems

This paper considers the use of electromagnetic pulses (EMP) to inject transient faults into the calculations of a hardware and a software AES. A pulse generator and a 500 um-diameter magnetic coil were used to inject the localized EMP disturbances without any physical contact with the target. EMP injections were performed against a software AES running on a CPU, and a hardware AES (with and without countermeasure) embedded in a FPGA. The purpose of this work was twofold: (a) reporting actual faults injection induced by EMPs in our targets and describing their main properties, (b) explaining the coupling mechanism between the antenna used to produce the EMP and the targeted circuit, which causes the faults. The obtained results revealed a localized effect of the EMP since the injected faults were found dependent on the spatial position of the antenna on top of the circuit's surface. The assumption that EMP faults are related to the violation of the target's timing constraints was also studied and ascertained thanks to the use of a countermeasure based on monitoring such timing violations.

Electromagnetic Transient Faults Injection on a Hardware and a Software Implementations of AES

Whilst clock fault attacks are known to be a serious security threat, an in-depth explanation of such faults still seems to be put in order.

This work provides a theoretical analysis, backed by practical experiments, explaining when and how clock faults occur. Understanding and modeling the chain of events following a transient clock alteration allows to accurately predict faulty circuit behavior. A prediction fully confirmed by injecting variable-duration faults at predetermined clock cycles.

We illustrate the process by successfully attacking an fpga aes implementation using a dll-based fpga platform (one-bit fault attack).

/pdf/when-clocks-fail-on-critical-paths-and-clock-faults-cm7otaw3om.pdf

When clocks fail: on critical paths and clock faults

This note describes laser fault experiments on an 8-bit 0.35μm microcontroller with no countermeasures. We show that reproducible single-bit faults, often considered unfeasible, can be obtained by careful beam-size and shot-instant tuning.

How to flip a bit

The use of a laser to inject faults into SRAM memory cells is well known. However, the corresponding fault model is often unknown or misunderstood: the induced faults may be described as bit-flip or bit-set/reset faults. We have investigated in this paper whether the bit-set/reset fault model or bit-flip fault model may be encountered in SRAMs. First, the fault model of a standalone SRAM was considered. Experiments revealed that the relevant fault model was the bit-set/reset. This result was further investigated through electrical simulations based on the use of an electrical model of MOS transistors under laser illumination. Then, fault injections have been performed on the RAM memory of a micro-controller to check the validity of the previous results based on experiments and simulations.

/pdf/fault-model-analysis-of-laser-induced-faults-in-sram-memory-2j3hs4vxcw.pdf

Fault Model Analysis of Laser-Induced Faults in SRAM Memory Cells

The use of electromagnetic glitches has recently emerged as an effective fault injection technique for the purpose of conducting physical attacks against integrated circuits. First research works have shown that electromagnetic faults are induced by timing constraint violations and that they are also located in the vicinity of the injection probe. This paper reports the study of the efficiency of a glitch detector against EM injection. This detector was originally designed to detect any attempt of inducing timing violations by means of clock or power glitches. Because electromagnetic disturbances are more local than global, the use of a single detector proved to be inefficient. Our subsequent investigation of the use of several detectors to obtain a full fault detection coverage is reported, it also provides further insights into the properties of electromagnetic injection and into the key role played by the injection probe.

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01096047/document

Assia Tria

Papers

Electromagnetic Transient Faults Injection on a Hardware and a Software Implementations of AES

When clocks fail: on critical paths and clock faults

How to flip a bit

Fault Model Analysis of Laser-Induced Faults in SRAM Memory Cells

Efficiency of a glitch detector against electromagnetic fault injection