There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

1. The Advanced Encryption Standard Process.- 2. Preliminaries.- 3. Specification of Rijndael.- 4. Implementation Aspects.- 5. Design Philosophy.- 6. The Data Encryption Standard.- 7. Correlation Matrices.- 8. Difference Propagation.- 9. The Wide Trail Strategy.- 10. Cryptanalysis.- 11. Related Block Ciphers.- Appendices.- A. Propagation Analysis in Galois Fields.- A.1.1 Difference Propagation.- A.l.2 Correlation.- A. 1.4 Functions that are Linear over GF(2).- A.2.1 Difference Propagation.- A.2.2 Correlation.- A.2.4 Functions that are Linear over GF(2).- A.3.3 Dual Bases.- A.4.2 Relationship Between Trace Patterns and Selection Patterns.- A.4.4 Illustration.- A.5 Rijndael-GF.- B. Trail Clustering.- B.1 Transformations with Maximum Branch Number.- B.2 Bounds for Two Rounds.- B.2.1 Difference Propagation.- B.2.2 Correlation.- B.3 Bounds for Four Rounds.- B.4 Two Case Studies.- B.4.1 Differential Trails.- B.4.2 Linear Trails.- C. Substitution Tables.- C.1 SRD.- C.2 Other Tables.- C.2.1 xtime.- C.2.2 Round Constants.- D. Test Vectors.- D.1 KeyExpansion.- D.2 Rijndael(128,128).- D.3 Other Block Lengths and Key Lengths.- E. Reference Code.

The Design of Rijndael: AES - The Advanced Encryption Standard

After two decades of research and development, elliptic curve cryptography now has widespread exposure and acceptance. Industry, banking, and government standards are in place to facilitate extensive deployment of this efficient public-key mechanism. Anchored by a comprehensive treatment of the practical aspects of elliptic curve cryptography (ECC), this guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment. In addition, the book addresses some issues that arise in software and hardware implementation, as well as side-channel attacks and countermeasures. Readers receive the theoretical fundamentals as an underpinning for a wealth of practical and accessible knowledge about efficient application. Features & Benefits: * Breadth of coverage and unified, integrated approach to elliptic curve cryptosystems * Describes important industry and government protocols, such as the FIPS 186-2 standard from the U.S. National Institute for Standards and Technology * Provides full exposition on techniques for efficiently implementing finite-field and elliptic curve arithmetic* Distills complex mathematics and algorithms for easy understanding* Includes useful literature references, a list of algorithms, and appendices on sample parameters, ECC standards, and software toolsThis comprehensive, highly focused reference is a useful and indispensable resource for practitioners, professionals, or researchers in computer science, computer engineering, network design, and network data security.

https://cdn.preterhuman.net/texts/cryptography/Hankerson,%20Menezes,%20Vanstone.%20Guide%20to%20elliptic%20curve%20cryptography%20(Springer,%202004)(ISBN%20038795273X)(332s)_CsCr_.pdf

Guide to Elliptic Curve Cryptography

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

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

As demonstrated recently, Wireless Physical Layer Security (WPLS) has the potential to offer substantial advantages for key management for small resource-constrained and, therefore, low-cost IoT-devices, e.g., the widely applied 8-bit MCU 8051. In this paper, we present a WPLS testbed implementation for independent performance and security evaluations. The testbed is based on off-the-shelf hardware and utilizes the IEEE 802.15.4 communication standard for key extraction and secret key rate estimation in real-time. The testbed can include generically multiple transceivers to simulate legitimate parties or eavesdropper. We believe with the testbed we provide a first step to make experimental-based WPLS research results comparable. As an example, we present evaluation results of several test cases we performed, while for further information we refer to https://pls.rub.de

Implementing a real-time capable WPLS testbed for independent performance and security analyses

Fur viele automobile Anwendungen ist Informationstechnik (IT) von zentraler Bedeutung. Wahrend die Zuverlassigkeit und Fehlertoleranz automobiler IT-Systeme weitgehend sichergestellt werden kann, beginnt sich die Absicherung gegen gezielte Eingriffe und Manipulationen erst langsam zu entwickeln. Nichtsdestotrotz existieren verschiedenste Automobilanwendungen, wie die elektronische Wegfahrsperre oder der digitale Fahrtenschreiber, welche schon jetzt sicherheitskritische Daten verarbeiten. Um auch zukunftige, komplexe Automobilanwendungen sicher realisieren zu konnen, wird IT-Sicherheit eine Schlusseltechnologie zukunftiger Fahrzeuggenerationen werden [Ross03], Wahrend OEMs aus dem Automobilbereich bei der Thematik IT-Sicherheit bisher eher auf proprietare miteinander inkompatible Entwicklungen gesetzt haben, bietet die Technologie des Trusted Computing auch im Automobilbereich zahlreiche Moglichkeiten IT-Sicherheit kostengunstig, kompatibel und zuverlassig umzusetzen. Auch wenn TC bisher eher im Server und Desktopbereich eingesetzt wird, existieren bereits erste Implementierungen [Atme06], welche auch den besonderen Anforderungen eingebetteter Systeme gerecht werden konnen.

Trusted Computing für automobile IT-Systeme

In diesem Artikel wird ein Uberblick uber leichtgewichtige Kryptographie (lightweight Cryptography) gegeben. Weiterhin werden die beiden neuen auf Hardware optimierten Chiffren DESL und PRESENT naher vorgestellt. Der anschliesende Vergleich der Implementierungsergebnisse mit anderen kurzlich vorgeschlagenen Blockchiffren wie mCrypton, HIGHT oder CLEFIA zeigt, dass DESL und PRESENT weniger Chipflache verbrauchen. Ebenfalls konnen beide Algorithmen uberraschenderweise sogar mit kurzlich veroffentlichten, auf Hardware optimierten Stromchiffren (Trivium und Grain) konkurrieren.

/pdf/hardware-optimierte-leichtgewichtige-blockchiffren-fur-rfid-4vt7fnzgss.pdf

Hardware optimierte leichtgewichtige Blockchiffren für RFID- und Sensor-Systeme

Wie beim DES-Nachfolger AES schrieb das US-amerikanische NIST 2007 einen offentlichen Wettbewerb um die Nachfolge des Hashverfahrens SHA-2 aus. Im Oktober 2012 fiel die Wahl auf Keccak. Die Autoren stellen den Hashalgorithmus vor, beschreiben eine Smartcard-Implementierung und stellen das Verfahren dem „amtierenden“ SHA-2-Standard gegenuber.

Keccak und der SHA-2

For classical fault analysis, a transient fault is required to be injected during runtime, e.g., only at a specific round. Instead, Persistent Fault Analysis (PFA) introduces a powerful class of fault attacks that allows for a fault to be present throughout the whole execution. One limitation of original PFA as introduced by Zhang et al. at CHES'18 is that the faulty values need to be known to the adversary. While this was addressed at a follow-up work at CHES'20, the solution is only applicable to a single faulty value. Instead, we use the potency of Statistical Fault Analysis (SFA) in the persistent fault setting, presenting Statistical Persistent Fault Analysis (SPFA) as a more general approach of PFA. As a result, any or even a multitude of unknown faults that cause an exploitable bias in the targeted round can be used to recover the cipher's secret key. Indeed, the undesired faults in the other rounds that occur due the persistent nature of the attack converge to a uniform distribution as required by SFA. We verify the effectiveness of our attack against LED and AES.

Christof Paar

Papers

Implementing a real-time capable WPLS testbed for independent performance and security analyses

Trusted Computing für automobile IT-Systeme

Hardware optimierte leichtgewichtige Blockchiffren für RFID- und Sensor-Systeme

Keccak und der SHA-2

SPFA: SFA on Multiple Persistent Faults