29 research outputs found

    A Brief History of Cryptography

    Get PDF

    Cyber(in)security

    Get PDF
    The purpose of this article is to present three theses – (1) a cultural one: cyberspace is an advanced technical and cultural creation – it is an embodiment of dreams of numerous creators, inventors and engineers; (2) a technical one: security and cyberspace are inseparable components (hence cybersecu- rity); (3) and a paranoid one: complete security, if achievable, is not a permanent state (hence cyber(in)security). Cyberspace is conceived as a set of digital techniques used to exchange information but also as a new type of social space, partially virtual, which may constitute a being entirely separated from a physical one. A pivotal date for arising of cyberspace may be considered the year 1968 in which routing in the ARPANET network appeared and so did the first programmable logical controller (PLC). For cyberspace this will be the year 1976 – publishing of the key agreement protocol by Witfield Diffie and Martin Hellman. Development of security is correlated with warfare and armament – the military sector has historically made the most significant investments in this area

    Cyber(in)security

    Get PDF
    The purpose of this article is to present three theses – (1) a cultural one: cyberspace is an advanced technical and cultural creation – it is an embodiment of dreams of numerous creators, inventors and engineers; (2) a technical one: security and cyberspace are inseparable components (hence cybersecu- rity); (3) and a paranoid one: complete security, if achievable, is not a permanent state (hence cyber(in)security). Cyberspace is conceived as a set of digital techniques used to exchange information but also as a new type of social space, partially virtual, which may constitute a being entirely separated from a physical one. A pivotal date for arising of cyberspace may be considered the year 1968 in which routing in the ARPANET network appeared and so did the first programmable logical controller (PLC). For cyberspace this will be the year 1976 – publishing of the key agreement protocol by Witfield Diffie and Martin Hellman. Development of security is correlated with warfare and armament – the military sector has historically made the most significant investments in this area

    Internet of Things. Information Processing in an Increasingly Connected World

    Get PDF
    This open access book constitutes the refereed post-conference proceedings of the First IFIP International Cross-Domain Conference on Internet of Things, IFIPIoT 2018, held at the 24th IFIP World Computer Congress, WCC 2018, in Poznan, Poland, in September 2018. The 12 full papers presented were carefully reviewed and selected from 24 submissions. Also included in this volume are 4 WCC 2018 plenary contributions, an invited talk and a position paper from the IFIP domain committee on IoT. The papers cover a wide range of topics from a technology to a business perspective and include among others hardware, software and management aspects, process innovation, privacy, power consumption, architecture, applications

    All the King’s Men: British Codebreaking Operations: 1938-43

    Get PDF
    The Enigma code was one of the most dangerous and effective weapons the Germans wielded at the outbreak of the Second World War. The Enigma machine was capable of encrypting radio messages that seemed virtually unbreakable. In fact, there were 158,900, 000,000,000 possible combinations in any given message transmitted. On the eve of the war’s outbreak, the British had recently learned that the Poles had made significant progress against this intimidating cipher in the early 1930s. Incensed and with little help, the British Government Code & Cipher School began the war searching for a solution. Drawing from their experiences from the First World War, and under the visionary guidance of Alan Turing, Gordon Welchman, and countless others, the British created a new, mechanical approach to breaking the seemingly impossible German code. By breaking the code, they could very well save Britain

    The Roman Catholic Church in Poland after the Fall of Communism

    Full text link
    Had I written a paper about the Roman Catholic Church in Poland after the Fall of Communism in 2019, when Paul Mojzes asked me to (thank you, Paul, for your unceasing encouragement!), the writing would have been so much easier than it is now. Not easy, but easier. At that time, the situation of the Roman Catholic Church in Poland, just like life in Poland in general, seemed relatively stable, much more so than throughout most of Poland’s turbulent history or even during those 30 years since the Fall of Communism. The Church, too, seemed to be on the way to “getting back on track” after having experienced a few somewhat difficult years. In 2019 one could think that all (almost all) is well with the Church in Poland–or, will be well soon

    Lattice Sieving With G6K

    Get PDF
    Recent advances in quantum computing threaten the cryptography we use today. This has led to a need for new cryptographic algorithms that are safe against quantum computers. The American standardization organization NIST has now chosen four quantum-safe algorithms in their process of finding new cryptographic standards. Three out of the four algorithms are based on the hardness of finding a shortest vector in a lattice. The biggest threat to such schemes is lattice reduction. One of the best tools used for lattice reduction is the G6K framework. In this thesis, we study sieving algorithms and lattice reduction strategies implemented in G6K. After an introduction to cryptography, we go over the necessary preliminary lattice theory, important concepts, and related problems. Further, we look at lattice reduction where we study different approaches with a main focus on lattice sieving. We then explore the G6K framework, before finally performing some experiments using G6K. The results we get often depend on what type of lattice we are working on. Our experiments show that it is still possible to improve G6K for solving the shortest vector problem for some lattice types.Masteroppgave i informatikkINF399MAMN-INFMAMN-PRO
    corecore