Quantum cryptography makes use of the quantum-mechanical behavior of nature for the design and analysis of cryptographic schemes. Optimally (but not always), quantum cryptography allows for the design of cryptographic schemes whose security is guaranteed solely by the laws of nature. This is in sharp contrast to standard cryptographic schemes, which can be broken in principle, i.e., when given sufficient computing power. From a theory point of view, quantum cryptography offers a beautiful interplay between the mathematics of (...) adversarial behavior and quantum information theory. In this review article, we discuss the traditional application of quantum cryptography, quantum key distribution (QKD), from a modern perspective, and we discuss some recent developments in the context of quantum two-party cooperation (2PC). QKD allows two distant parties to communicate in a provably-secure way in the presence of an outside eavesdropper, whereas 2PC is concerned with protecting information against possibly malicious insiders. We show the basic idea of constructing quantum cryptographic schemes, but we also show some connections to quantum information theory as needed for the rigorous security analyses, and we discuss some of the relevant quantum-information-theoretic results. (shrink)

As we move our social institutions from paper and ink based operations to the electronic medium, we invisibly create a type of surveillance society, a panopticon society. It is not the traditional surveillance society in which government officials follow citizens around because they are concerned about threats to the political order. Instead it is piecemeal surveillance by public and private organizations. Piecemeal though it is, It creates the potential for the old kind of surveillance on an even grander scale. The (...) panopticon is the prison environment described by Foucault in which prison cells are arranged in a large circle with the side facing the inside of the circle open to view. The guard tower is placed in the middle of the circle so that guards can see everything that goes on in every cell. When we contemplate all the electronic data that is now gathered about each of us as we move through our everyday lives --- intelligent highway systems, consumer transactions, traffic patterns on the internet, medical records, financial records, and so on --- there seems little doubt that we are moving into a panopticon. The social issues that arise from this are too numerous to detail here, but data retention is an important part of it. In the paper-and-ink world, documents are filed, files are boxed, boxes are put away or thrown away. The capacity for data retrieval and manipulation is, thereby, limited by the sheer difficulty and cost of storing, finding, searching, and manipulating large numbers of paper files. This inconvenience functions as a mechanism whereby the system forgets past information, not unlike the way we ourselves forget. However, the story is very different in the digital world; digital information is easy to store, easy to search and manipulate, and inexpensive to keep over extensive periods of time. Digitalized information systems tend, therefore, to collect extensive ancillary information and to retain this information indefinitely. Such lack of forgetfulness is likely to hamper the ability of individuals to shed their past, and start over with a clean slate. Concerns about data retention were expressed in the early literature on the social impact of computing, but for the most part the issue has dropped from sight. Rarely, has the social good of discarding accumulated personal data been addressed. In this paper, we want to make the case by examining diverse cases in which retention of information by either business or governmental institutions hinders the ability of individuals to start over or to act autonomously. We hope our argument for the good of forgetfulness will challenge the standard framework in which such issues have traditionally been debated. The privacy debate exemplifies the traditional framework insofar as it has been characterized as involving an inherent tension between, on the one hand, the needs of organizations and institutions for more accurate and efficient information systems so as to further their goals and, on the other hand, the desire of individuals to have information about them kept private. Regan argues against this framing of the privacy issue in favor of one that recognizes the social importance of personal privacy. We will examine the non-forgetfulness of information systems as a problem threatening not just individual interests but social good as well. Cryptography is often cited as the technology that will give us privacy and mediate against surveillance. One of the uses of cryptography, encryption, will allow us, some hope, to create confidentiality and relationships of trust that will facilitate many of the social arrangements we now have and perhaps make them even more secure than they are now. Electronic cash, for example, could be created in such a form that it would have the anonymity associated now with hard cash Others are less optimistic of the potential for cryptography to re-create relationships of trust in the new medium. One important point that already seems clear is that even if encryption technology will protect the confidentiality and integrity of electronic transactions and data, it will NOT stop the observation of traffic patterns on networks. This seems an important distinction to put on the table. Our patterns of communication will continue to be available, no matter what is encrypted, and an amazing amount of information can be gleaned from this data. In a sense, it means content integrity but no anonymity. This will indubitably impact how we interact and with whom we interact. (shrink)

It is generally assumed that electronic cryptography benefits democracy because it can be instrumental in protecting free speech, which is considered a cornerstone for democracy. The author argues, however, that a close look at some aspects of democratic theory suggests that matters are not really as clear-cut. The fact that encryption can be abused in many ways also poses a threat to democracy. This paradox is examined in detail.

Introduction: silence and secrecy -- Symptoms -- Cryptography -- Cryptomnesia -- Fact or fiction -- Cryptosemiotician -- Tentative conclusion -- Appendix: list of coded passages from Wittgenstein's Nachlass.

In Part 1 of this short book, Rescher provides an overview of the nature and source of Leibniz’s interest in the theory and practice of cryptanalysis, including his unsuccessful bid to secure an apprentice for John Wallis (1616-1703) with a view to perpetuating the Englishman’s remarkable deciphering abilities. In Part 2, perhaps the most interesting part of the book, Rescher offers his account of the inner workings of Leibniz’s cipher machine. Part 3 provides a brief pictorial history of such machines (...) and related technologies. Finally, in Part 4 Rescher analyzes some of Leibniz’s own relatively scant attempts at decryption. Though there is little of direct philosophical interest in this work, its account of Leibniz’s forays into the field of encryption and in particular its reconstruction of his remarkable machine are fascinating and should hold considerable appeal for those interested in Leibniz’s pursuits more broadly and in the histories of cryptography and machine design. (shrink)

Visual cryptography is a cryptographic technique that allows visual information to be encrypted so that the human optical system can perform the decryption without any cryptographic computation. The halftone visual cryptography scheme (HVCS) is a type of visual cryptography (VC) that encodes the secret image into halftone images to produce secure and meaningful shares. However, the HVC scheme has many unsolved problems, such as pixel expansion, low contrast, cross-interference problem, and difficulty in managing share images. This article (...) aims to enhance the visual quality and avoid the problems of cross-interference and pixel expansion of the share images. It introduces a novel optimization of color halftone visual cryptography (OCHVC) scheme by using two proposed techniques: hash codebook and construction techniques. The new techniques distribute the information pixels of a secret image into a halftone cover image randomly based on a bat optimization algorithm. The results show that these techniques have enhanced security levels and make the proposed OCHVC scheme more robust against different attacks. The OCHVC scheme achieves mean squared error (MSE) of 95.0%, peak signal-to-noise ratio (PSNR) of 28.3%, normalized cross correlation (NCC) of 99.4%, and universal quality index (UQI) of 99.3% on average for the six shares. Subsequently, the experiment results based on image quality metrics show improvement in size, visual quality, and security for retrieved secret images and meaningful share images of the OCHVC scheme. Comparing the proposed OCHVC with some related works shows that the OCHVC scheme is more effective and secure. (shrink)

Smart grids are designed to revolutionize the energy sector by creating a smarter, more efficient and reliable power supply network. The rise of smart grids is a response to the need for a more comprehensive and sophisticated energy system that caters to the needs of homes and businesses. Key features of smart grids include the integration of renewable energy sources, decentralized generation and advanced distribution networks. At the heart of smart grids is a sophisticated metering system, consisting of intelligent electronic (...) devices that measure energy consumption and enable two-way communication between the utility company and the consumer. The information exchanged via these devices is critical, as it includes sensitive data such as energy consumption patterns and billing information. With the rise of the Internet of Things (IoT) and Industry 4.0, the security of this information is of utmost importance. This paper delves into the security challenges faced by advanced metering infrastructure (AMI) and highlights the crucial role played by cryptography in ensuring the secure exchange of sensitive information. Cryptographic protocols such as encryption, authentication and digital signatures are essential components of a secure smart grid infrastructure. These protocols work together to ensure the confidentiality, integrity and authenticity of the information exchanged between the utility company and the consumer. (shrink)

In this text we discuss how power, mathematics and cryptography establish dialogues that are considered critical for the present, but which have influence from the past and concerns for the future. We contextualize our reflections from a historical perspective, especially in the Brazilian context, and advance the debates about how cryptography, based on mathematical theories, influenced and dynamized wars. Going a little beyond this historical context, we present some reflections concerning the role of cryptography as a means (...) of data security, one of the main discussions in contemporary society. In this reflection, we point out the position of power that the holders of this knowledge occupy, and that, in the scope of basic school, lacks important discussions for both teachers and students. (shrink)

This is a review of Yves Nievergelt, Foundations of Logic and Mathematics: Applications to Computer Science and Cryptography, Birkäuser Verlag, Boston, 2002, €90, pp. 480, ISBN 0-8176-4249-8, hardcover.

In an undated letter, Peirce claims that he can make a machine that will automatically encrypt and decrypt messages, an astonishing claim considering the state of American science during his time. In two undated manuscripts, Peirce actually describes a cryptosystem, a system for encrypting and decrypting, suggesting the use of arithmetical transformations and binary notation. The relationship between the manuscripts and the letter are discussed in the paper. The paper also describes Peirce’s cryptosystem, places it in its historical context and (...) assesses its comparative value. The paper ends with speculations on whether Peirce could really have built the machine. Considering that he understood the relationship between electricity, binary arithmetic, and Boolean logic, and was familiar with the experiences on the logical machines of his time, the paper concludes that Peirce had all the knowledge necessary to build such a machine. (shrink)

Book review r A. (2004). "Book review: Yves nievergelt, foundations of ...

The continuous development of information communication technology facilitates the conventional grid in transforming into an automated modern system. Internet-of-Things solutions are used along with the evolving services of end-users to the electricity service provider for smart grid applications. In terms of various devices and machine integration, adequate authentication is the key to an accurate source and destination in advanced metering infrastructure (AMI). Various protocols are deployed to lead the identification between two parties, which require high computation time and communicational bit (...) operations for system development. Therefore, Kerberos-based authentication protocols were designed in this study with the assistance of elliptic curve cryptography to manage the mutual authentication between two parties and reduce the time and bit operations. The protocols were evaluated in a widely adopted tool, AVISPA, which builds an understanding of the proposed protocol and ensures mutual authentication without unauthorized knowledge. In addition, upon comparing security and performance assessments to the current schemes, it was found that the protocol in this study required less time and bits to transmit information. Consequently, it effectively provides multiple security features making it suitable for resource constraint smart meters in AMI. (shrink)

A hypergroup, as a generalization of the notion of a group, was introduced by F. Marty in 1934. The first book in hypergroup theory was published by Corsini. Nowadays, hypergroups have found applications to many subjects of pure and applied mathematics, for example, in geometry, topology, cryptography and coding theory, graphs and hypergraphs, probability theory, binary relations, theory of fuzzy and rough sets and automata theory, physics, and also in biological inheritance.

Code-based cryptography is currently the second most promising post-quantum mathematical tool for quantum-resistant algorithms. Since in 2022 the first post-quantum standard Key Encapsulation Mechanism, Kyber (a latticed-based algorithm), was selected to be established as standard, and after that the National Institute of Standards and Technology post-quantum standardization call focused in code-based cryptosystems. Three of the four candidates that remain in the fourth round are code-based algorithms. In fact, the only non-code-based algorithm (SIKE) is now considered vulnerable. Due to this (...) landscape, it is crucial to update previous results about these algorithms and their functioning. The Fujisaki-Okamoto transformation is a key part of the study of post-quantum algorithms and in this work we focus our analysis on Classic McEliece, BIKE and HQC proposals, and how they apply this transformation to obtain IND-CCA semantic security. Since after security the most important parameter in the evaluation of the algorithms is performance, we have compared the performance of the code-based algorithms of the NIST call considering the same architecture for all of them. (shrink)

Language planning comprises a number of different though related aspects of linguistic activity, its proper realm ranging from the 'improvement' of existing ...

Providing Single Sign-On (SSO) between service providers and enabling service providers to share user personal attributes are critical for both users to benefit from a seamless access to their services, and service providers to realize new business opportunities. Today, however, the users have several independent, partial identities spread over different service providers. Providing SSO and attribute sharing requires that links (federations) are established between (partial) identities. In SAML 2.0 (Maler et al. 2003), the links between identities are stored and managed (...) at the network side by the identity providers (network-side identity federation). This model prevents the service providers from mass-correlating the partial identities they have, but the users must fully trust the identity providers. In this paper, we propose a complementary approach where the users have a full control of the links between their partial identities. It is a client-side identity federation approach, which relies on the introduction of a new cryptographic tool, called invariable partially blind signature scheme, that may be of independent interest. (shrink)

In the bitcoin whitepaper, Satoshi Nakamoto (2008: 2) defines an electronic coin as a chain of digital signatures. Many have since defined a bitcoin as a chain of digital signatures. This latter definition continues to appear in reports from central banks, advocacy centers, and governments, as well as in academic papers across the disciplines of law, economics, computer science, cryptography, management, and philosophy. Some have even used it to argue that what we now call bitcoin is not the real (...) bitcoin. The definition fails, however. This is important because the Chain Definition obscures Satoshi’s solution to a dilemma in the design of electronic cash, as well as the truth about bitcoin’s privacy and fungibility. In this article, I explain why the Chain Definition fails and what Satoshi likely endorsed instead. Along the way, I untangle some issues around bitcoin fungibility and clarify some others around the ontology of digital assets. (shrink)

Combining physics, mathematics and computer science, quantum computing and its sister discipline of quantum information have developed in the past few decades from visionary ideas to two of the most fascinating areas of quantum theory. General interest and excitement in quantum computing was initially triggered by Peter Shor (1994) who showed how a quantum algorithm could exponentially “speed-up” classical computation and factor large numbers into primes far more efficiently than any (known) classical algorithm. Shor’s algorithm was soon followed by several (...) other algorithms that aimed to solve combinatorial and algebraic problems, and in the years since theoretical study of quantum systems serving as computational devices has achieved tremendous progress. Common belief has it that the implementation of Shor’s algorithm on a large scale quantum computer would have devastating consequences for current cryptography protocols which rely on the premise that all known classical worst-case algorithms for factoring take time exponential in the length of their input (see, e.g., Preskill 2005). Consequently, experimentalists around the world are engaged in attempts to tackle the technological difficulties that prevent the realisation of a large scale quantum computer. But regardless whether these technological problems can be overcome (Unruh 1995; Ekert and Jozsa 1996; Haroche and Raimond 1996), it is noteworthy that no proof exists yet for the general superiority of quantum computers over their classical counterparts. -/- The philosophical interest in quantum computing is manifold. From a social-historical perspective, quantum computing is a domain where experimentalists find themselves ahead of their fellow theorists. Indeed, quantum mysteries such as entanglement and nonlocality were historically considered a philosophical quibble, until physicists discovered that these mysteries might be harnessed to devise new efficient algorithms. But while the technology for harnessing the power of 50–100 qubits (the basic unit of information in the quantum computer) is now within reach (Preskill 2018), only a handful of quantum algorithms exist, and the question of whether these can truly outperform any conceivable classical alternative is still open. From a more philosophical perspective, advances in quantum computing may yield foundational benefits. For example, it may turn out that the technological capabilities that allow us to isolate quantum systems by shielding them from the effects of decoherence for a period of time long enough to manipulate them will also allow us to make progress in some fundamental problems in the foundations of quantum theory itself. Indeed, the development and the implementation of efficient quantum algorithms may help us understand better the border between classical and quantum physics (Cuffaro 2017, 2018a; cf. Pitowsky 1994, 100), and perhaps even illuminate fundamental concepts such as measurement and causality. Finally, the idea that abstract mathematical concepts such as computability and complexity may not only be translated into physics, but also re-written by physics bears directly on the autonomous character of computer science and the status of its theoretical entities—the so-called “computational kinds”. As such it is also relevant to the long-standing philosophical debate on the relationship between mathematics and the physical world. (shrink)

Quantum physics, which offers an explanation of the world on the smallest scale, has fundamental implications that pose a serious challenge to ordinary logic. Particularly counterintuitive is the notion of entanglement, which has been explored for the past 30 years and posits an ubiquitous randomness capable of manifesting itself simultaneously in more than one place. This amazing 'non-locality' is more than just an abstract curiosity or paradox: it has entirely down-to-earth applications in cryptography, serving for example to protect financial (...) information; it also has enabled the demonstration of 'quantum teleportation', whose infinite possibilities even science-fiction writers can scarcely imagine. This delightful and concise exposition does not avoid the deep logical difficulties of quantum physics, but gives the reader the insights needed to appreciate them. From 'Bell's Theorem' to experiments in quantum entanglement, the reader will gain a solid understanding of one of the most fascinating areas of contemporary physics. (shrink)

In this paper, we propose a method to design the pseudorandom number generator using three kinds of four-wing memristive hyperchaotic systems with different dimensions as multientropy sources. The principle of this method is to obtain pseudorandom numbers with good randomness by coupling XOR operation on the three kinds of FWMHSs with different dimensions. In order to prove its potential application in secure communication, the security of PRNG based on this scheme is analyzed from the perspective of cryptography. In addition, (...) PRNG has passed the NIST 800.22 and ENT test, which shows that PRNG has good statistical characteristics. Finally, an image encryption algorithm based on PRNG is adopted. In the encryption algorithm, the optimized Arnold matrix scrambling method and the diffusion processing based on XOR are used to obtain the final encrypted image. Through the evaluation of encryption performance, it is concluded that there is no direct relationship between the pristine image and encrypted image. The results show that the proposed image encryption scheme has good statistical output characteristics and security performance in line with cryptography. (shrink)

With the proliferation of networked electronic communication came daunting capabilities to collect, process, combine and store data, resulting in hitherto unseen transformational pressure on the concepts of trust, security and privacy as we know them. The Future Internet will bring about a world where real life will integrate physical and digital life. Technology development for data linking and mining, together with unseen data collection, will lead to unwarranted access to personal data, and hence, privacy intrusion. Trust and identity lie at (...) the basis of many human interactions and transactions, and societies have developed legitimate concern for privacy being essential for freedom and creativity. The burgeoning development of the Information Society, particularly during the past fifteen years, transcended the societal readiness to respond to the transformational change evoked by ICT. We have reached the eleventh hour for the preservation of trust and privacy as elements that can be transposed into our digital future. Europe has been at the forefront in recognizing the importance of privacy protection in relation to digital data, witness the advanced European legislation in this domain. The European Commission recognizes that appropriate measures need to combine technology development with legal means, user awareness and tools supporting data controllers to comply with law in an accountable and transparent way, and that empower users with a controlling stake in managing their personal data. Activities are underway at many levels. European RTD programmes play their role in supporting research in trustworthy ICT, privacy enhancing technologies, privacy-by-design in service layers as well as in networks, enabling technologies such as cryptography, and in generalized frameworks for trust and privacy-protective identity management. (shrink)

Although this issue of the JSE, as usual, contains a diverse cocktail of interesting papers, two of those papers are sufficiently out of the ordinary to deserve a few comments. In this issue, we fearlessly address—for the second time in the JSE’s history—one of the thorniest and most interesting topics in English literature—namely, the debate over Shakespeare authorship. As some current SSE members are undoubtedly aware, many have challenged the orthodox view that the works of Shakespeare were written by the (...) person traditionally identified as the author—that is, William Shaxpere of Stratford-upon-Avon. SSE stalwart (and my editorial predecessor) Peter Sturrock tackled the topic in the JSE in 2008 (Sturrock 2008), and then several years later followed that up with a book on the subject (Sturrock 2013). What Sturrock did brilliantly was to demonstrate how one can invoke Bayesian probability theory to challenge the orthodoxy in a compelling way. For this issue, we reprint that paper and combine it with a penetrating new work on the subject by David Roper. Roper approaches the matter from a different angle than that adopted by Sturrock. He draws on the science of cryptography to argue that the true author of the Shakespeare works was Edward de Vere, the 17th Earl of Oxford. (This is also the conclusion emerging most naturally from Sturrock’s book.) Roper argues that Sixteenth-Century techniques of using codes and ciphers were both common and quite well-developed, and that these permitted concealing secret messages within apparently innocent passages of prose or poetry. Moreover, Roper marshals a great deal of historical evidence for the claim that de Vere and others had good reason to conceal de Vere’s authorship of the works attributed to Shaxpere. So I hope our readers will enjoy this excursion into what should be largely unfamiliar territory for most of them. I know I learned a great deal from these papers, and I’m pleased that the JSE can make a scientific contribution to this venerable debate. As I see it, the papers by Sturrock and Roper together constitute a fascinating and impressive full frontal assault on the orthodox view. (shrink)

The nonlocality phenomena exhibited by entangled quantum systems are certainly one of the most extraordinary aspects of quantum theory. This book discusses this phe nomenon according to several points of view, i.e., according to different interpretations of the mathematics of the quantum formalism. The several interpretations of the Copenhagen interpretation, the many worlds, the de Broglie-Bohm, quantum logics, the decohering by the environment approach and the histories approach interpretations are scrutinized and criticized in detail. Recent results on cryptography, quantum (...) bit commitment, quantum erasers and teleportation are also presented and discussed. In preparing the book we benefited from discussions with many people, but we would like, in particular, to express our gratitude to Professor B. d'Espagnat for his useful comments and suggestions. We are grateful also to Ms. L. Gentry EI-Dash for the English revision, to Dr. 1. E. Maiorino for the production of the figures and a careful reading of the manuscript, and for the statI of Plenum for advice and for having produced a nice book. Finally, the authors thank FAPESP (contract no. I 99612657-0) for a grant making this book possible. A. A. ORIB AND W. A. RODRIGUES, JR. (shrink)

Arrow’s information paradox features the most radical kind of information asymmetry by diagnosing an inherent conflict between two parties inclined to exchange information. In this paper, we argue that this paradox is more richly textured than generally supposed by current economic discussion on it and that its meaning encroaches on philosophy. In particular, we uncovers the ‘epistemic’ and more genuine version of the paradox, which looms on our cognitive lives like a sort of tax on curiosity. Finally, we sketch the (...) relation between Arrow’s information paradox and the notion of zero-knowledge proofs in cryptography: roughly speaking, zero-knowledge proofs are protocols that enable a prover to convince a verifier that a statement is true, without conveying any additional information. (shrink)

With the proliferation of networked electronic communication came daunting capabilities to collect, process, combine and store data, resulting in hitherto unseen transformational pressure on the concepts of trust, security and privacy as we know them. The Future Internet will bring about a world where real life will integrate physical and digital life. Technology development for data linking and mining, together with unseen data collection, will lead to unwarranted access to personal data, and hence, privacy intrusion. Trust and identity lie at (...) the basis of many human interactions and transactions, and societies have developed legitimate concern for privacy being essential for freedom and creativity. The burgeoning development of the Information Society, particularly during the past fifteen years, transcended the societal readiness to respond to the transformational change evoked by ICT. We have reached the eleventh hour for the preservation of trust and privacy as elements that can be transposed into our digital future. Europe has been at the forefront in recognizing the importance of privacy protection in relation to digital data, witness the advanced European legislation in this domain. The European Commission recognizes that appropriate measures need to combine technology development with legal means, user awareness and tools supporting data controllers to comply with law in an accountable and transparent way, and that empower users with a controlling stake in managing their personal data. Activities are underway at many levels. European RTD programmes play their role in supporting research in trustworthy ICT, privacy enhancing technologies, privacy-by-design in service layers as well as in networks, enabling technologies such as cryptography, and in generalized frameworks for trust and privacy-protective identity management. (shrink)

A typescript by Claude Shannon, ‘Theorems on statistical sequences’, is examined to shed light on the development of information theory. In particular, it appears that Shannon was still working out the mathematical details of his theory in the spring of 1948, just before he published ‘A mathematical theory of communication’. This is contrasted with evidence from a declassified cryptography report that Shannon’s theory was intuitively worked out in its essentials by the time he filed the report in 1945. Previous (...) interviews with Shannon, and a recent interview with a colleague of his, Brockway McMillan, confirm this picture.Keywords: History of science; History of technology; Claude Shannon; Information theory; Ergodic theory; Electrical engineering. (shrink)

A dizzying trip through the mind(s) of the provocative and influential thinker Nick Land. During the 1990s British philosopher Nick Land's unique work, variously described as “rabid nihilism,” “mad black deleuzianism,” and “cybergothic,” developed perhaps the only rigorous and culturally-engaged escape route out of the malaise of “continental philosophy” —a route that was implacably blocked by the academy. However, Land's work has continued to exert an influence, both through the British “speculative realist” philosophers who studied with him, and through the (...) many cultural producers—writers, artists, musicians, filmmakers—who have been invigorated by his uncompromising and abrasive philosophical vision. Beginning with Land's early radical rereadings of Heidegger, Nietzsche, Kant and Bataille, the volume collects together the papers, talks and articles of the mid-90s—long the subject of rumour and vague legend (including some work which has never previously appeared in print)—in which Land developed his futuristic theory-fiction of cybercapitalism gone amok; and ends with his enigmatic later writings in which Ballardian fictions, poetics, cryptography, anthropology, grammatology and the occult are smeared into unrecognisable hybrids. Fanged Noumena gives a dizzying perspective on the entire trajectory of this provocative and influential thinker's work, and has introduced his unique voice to a new generation of readers. (shrink)

This volume presents an historical and philosophical revisiting of the foundational character of Turing's conceptual contributions and assesses the impact of the work of Alan Turing on the history and philosophy of science. Written by experts from a variety of disciplines, the book draws out the continuing significance of Turing's work. The centennial of Turing's birth in 2012 led to the highly celebrated "Alan Turing Year", which stimulated a world-wide cooperative, interdisciplinary revisiting of his life and work. Turing is widely (...) regarded as one of the most important scientists of the twentieth century: He is the father of artificial intelligence, resolver of Hilbert's famous Entscheidungsproblem, and a code breaker who helped solve the Enigma code. His work revolutionized the very architecture of science by way of the results he obtained in logic, probability and recursion theory, morphogenesis, the foundations of cognitive psychology, mathematics, and cryptography. Many of Turing's breakthroughs were stimulated by his deep reflections on fundamental philosophical issues. Hence it is fitting that there be a volume dedicated to the philosophical impact of his work. One important strand of Turing's work is his analysis of the concept of computability, which has unquestionably come to play a central conceptual role in nearly every branch of knowledge and engineering. (shrink)

: Lately there is more attention paid to technological development in intelligent tutoring systems. This field is becoming an interesting topic to many researchers. In this paper, we are presenting an intelligent tutoring system for teaching DES Information Security Algorithm called DES-Tutor. The DES-Tutor target the students enrolled in cryptography course in the department Information Technology in Al-Azhar University in Gaza. Through DES-Tutor the student will be able to study course material and try the exercises of each lesson. An (...) evaluation of the DES-Tutor was carried out and the results were promising. (shrink)

We bring together some facts about the weak pigeonhole principle from bounded arithmetic, complexity theory, cryptography and abstract model theory. We characterize the models of arithmetic in which WPHP fails as those which are determined by an initial segment and prove a conditional separation result in bounded arithmetic, that PV + lies strictly between PV and S21 in strength, assuming that the cryptosystem RSA is secure.

Aura & Transvestment is a transmedia project consisting of a series of generative images, an experimental form of cryptomedia and a video essay. By describing its own powers and contradictions, the work explores notions of value, ownership, authenticity, artificial scarcity and abundance in the digital realm. The project is a critical analysis of non-fungible tokens used as proof of ownership for digital art, taking Walter Benjamin’s concept of aura as a starting point. It argues that, for tokenized art, cryptography (...) serves as an artificial source of auratic power that reverts the political potential of reproducibility falling back to a magical and ritual notion of aura. This time around the ritual performed is that of property, authenticity, ownership, markets and commodification. Finally, the article outlines alternative uses of cryptography and distributed ledger technologies to support artistic labour and proposes transvestment as a temporary counter-action for the reallocation of value from capitalist forms of production and into commons-based models of social coordination. Submitted to this journal is an adaptation of the script for the video essay, alongside other elements of the project. Please visit: https://aura-transvestment.art/. (shrink)

An Elementary Transition to Abstract Mathematics will help students move from introductory courses to those where rigor and proof play a much greater role. The text is organized into five basic parts: the first looks back on selected topics from pre-calculus and calculus, treating them more rigorously, and it covers various proof techniques; the second part covers induction, sets, functions, cardinality, complex numbers, permutations, and matrices; the third part introduces basic number theory including applications to cryptography; the fourth part (...) introduces key objects from abstract algebra; and the final part focuses on polynomials. Features: The material is presented in many short chapters, so that one concept at a time can be absorbed by the student. Two "looking back" chapters at the outset (pre-calculus and calculus) are designed to start the student's transition by working with familiar concepts. Many examples of every concept are given to make the material as concrete as possible and to emphasize the importance of searching for patterns. A conversational writing style is employed throughout in an effort to encourage active learning on the part of the student. (shrink)

World War II research into cryptography and computing produced methods, instruments and research communities that informed early research into artificial intelligence and semi-autonomous computing. Alan Turing and Claude Shannon in particular adapted this research into early theories and demonstrations of AI based on computers’ abilities to track, predict and compete with opponents. This formed a loosely bound collection of techniques, paradigms, and practices I call crypto-intelligence. Subsequent researchers such as Joseph Weizenbaum adapted crypto-intelligence but also reproduced aspects of its (...) antagonistic precepts. This was particularly true in the design and testing of chat bots. Here the ability to trick, fool, and deceive human and machine opponents was a premium, and practices of agent abuse were admired and rewarded. Recognizing the historical genesis of this particular variety of abuse can help researchers develop less antagonistic methodologies. (shrink)

The book is devoted to the contemporary stage of quantum mechanics – quantum information, and especially to its philosophical interpretation and comprehension: the first one of a series monographs about the philosophy of quantum information. The second will consider Be l l ’ s inequalities, their modified variants and similar to them relations. The beginning of quantum information was in the thirties of the last century. Its speed development has started over the last two decades. The main phenomenon is entanglement. (...) The subareas are quantum computer, quantum communication (and teleportation), and quantum cryptography. The book offers the following main conceptions, theses and hypotheses: – dualistic Phythagoreanism as a new kind among the interpretations of quantum mechanics and information: arithmetical, logical, and metamathematical one; – Gödel ’ s first incompleteness theorem is an undecidable proposition, and consequently the second one,too. – a partial rehabilitation of Hilbert ’ s program for the self-foundation of mathematics; – the dual-foundation of mathematics; – Skolemian relativity between: Cantor ’s kinds of infinity, finiteness and infinity, discreteness and continuity, completeness and incompleteness, etc.; – information is a physical quantity representing the non-reducibility of a system to its parts, particularly nonaddtivity; – there exist pure relations «by itself», which cannot be reduced to predications; – energy conservation can and should be generalized; – Einstein’ s «general covariance» or «principle of relativity» can and should be generalized to cover discrete morphisms where the notion of velocity does not make sense. (shrink)

The International Workshop on Combinatorial Algorithms was established in 1989 as the Australasian Workshop on Combinatorial Algorithms. As a consequence of the workshop's success in attracting mathematicians and computer scientists from around the world, it was decided at the 2006 meeting to go global, to change the workshop's name, and to hold it in appropriate venues around the world. The workshop supports basic research on the interface between mathematics and computing, specifically * Algorithms & Data Structures * Complexity Theory * (...) Algorithms on Graphs & Strings * Combinatorial Optimization * Cryptography & Information Security * Computational Biology * Communications Networks and many other related areas. This is Volume 1 in the series of IWOCA proceedings. See http: //www.iwoca.org/. (shrink)

The distinction between the discrete and the continuous lies at the heart of mathematics. Discrete mathematics (arithmetic, algebra, combinatorics, graph theory, cryptography, logic) has a set of concepts, techniques, and application areas largely distinct from continuous mathematics (traditional geometry, calculus, most of functional analysis, differential equations, topology). The interaction between the two – for example in computer models of continuous systems such as fluid flow – is a central issue in the applicable mathematics of the last hundred years. This (...) article explains the distinction and why it has proved to be one of the great organizing themes of mathematics. (shrink)

Coordination of a power system with the phasor measurement devices in real time on the load and generation sides is carried out within the context of smart grid studies. Power systems equipped with information systems in a smart grid pace with external security threats. Developing a smart grid which can resist against cyber threats is considered indispensable for the uninterrupted operation. In this study, a two-way secure communication methodology underpinned by a chaos-based encryption algorithm for PMU devices is proposed. The (...) proposed system uses the IEEE-14 busbar system on which the optimum PMU placement has been installed. The proposed hyperchaotic system-based encryption method is applied as a new security methodology among PMU devices. The success of results is evaluated by the completeness of data exchange, durations, the complexity of encryption-decryption processes, and strength of cryptography using a microcomputer-based implementation. The results show that the proposed microcomputer-based encryption algorithms can be directly embedded as encryption hardware units into PMU and PDC devices which have very fast signal processing capabilities taking into considerations the acceptable delay time for power system protection and measuring applications and quality metering applications which is 2 ms and 10 ms, respectively. While proposed algorithms can be used in TCP or UDP over IP-based IEEE C37.118, IEC 61850, and IEC 61850-90-5 communication frameworks, they can also be embedded into electronic cards, smartcards, or smart tokens which are utilized for authentication among smart grid components. (shrink)