Hardware Comparison of the ISO/IEC 29192-2 Block Ciphers

As ubiquitous computing becomes a reality, sensitive information is increasingly processed and transmitted by smart cards, mobile devices and various types of embedded systems. This has led to the requirement of a new class of lightweight cryptographic algorithm to ensure security in these resource constrained environments. The International Organization for Standardization (ISO) has recently standardised two low-cost block ciphers for this purpose, Clefia and Present. In this paper we provide the first comprehensive hardware architecture comparison between these ciphers, as well as a comparison with the current National Institute of Standards and Technology (NIST) standard, the Advanced Encryption Standard.

Trio Performance with 'Faint' at "Sounds New Contemporary Music Festival":Graphic Scores and Free improvisation: Canterbury, Kent

The programme contained a performance by the trio FAINT (Pedro Rebelo - Piano and instru- mental parasites, Franziska Schroeder - Saxophone and Steve Davis - Drums). The performance includes short electroacoustic works based on the trio's free improvisation and a performance of Rebelo's Cipher Series graphic scores.

Composing with Graphics: Revealing the Compositional Process through Performance.

The research presented here is product of a practice-based process that primarily generates knowledge through collaboration and exchange in performance situations. This collaboration and exchange with various musicians over a period of five years that constitutes a body of practice that is here reflected upon. The paper focuses on non-instructional graphic scores and presents some insights based on performances of works by the author. We address how composition processes are revealed in graphic scores by looking at the conditions of decision making at the point of preparing a performance. We argue that three key elements are at play in the interpretation of these types of graphic scores: performance practice, mapping and musical form. By reflecting particularly on the work Cipher Series (Rebelo, 2010) we offer insights into the strategies for approaching the performance of graphic scores that go beyond symbolic codification.

On the Security of Balanced Encoding Countermeasures

Most cryptographic devices should inevitably have a resistance against the threat of side channel attacks. For this, masking and hiding schemes have been proposed since 1999. The security validation of these countermeasures is an ongoing research topic, as a wider range of new and existing attack techniques are tested against these countermeasures. This paper examines the side channel security of the balanced encoding countermeasure, whose aim is to process the secret key-related data under a constant Hamming weight and/or Hamming distance leakage. Unlike previous works, we assume that the leakage model coefficients conform to a normal distribution, producing a model with closer fidelity to real-world implementations. We perform analysis on the balanced encoded PRINCE block cipher with simulated leakage model and also an implementation on an AVR board. We consider both standard correlation power analysis (CPA) and bit-wise CPA. We confirm the resistance of the countermeasure against standard CPA, however, we find with a bit-wise CPA that we can reveal the key with only a few thousands traces.

An Enhanced WLAN Security System With FPGA Implementation for Multimedia Applications

Maintaining a high level of data security with a low impact on system performance is more challenging in wireless multimedia applications. Protocols that are used for wireless local area network (WLAN) security are known to significantly degrade performance. In this paper, we propose an enhanced security system for a WLAN. Our new design aims to decrease the processing delay and increase both the speed and throughput of the system, thereby making it more efficient for multimedia applications. Our design is based on the idea of offloading computationally intensive encryption and authentication services to the end systems’ CPUs. The security operations are performed by the hosts’ central processor (which is usually a powerful processor) before delivering the data to a wireless card (which usually has a low-performance processor). By adopting this design, we show that both the delay and the jitter are significantly reduced. At the access point, we improve the performance of network processing hardware for real-time cryptographic processing by using a specialized processor implemented with field-programmable gate array technology. Furthermore, we use enhanced techniques to implement the Counter (CTR) Mode with Cipher Block Chaining Message Authentication Code Protocol (CCMP) and the CTR protocol. Our experiments show that it requires timing in the range of 20–40 μs to perform data encryption and authentication on different end-host CPUs (e.g., Intel Core i5, i7, and AMD 6-Core) as compared with 10–50 ms when performed using the wireless card. Furthermore, when compared with the standard WiFi protected access II (WPA2), results show that our proposed security system improved the speed to up to 3.7 times.

Recueil de lettres et de pièces originales, et de copies de pièces indiquées comme telles dans le dépouillement qui suit.

Contient : 1 Lettres patentes du roi « CHARLES [IX]... pour l'allienacion du dommaine » en Piémont et dans le marquisat de Saluces. Copie ; 2 « La Teneur des lectres patentes du roy... CHARLES [IX]... octroiées à monseigneur le duc de Nyvernois, pair de France, pour l'alienacion d'aucuns ses immeubles pour l'acquict des debtes de sa maison... Donné à Paris, le vingt quatriesme jour de janvier, l'an de grace mil cinq cens soixante trois... ensemble de l'arrest de la court de parlement à Paris sur icelles intervenu... Faict en parlement, le quinziesme jour d'avril, l'an mil cinq cens soixante quatre, apres Pasques ». Copie ; 3 « Deliberations pour les affaires de monseigneur le duc de Nivernoys ». Copie ; 4 « Double de la lectre escrite par messeigneurs les president SEGUIER et conseiller LAMOIGNON à messieurs des comptes et officiers locaux des terres de monseigneur le duc de Nyvernois,... A Paris, ce... XXe jour de may M.V.C.LXIIII » ; 5 « Double de lectre escrite à messieurs les gens des comptes de monseigneur le duc de Nyvernois,... A Paris, ce IIe jour de juin 1564 » ; 6 « Double de la lectre escripte à monseigneur Du Rezay,... A Paris, ce IIe jour de juin 1564 » ; 7 « Doubles de lectres escrites à plusieurs officiers de monseigneur le duc de Nyvernois, touchant l'alienacion d'aucunes des terres de mondict seigneur... A Paris, ce IIe jour de juin 1564 » ; 8 « Advis donn par les anciens serviteurs de la maison de Nevers sur les terres moins dommageables à vendre pour l'acquict des rentes ». Copie ; 9 « Lectres de messieurs des comptes de Nevers à messeigneurs les president Seguier et conseiller Lamoignon,... De Nevers, ce XVIe jour de may 1564 ». Copie ; 10 « Advis de messieurs des comptes de Nevers ». Copie ; 11 « Advis... sur la deliberacion des gens des comptes de Nevers... Le vingt neufiesme jour de may M.V.C.LXIIII » ; 12 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Vienne, ce XVIII de mars 1576 » ; 13 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Vienne, ce deuxiesme jour d'avril 1576 » ; 14 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Vienne, ce 15e d'apvril 1576 » ; 15 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Vienne, ce XVI d'avril 1576 » ; 16 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Vienne, ce XXIII d'avril 1576 » ; 17 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Vienne, ce 24e d'apvril 1576 » ; 18 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Vienne, ce XXIe de may 1576 » ; 19 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Vienne, ce XXe de may 1576 » ; 20 Lettre de « D. L'ABBE,... à monseigneur... le dúc de Nevers,... De Vienne, ce premier de jung 1576 » ; 21 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Ratisbone, le 17 jullet [15]76 » ; 22 Lettre de « DE VULCOB,... à monseigneur... le duc de Nyvernois,... De Ratisbone, ce XVII de juillet 1576 » ; 23 Lettre de « DE VULCOB » au duc de Nevers. « De Ratisbone, ce XXI de juillet 1576 » ; 24 Lettre de « DE VULCOB » au duc de Nevers. « De Ratisbone, ce XI d'aoust 1576 » ; 25 Lettre de « D. L'ABBE » au duc de Nevers. « De Ratisbone, ce 18e aoust 1576 » ; 26 « Minute » d'une lettre de DESIDERIO L'ABBE au « duc de Nevers » ; 27 Lettre de « DESIDERIO L'ABBE » au duc de Nevers. « De Ratisbone, ce 20e d'octobre 1576 » ; 28 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Ratisbone, ce 21e d'octobre 1576 » ; 29 Lettres patentes du roi « HENRY [III]... à nostre tres cher et amé cousin le duc de Nivernoys,... gouverneur et nostre lieutenant general en Nivernoys, et en son absence au Sr de Giry », pour qu'il fasse le dénombrement des forces militaires de la province. « Donné à Bloys, le Xe jour de janvier, l'an de grace mil cinq cens soixante dix sept ». Copie ; 30 Lettre, avec chiffre, de DESIDERIO L'ABBE « à monseigneur... le duc de Nevers,... De Prague, le 2e mars 77 » ; 31 Lettre de « D. LABBE,... à monseigneur... le duc de Nevers,... De Prague, ce XVIIe de mars [15]77 » ; 32 Procès-verbal de l'envoi « à monsieur de Montelon » d'une coppie de « l'accord faict entre le roy et monseigneur [le duc de Nevers], pour raison de la succession d'Alençon... Le XXe de mars 1577 » ; 33 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Prague, ce 8e d'apvril 1577 » ; 34 Lettre du « docteur L'ABBE,... à monseigneur... le duc de Nevers,... De Prague, ce 17e d'apvril 1577 » ; 35 Lettre du « docteur LABBE,... à monseigneur... le duc de Nevers,... De Prague, ce 17e d'apvril 1577 » ; 36 Lettre de « CATERINE [DE MEDICIS]... à... monsieur de Nevers,... De Chenonceau, ce IIIe de may » ; 37 Lettre, avec chiffre, de « DESIDERIO L'ABBE,... à monseigneur... le duc de Nevers,... De Wratislavie... 2 may 1577 » ; 38 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Wratislavie, ce 2e may 77 » ; 39 Lettre du capitaine « LARTUZE,... à monseigneur... le duc de Nivernoys,... De Pragela, ce IXme jour de may 1577 » ; 40 Lettre de « DUMORTIER » à « monseigneur le duc de Nevers,... A Lanjac, ce XXe may 1577 » ; 41 Lettre de « G[UILLAUME] DAVANSON [DE ST-MARCEL], archevesque d'Ambrun... à monseigneur... le duc de Nevers,... De Grenoble, ce XXVIe jour de may 1577 » ; 42 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Wratislavie, ce Xe de jung 1577 » ; 43 Lettre du roi « HENRY [III]... à monseigneur de Pompadour,... Escript à Poictiers, le XXVIIIe jour de juillet 1577 » ; 44 Lettre de « D. L'ABBE » áu duc de Nevers. « De Vienne, ce 3e d'aoust 77 » ; 45 Lettre de « D. L'ABBE,... à monseigneur... le duc de Nevers,... De Vienne, ce XVIe 8bre 77 » ; 46 Lettre de « D. L'ABBE » au duc de Nevers. « De Vienne, ce dernier de novembre 1577 » ; 47 Nouvelles de la cour de l'Empereur ; 48 Plaidoyer de « MARION pour le duc de Nivernoys contre le duc d'Aumalle », dans un procès sur une question de préséance. Lundi 25 mai 1579. Copie ; 49 Plaidoyer d'« HOTMAN pour Mre Charles de Lorraine,... duc d'Aumalle, deffendeur, contre Mre Charles de Gonzague, seigneur de Nevers, demandeur ». Copie ; 50 Arrêt du parlement dans le procès du duc de Nevers et du duc d'Aumalle. « Prononcé le cinquiesme jour de septembre M.V.C. soixante dix neuf ». Copie ; 51 « Estat des parroisses du païs de Berry, avec le nombre des feuz de chascune d'icelles ». Copie ; 52 « Estat de la despence que le roy veult et entan estre faicte par chascun mois de la presente année M.V.C.IIII.XX.VIII pour l'entretenement des gens de guerre estans en garnison es pays de Angoulmois, Xaintonge Brouage et Poictou ». Copie ; 53 « Coppie de lectre escripte par monseigneur [le duc DE NEVERS] à madame de Bouillon,... De Paris, ce dernier jour de septembre 1576 » ; 54 Nouvelles de la cour de France, « 29 decembre 1576 ». Copie ; 55 « Coppie d'une lectre escripte par monseigneu [le duc DE NEVERS] au Sr Desiderio [L'Abbé]... Spa, 22 aoust 1576 » ; 56 Copie d'une lettre de remerciement, sans signature ni adresse. « De Paris, ce 23 septembre 1576 » ; 57 Lettre de « LODOVICO GONZAGA [duc DE NEVERS]... monseigneur de Vulcob,... De Paris, ce 21 jung 1576 » ; 58 « Coppie d'une lectre escripte par monseigneu [le duc DE NEVERS] à monseigneur de Vulcob,... De Paris, ce XXm febvrier 1576 » ; 59 « Formulaire d'une leçon » faite au fils du duc d Nevers par BLAISE DE VIGENERE ; 60 Lettre de BLAISE DE « VIGENERE » au duc de Nevers « De vostre ville de Nevers, ce 20 jour de juillet 1593 » ; 61 « Exercitation et discours sur le premier chapitre de Frontin », leçon faite au fils du duc de Nevers pa VIGENERE

Disease-Gene Association Using a Genetic Algorithm

Understanding the relationship between genetic diseases and the genes associated with them is an important problem regarding human health. The vast amount of data created from a large number of high-throughput experiments performed in the last few years has resulted in an unprecedented growth in computational methods to tackle the disease gene association problem. Nowadays, it is clear that a genetic disease is not a consequence of a defect in a single gene. Instead, the disease phenotype is a reflection of various genetic components interacting in a complex network. In fact, genetic diseases, like any other phenotype, occur as a result of various genes working in sync with each other in a single or several biological module(s). Using a genetic algorithm, our method tries to evolve communities containing the set of potential disease genes likely to be involved in a given genetic disease. Having a set of known disease genes, we first obtain a protein-protein interaction (PPI) network containing all the known disease genes. All the other genes inside the procured PPI network are then considered as candidate disease genes as they lie in the vicinity of the known disease genes in the network. Our method attempts to find communities of potential disease genes strongly working with one another and with the set of known disease genes. As a proof of concept, we tested our approach on 16 breast cancer genes and 15 Parkinson's Disease genes. We obtained comparable or better results than CIPHER, ENDEAVOUR and GPEC, three of the most reliable and frequently used disease-gene ranking frameworks.

Disease-Gene Association Using Genetic Programming

As a result of mutation in genes, which is a simple change in our DNA, we will have undesirable phenotypes which are known as genetic diseases or disorders. These small changes, which happen frequently, can have extreme results. Understanding and identifying these changes and associating these mutated genes with genetic diseases can play an important role in our health, by making us able to find better diagnosis and therapeutic strategies for these genetic diseases. As a result of years of experiments, there is a vast amount of data regarding human genome and different genetic diseases that they still need to be processed properly to extract useful information. This work is an effort to analyze some useful datasets and to apply different techniques to associate genes with genetic diseases. Two genetic diseases were studied here: Parkinson’s disease and breast cancer. Using genetic programming, we analyzed the complex network around known disease genes of the aforementioned diseases, and based on that we generated a ranking for genes, based on their relevance to these diseases. In order to generate these rankings, centrality measures of all nodes in the complex network surrounding the known disease genes of the given genetic disease were calculated. Using genetic programming, all the nodes were assigned scores based on the similarity of their centrality measures to those of the known disease genes. Obtained results showed that this method is successful at finding these patterns in centrality measures and the highly ranked genes are worthy as good candidate disease genes for being studied. Using standard benchmark tests, we tested our approach against ENDEAVOUR and CIPHER - two well known disease gene ranking frameworks - and we obtained comparable results.

Studies,Design and Development of Network Security Enhancement Services Using Novel Cryptographic Algorithms

Internet today has become a vital part of day to day life, owing to the revolutionary changes it has brought about in various fields. Dependence on the Internet as an information highway and knowledge bank is exponentially increasing so that a going back is beyond imagination. Transfer of critical information is also being carried out through the Internet. This widespread use of the Internet coupled with the tremendous growth in e-commerce and m-commerce has created a vital need for infonnation security.Internet has also become an active field of crackers and intruders. The whole development in this area can become null and void if fool-proof security of the data is not ensured without a chance of being adulterated. It is, hence a challenge before the professional community to develop systems to ensure security of the data sent through the Internet.Stream ciphers, hash functions and message authentication codes play vital roles in providing security services like confidentiality, integrity and authentication of the data sent through the Internet. There are several ·such popular and dependable techniques, which have been in use widely, for quite a long time. This long term exposure makes them vulnerable to successful or near successful attempts for attacks. Hence it is the need of the hour to develop new algorithms with better security.Hence studies were conducted on various types of algorithms being used in this area. Focus was given to identify the properties imparting security at this stage. By making use of a perception derived from these studies, new algorithms were designed. Performances of these algorithms were then studied followed by necessary modifications to yield an improved system consisting of a new stream cipher algorithm MAJE4, a new hash code JERIM- 320 and a new message authentication code MACJER-320. Detailed analysis and comparison with the existing popular schemes were also carried out to establish the security levels.The Secure Socket Layer (SSL) I Transport Layer Security (TLS) protocol is one of the most widely used security protocols in Internet. The cryptographic algorithms RC4 and HMAC have been in use for achieving security services like confidentiality and authentication in the SSL I TLS. But recent attacks on RC4 and HMAC have raised questions about the reliability of these algorithms. Hence MAJE4 and MACJER-320 have been proposed as substitutes for them. Detailed studies on the performance of these new algorithms were carried out; it has been observed that they are dependable alternatives.

An Approach Towards The Development Of An Efficient Symmetric Key Encryption Scheme

n the recent years protection of information in digital form is becoming more important. Image and video encryption has applications in various fields including Internet communications, multimedia systems, medical imaging, Tele-medicine and military communications. During storage as well as in transmission, the multimedia information is being exposed to unauthorized entities unless otherwise adequate security measures are built around the information system. There are many kinds of security threats during the transmission of vital classified information through insecure communication channels. Various encryption schemes are available today to deal with information security issues. Data encryption is widely used to protect sensitive data against the security threat in the form of “attack on confidentiality”. Secure transmission of information through insecure communication channels also requires encryption at the sending side and decryption at the receiving side. Encryption of large text message and image takes time before they can be transmitted, causing considerable delay in successive transmission of information in real-time. In order to minimize the latency, efficient encryption algorithms are needed. An encryption procedure with adequate security and high throughput is sought in multimedia encryption applications. Traditional symmetric key block ciphers like Data Encryption Standard (DES), Advanced Encryption Standard (AES) and Escrowed Encryption Standard (EES) are not efficient when the data size is large. With the availability of fast computing tools and communication networks at relatively lower costs today, these encryption standards appear to be not as fast as one would like. High throughput encryption and decryption are becoming increasingly important in the area of high-speed networking. Fast encryption algorithms are needed in these days for high-speed secure communication of multimedia data. It has been shown that public key algorithms are not a substitute for symmetric-key algorithms. Public key algorithms are slow, whereas symmetric key algorithms generally run much faster. Also, public key systems are vulnerable to chosen plaintext attack. In this research work, a fast symmetric key encryption scheme, entitled “Matrix Array Symmetric Key (MASK) encryption” based on matrix and array manipulations has been conceived and developed. Fast conversion has been achieved with the use of matrix table look-up substitution, array based transposition and circular shift operations that are performed in the algorithm. MASK encryption is a new concept in symmetric key cryptography. It employs matrix and array manipulation technique using secret information and data values. It is a block cipher operated on plain text message (or image) blocks of 128 bits using a secret key of size 128 bits producing cipher text message (or cipher image) blocks of the same size. This cipher has two advantages over traditional ciphers. First, the encryption and decryption procedures are much simpler, and consequently, much faster. Second, the key avalanche effect produced in the ciphertext output is better than that of AES.

Matrix based Cryptographic Procedure for Efficient Image Encryption

In this paper we propose a cryptographic transformation based on matrix manipulations for image encryption. Substitution and diffusion operations, based on the matrix, facilitate fast conversion of plaintext and images into ciphertext and cipher images. The paper describes the encryption algorithm, discusses the simulation results and compares with results obtained from Advanced Encryption Standard (AES). It is shown that the proposed algorithm is capable of encrypting images eight times faster than AES.

Matrix based Key Generation to Enhance Key Avalanche in Advanced Encryption Standard

In symmetric block ciphers, substitution and diffusion operations are performed in multiple rounds using sub-keys generated from a key generation procedure called key schedule. The key schedule plays a very important role in deciding the security of block ciphers. In this paper we propose a complex key generation procedure, based on matrix manipulations, which could be introduced in symmetric ciphers. The proposed key generation procedure offers two advantages. First, the procedure is simple to implement and has complexity in determining the sub-keys through crypt analysis. Secondly, the procedure produces a strong avalanche effect making many bits in the output block of a cipher to undergo changes with one bit change in the secret key. As a case study, matrix based key generation procedure has been introduced in Advanced Encryption Standard (AES) by replacing the existing key schedule of AES. The key avalanche and differential key propagation produced in AES have been observed. The paper describes the matrix based key generation procedure and the enhanced key avalanche and differential key propagation produced in AES. It has been shown that, the key avalanche effect and differential key propagation characteristics of AES have improved by replacing the AES key schedule with the Matrix based key generation procedure

Modellbildung in der algebraischen Kryptoanalyse

In der algebraischen Kryptoanalyse werden moderne Kryptosysteme als polynomielle, nichtlineare Gleichungssysteme dargestellt. Das Lösen solcher Gleichungssysteme ist NP-hart. Es gibt also keinen Algorithmus, der in polynomieller Zeit ein beliebiges nichtlineares Gleichungssystem löst. Dennoch kann man aus modernen Kryptosystemen Gleichungssysteme mit viel Struktur generieren. So sind diese Gleichungssysteme bei geeigneter Modellierung quadratisch und dünn besetzt, damit nicht beliebig. Dafür gibt es spezielle Algorithmen, die eine Lösung solcher Gleichungssysteme finden. Ein Beispiel dafür ist der ElimLin-Algorithmus, der mit Hilfe von linearen Gleichungen das Gleichungssystem iterativ vereinfacht. In der Dissertation wird auf Basis dieses Algorithmus ein neuer Solver für quadratische, dünn besetzte Gleichungssysteme vorgestellt und damit zwei symmetrische Kryptosysteme angegriffen. Dabei sind die Techniken zur Modellierung der Chiffren von entscheidender Bedeutung, so das neue Techniken entwickelt werden, um Kryptosysteme darzustellen. Die Idee für das Modell kommt von Cube-Angriffen. Diese Angriffe sind besonders wirksam gegen Stromchiffren. In der Arbeit werden unterschiedliche Varianten klassifiziert und mögliche Erweiterungen vorgestellt. Das entstandene Modell hingegen, lässt sich auch erfolgreich auf Blockchiffren und auch auf andere Szenarien erweitern. Bei diesen Änderungen muss das Modell nur geringfügig geändert werden.

File Transfer Protocol

The discourse surrounding the virtual has moved away from the utopian thinking accompanying the rise of the Internet in the 1990s. The Cyber-gurus of the last decades promised a technotopia removed from materiality and the confines of the flesh and the built environment, a liberation from old institutions and power structures. But since then, the virtual has grown into a distinct yet related sphere of cultural and political production that both parallels and occasionally flows over into the old world of material objects. The strict dichotomy of matter and digital purity has been replaced more recently with a more complex model where both the world of stuff and the world of knowledge support, resist and at the same time contain each other. Online social networks amplify and extend existing ones; other cultural interfaces like youtube have not replaced the communal experience of watching moving images in a semi-public space (the cinema) or the semi-private space (the family living room). Rather the experience of viewing is very much about sharing and communicating, offering interpretations and comments. Many of the web’s strongest entities (Amazon, eBay, Gumtree etc.) sit exactly at this juncture of applying tools taken from the knowledge management industry to organize the chaos of the material world along (post-)Fordist rationality. Since the early 1990s there have been many artistic and curatorial attempts to use the Internet as a platform of producing and exhibiting art, but a lot of these were reluctant to let go of the fantasy of digital freedom. Storage Room collapses the binary opposition of real and virtual space by using online data storage as a conduit for IRL art production. The artworks here will not be available for viewing online in a 'screen' environment but only as part of a downloadable package with the intention that the exhibition could be displayed (in a physical space) by any interested party and realised as ambitiously or minimally as the downloader wishes, based on their means. The artists will therefore also supply a set of instructions for the physical installation of the work alongside the digital files. In response to this curatorial initiative, File Transfer Protocol invites seven UK based artists to produce digital art for a physical environment, addressing the intersection between the virtual and the material. The files range from sound, video, digital prints and net art, blueprints for an action to take place, something to be made, a conceptual text piece, etc. About the works and artists: Polly Fibre is the pseudonym of London-based artist Christine Ellison. Ellison creates live music using domestic devices such as sewing machines, irons and slide projectors. Her costumes and stage sets propose a physical manifestation of the virtual space that is created inside software like Photoshop. For this exhibition, Polly Fibre invites the audience to create a musical composition using a pair of amplified scissors and a turntable. http://www.pollyfibre.com John Russell, a founding member of 1990s art group Bank, is an artist, curator and writer who explores in his work the contemporary political conditions of the work of art. In his digital print, Russell collages together visual representations of abstract philosophical ideas and transforms them into a post apocalyptic landscape that is complex and banal at the same time. www.john-russell.org The work of Bristol based artist Jem Nobel opens up a dialogue between the contemporary and the legacy of 20th century conceptual art around questions of collectivism and participation, authorship and individualism. His print SPACE concretizes the representation of the most common piece of Unicode: the vacant space between words. In this way, the gap itself turns from invisible cipher to sign. www.jemnoble.com Annabel Frearson is rewriting Mary Shelley's Frankenstein using all and only the words from the original text. Frankenstein 2, or the Monster of Main Stream, is read in parts by different performers, embodying the psychotic character of the protagonist, a mongrel hybrid of used language. www.annabelfrearson.com Darren Banks uses fragments of effect laden Holywood films to create an impossible space. The fictitious parts don't add up to a convincing material reality, leaving the viewer with a failed amalgamation of simulations of sophisticated technologies. www.darrenbanks.co.uk FIELDCLUB is collaboration between artist Paul Chaney and researcher Kenna Hernly. Chaney and Hernly developed together a project that critically examines various proposals for the management of sustainable ecological systems. Their FIELDMACHINE invites the public to design an ideal agricultural field. By playing with different types of crops that are found in the south west of England, it is possible for the user, for example, to create a balanced, but protein poor, diet or to simply decide to 'get rid' of half the population. The meeting point of the Platonic field and it physical consequences, generates a geometric abstraction that investigates the relationship between modernist utopianism and contemporary actuality. www.fieldclub.co.uk Pil and Galia Kollectiv, who have also curated the exhibition are London-based artists and run the xero, kline & coma gallery. Here they present a dialogue between two computers. The conversation opens with a simple text book problem in business studies. But gradually the language, mimicking the application of game theory in the business sector, becomes more abstract. The two interlocutors become adversaries trapped forever in a competition without winners. www.kollectiv.co.uk

FAST, PARALLEL AND SECURE CRYPTOGRAPHY ALGORITHM USING LORENZ`S ATTRACTOR

A novel cryptography method based on the Lorenz`s attractor chaotic system is presented. The proposed algorithm is secure and fast, making it practical for general use. We introduce the chaotic operation mode, which provides an interaction among the password, message and a chaotic system. It ensures that the algorithm yields a secure codification, even if the nature of the chaotic system is known. The algorithm has been implemented in two versions: one sequential and slow and the other, parallel and fast. Our algorithm assures the integrity of the ciphertext (we know if it has been altered, which is not assured by traditional algorithms) and consequently its authenticity. Numerical experiments are presented, discussed and show the behavior of the method in terms of security and performance. The fast version of the algorithm has a performance comparable to AES, a popular cryptography program used commercially nowadays, but it is more secure, which makes it immediately suitable for general purpose cryptography applications. An internet page has been set up, which enables the readers to test the algorithm and also to try to break into the cipher.