Breaking the Stream Cipher Whitenoise

Whitenoise is a stream cipher with specification given at http://eprint.iacr.org/2003/249. In this paper, we show that Whitenoise is extremely weak. It can be broken by solving about 80,000 linear equations. And only about 80,000 bytes keystream are needed in the attack

Achieving a log(n) Speed Up for Boolean Matrix Operations and Calculating the Complexity of the Dense Linear Algebra step of Algebraic Stream Cipher Attacks and of Integer Factorization Methods

The purpose of this paper is to calculate the running time of dense boolean matrix operations, as used in stream cipher cryptanalysis and integer factorization. Several variations of Gaussian Elimination, Strassen\u27s Algorithm and the Method of Four Russians are analyzed. In particular, we demonstrate that Strassen\u27s Algorithm is actually slower than the Four Russians algorithm for matrices of the sizes encountered in these problems. To accomplish this, we introduce a new model for tabulating the running time, tracking matrix reads and writes rather than field operations, and retaining the coefficients rather than dropping them. Furthermore, we introduce an algorithm known heretofore only orally, a ``Modified Method of Four Russians\u27\u27, which has not appeared in the literature before. This algorithm is $\log n$ times faster than Gaussian Elimination for dense boolean matrices. Finally we list rough estimates for the running time of several recent stream cipher cryptanalysis attacks

Multi-operation data encryption mechanism using dynamic data blocking and randomized substitution

Existing cryptosystems deal with static design features such as fixed sized data blocks, static substitution and apply identical set of known encryption operations in each encryption round. Fixed sized blocks associate several issues such as ineffective permutations, padding issues, deterministic brute force strength and known-length of bits which support the cracker in formulating of modern cryptanalysis. Existing static substitution policies are either not optimally fit for dynamic sized data blocks or contain known S-box transformation and fixed lookup tables. Moreover, static substitution does not directly correlate with secret key due to which it has not been shown safer especially for Advanced Encryption Standard (AES) and Data Encryption Standard (DES). Presently, entire cryptosystems encrypt each data block with identical set of known operations in each iteration, thereby lacked to offer dynamic selection of encryption operation. These discussed, static design features are fully known to the cracker, therefore caused the practical cracking of DES and undesirable security pitfalls against AES as witnessed in earlier studies. Various studies have reported the mathematical cryptanalysis of AES up to full of its 14 rounds. Thus, this situation completely demands the proposal of dynamic design features in symmetric cryptosystems. Firstly, as a substitute to fixed sized data blocks, the Dynamic Data Blocking Mechanism (DDBM) has been proposed to provide the facility of dynamic sized data blocks. Secondly, as an alternative of static substitution approach, a Randomized Substitution Mechanism (RSM) has been proposed which can randomly modify session-keys and plaintext blocks. Finally, Multi-operation Data Encryption Mechanism (MoDEM) has been proposed to tackle the issue of static and identical set of known encryption operations on each data block in each round. With MoDEM, the encryption operation can dynamically be selected against the desired data block from the list of multiple operations bundled with several sub-operations. The methods or operations such as exclusive-OR, 8-bit permutation, random substitution, cyclic-shift and logical operations are used. Results show that DDBM can provide dynamic sized data blocks comparatively to existing approaches. Both RSM and MoDEM fulfill dynamicity and randomness properties as tested and validated under recommended statistical analysis with standard tool. The proposed method not only contains randomness and avalanche properties but it also has passed recommended statistical tests within five encryption rounds (significant than existing). Moreover, mathematical testing shows that common security attacks are not applicable on MoDEM and brute force attack is significantly resistive

Static power analysis of cryptographic devices

Side-channel attacks are proven to be efficient tools in attacking cryptographic devices. Dynamic power leakage has been used as a source for many well-known side-channel attack algorithms. As process technology size shrinks, the relative amount of static power consumption increases accordingly, and reaches a significant level in sub-100- nm chips, potentially changing the nature of side-channel analysis based on power consumption. In this thesis, we demonstrate our work in side-channel attacks exploiting static power leakage. Our research interest is particularly focused on profiled attacks. Firstly, we present recent developments of static power analysis and provide our results to further support some of the conclusions in existing publications. We also give a description of the template attack we developed for static power analysis of block ciphers. This template attack uses new distinguishers which are previously applied to other data analysis fields. The results of our study are achieved using simulations in a 45-nm and 65-nm CMOS environment, and demonstrate the viability of static-power-based template attacks. Secondly, we bring kernel density estimation into the scenario of static power analysis. We compare the performance of the kernel method and conventional Gaussian distinguisher. It is demonstrated in our experiments that the static power leakage may not satisfy multivariate Gaussian distribution, in which case the kernel method results in better attack outcomes. Thirdly, we perform template attacks on a masked S-box circuit using static and dynamic power leakage. We are the first to compare static power and dynamic power in the scenario of profiled attacks against masked devices. The attacks are shown to be successful, and by performing multiple attacks and adding Gaussian noise, we conclude that in the 45-nm environment, dynamic power analysis requires a high sampling rate for the oscilloscopes, while the results of static-power-based attacks are more sensitive to additive noise. Lastly, we attempt to combine static and dynamic power leakage in order to take the advantage of both leakage sources. With the help of deep learning technology, we are able to propose more complex schemes to combine different leakage sources. Three combining schemes are proposed and evaluated using a masked S-box circuit simulated with 45-nm library. The experiment results show that the hierarchical LSTM proposal performs the best or close to the best in all test cases

Digital watermarking methods for data security and authentication

Philosophiae Doctor - PhDCryptology is the study of systems that typically originate from a consideration of the ideal circumstances under which secure information exchange is to take place. It involves the study of cryptographic and other processes that might be introduced for breaking the output of such systems - cryptanalysis. This includes the introduction of formal mathematical methods for the design of a cryptosystem and for estimating its theoretical level of securit

Cryptographic coprocessors for embedded systems

In the field of embedded systems design, coprocessors play an important role as a component to increase performance. Many embedded systems are built around a small General Purpose Processor (GPP). If the GPP cannot meet the performance requirements for a certain operation, a coprocessor can be included in the design. The GPP can then offload the computationally intensive operation to the coprocessor; thus increasing the performance of the overall system. A common application of coprocessors is the acceleration of cryptographic algorithms. The work presented in this thesis discusses coprocessor architectures for various cryptographic algorithms that are found in many cryptographic protocols. Their performance is then analysed on a Field Programmable Gate Array (FPGA) platform. Firstly, the acceleration of Elliptic Curve Cryptography (ECC) algorithms is investigated through the use of instruction set extension of a GPP. The performance of these algorithms in a full hardware implementation is then investigated, and an architecture for the acceleration the ECC based digital signature algorithm is developed. Hash functions are also an important component of a cryptographic system. The FPGA implementation of recent hash function designs from the SHA-3 competition are discussed and a fair comparison methodology for hash functions presented. Many cryptographic protocols involve the generation of random data, for keys or nonces. This requires a True Random Number Generator (TRNG) to be present in the system. Various TRNG designs are discussed and a secure implementation, including post-processing and failure detection, is introduced. Finally, a coprocessor for the acceleration of operations at the protocol level will be discussed, where, a novel aspect of the design is the secure method in which private-key data is handle

Yeats, Bloom and the dialectics of theory, criticism and poetry

This thesis begins by showing how a strong and subtle challenge to poetry and theories of poetry has been recently argued by writers like Paul de Man and J. Hillis Miller—critics whose ironic linguistic "disfigurations" of lyrical voice have thrown poem and poet into an anti-mimetic free fall, an abyss of bewilderment or undecidability. To its credit, de Manian deconstruction strongly misreads various mimetic approaches to William Butler Yeats, as its corrosive irony empties out theories of imitation. Chapter two explains how New Criticism, biographical, psychoanalytic, and philosophical criticism, all treat Yeats's poetry as a reflection or imitation of some prior being, text, or doctrine; and chapter three how, most recently and energetically, various new historicisms treat his poems as ideological artifacts determined by the world or history, but as artifacts that must seek to change the world in order to have value. Harold Bloom's theory meets such challenges. It enacts deconstruction's misreading of poem and poet without reducing them to a linguistic abyss; and it re-envisions mimetic approaches by reading poems in terms of genealogical influence, without moralizing. Chapter four investigates Bloom's vision of strong poetry as a "supermimesis" or in terms of gnostic figures of "negative transcendence." Bloom's work, however, also needs Yeatsian creative correction. As the fifth and sixth chapters show, it needs, like Yeats's poetry, to hold itself more open to the chaos of history. Invoking instruction from the very poetry that has so influenced Bloom's theory of influence, yet from which Bloom has turned away, this thesis re-interprets Yeats's poems and Yeats criticism generally. Using Yeats's openness to history to revise Bloom and his pragmatic theory of misreading to re-interpret Yeats, the thesis attempts to advance dialectically both Yeats criticism and Bloomian theory

Yeats, Bloom and the dialectics of theory, criticism and poetry

This thesis begins by showing how a strong and subtle challenge to poetry and theories of poetry has been recently argued by writers like Paul de Man and J. Hillis Miller—critics whose ironic linguistic "disfigurations" of lyrical voice have thrown poem and poet into an anti-mimetic free fall, an abyss of bewilderment or undecidability. To its credit, de Manian deconstruction strongly misreads various mimetic approaches to William Butler Yeats, as its corrosive irony empties out theories of imitation. Chapter two explains how New Criticism, biographical, psychoanalytic, and philosophical criticism, all treat Yeats's poetry as a reflection or imitation of some prior being, text, or doctrine; and chapter three how, most recently and energetically, various new historicisms treat his poems as ideological artifacts determined by the world or history, but as artifacts that must seek to change the world in order to have value. Harold Bloom's theory meets such challenges. It enacts deconstruction's misreading of poem and poet without reducing them to a linguistic abyss; and it re-envisions mimetic approaches by reading poems in terms of genealogical influence, without moralizing. Chapter four investigates Bloom's vision of strong poetry as a "supermimesis" or in terms of gnostic figures of "negative transcendence." Bloom's work, however, also needs Yeatsian creative correction. As the fifth and sixth chapters show, it needs, like Yeats's poetry, to hold itself more open to the chaos of history. Invoking instruction from the very poetry that has so influenced Bloom's theory of influence, yet from which Bloom has turned away, this thesis re-interprets Yeats's poems and Yeats criticism generally. Using Yeats's openness to history to revise Bloom and his pragmatic theory of misreading to re-interpret Yeats, the thesis attempts to advance dialectically both Yeats criticism and Bloomian theory

The fiction of postmodernity: dialectical studies of Martin Amis, Don DeLillo and Salman Rushdie

This thesis is a dialectical study of fiction by Martin Amis, Don DeLillo and Salman Rushdie. It situates novels by these three writers in relation to a Western Marxist theoretical understanding of the postmodern and the culture of postmodernity, particularly as developed in the writings of Fredric Jameson. While the thesis is intended to demonstrate how such theoretical accounts help illuminate interpretation of contemporary, postmodern fiction, it also suggests how that fiction might provide a critique, or expose the limitations, of those theoretical or conceptual models themselves.The thesis traces, in selected examples of Amis's, DeLillo's and Rushdie's fiction, elements of dialectical conflict. It describes the means by which the texts enact simultaneously a form of ideological complicity with what Jameson (borrowing from the economist Ernst Mandel) calls 'late capitalism' and a measure of social and cultural critique. It is with this identification of both the ideological and critical features of postmodern fiction that the thesis is principally concerned.Chapter 1 charts a Western Marxist model of transition from modernism to postmodernism both through the theoretical writings of Georg Lukacs, Theodor Adorno and Fredric Jameson and through brief studies of examples of modernist and late-modernist fiction. It concludes with an acknowledgement of the difficulties Western Marxist aesthetics have had in identifying any critical potential in postmodern culture. Nonetheless, the literary studies which succeed chapter one offer lengthy discussions of postmodern fiction which carry out Jameson's insistence that a properly Marxian analysis must attempt to identify both the affirmative and the critical moments of cultural commodities. This is a step which, though acknowledging its significance, Western Marxist critics have thus far been reluctant to take.Chapters two to four, which address the work of Amis, DeLillo and Rushdie, focus particularly on issues such as the loss of a cultural (semi)autonomy in the postmodern and the effect this has had on notions of aesthetic critical distance. While they attempt to reassert the continuing worth and validity of that Western Marxist tradition of cultural critique, these studies also imply some necessary revision of its treatment of postmodernity's cultural products. This latter point is addressed in the final chapter

Data Acquisition Applications

Data acquisition systems have numerous applications. This book has a total of 13 chapters and is divided into three sections: Industrial applications, Medical applications and Scientific experiments. The chapters are written by experts from around the world, while the targeted audience for this book includes professionals who are designers or researchers in the field of data acquisition systems. Faculty members and graduate students could also benefit from the book