Applied Cryptography for Cyber Security and Defense: Information Encryption and Cyphering
Total Page:16
File Type:pdf, Size:1020Kb
Load more
Recommended publications
-
A Companion to User's Guide to Cryptography and Standards
A Companion to User’s Guide to Cryptography and Standards Alexander W. Dent Chris J. Mitchell 17th December 2004 (v1.1) ii Contents 1 Introduction 1 1.1 Scope and purpose . 2 1.2 Structure of book . 2 1.3 Terminology . 2 1.4 Modular Arithmetic . 2 1.5 Notes . 2 2 Standards and the standardisation process 3 2.1 Why bother with standards? . 4 2.2 International standardisation organisations . 4 2.3 National standardisation organisations . 4 2.4 Industrial standardisation organisations . 4 2.5 Cryptographic evaluation bodies . 4 2.6 Notes . 4 3 Security mechanisms and security services 5 3.1 Introduction . 6 3.2 Security standards . 6 3.3 A model for security . 6 3.4 Security services . 6 3.5 Security mechanisms . 6 3.6 Relating services to mechanisms . 6 3.7 Services and protocols layers . 6 3.8 Security management . 6 3.9 Security frameworks . 6 iii iv CONTENTS 3.10 Notes . 6 4 Encryption 9 4.1 Definitions and Basic Properties . 10 4.2 Block Ciphers . 10 4.3 Stream Ciphers . 10 4.4 Asymmetric Ciphers . 11 4.5 Notes . 11 5 Modes of operation for block ciphers 17 5.1 Definitions and basic properties . 18 5.2 Standards for modes of operation . 18 5.3 Padding methods . 18 5.4 Electronic Codebook (ECB) mode . 18 5.5 Cipher Block Chaining (CBC) mode . 18 5.6 Counter (CTR) mode . 18 5.7 Output Feedback (OFB) mode . 18 5.8 Cipher Feedback (CFB) mode . 18 5.9 Choosing a mode of operation . 18 5.10 Other modes . -
Key Exchange in Ipsec Revisited Formal Analysis of Ikev1 and Ikev2
Research Collection Report Key Exchange in IPsec revisited Formal Analysis of IKEv1 and IKEv2 Author(s): Cremers, Cas Publication Date: 2011 Permanent Link: https://doi.org/10.3929/ethz-a-006804260 Rights / License: In Copyright - Non-Commercial Use Permitted This page was generated automatically upon download from the ETH Zurich Research Collection. For more information please consult the Terms of use. ETH Library Key Exchange in IPsec revisited: Formal Analysis of IKEv1 and IKEv2 (Preprint?) Cas Cremers Institute of Information Security ETH Zurich, Switzerland [email protected] Abstract. The IPsec standard aims to provide application-transparent end-to-end security for the Internet Protocol. The security properties of IPsec critically depend on the underlying key exchange protocols, known as IKE (Internet Key Exchange). We provide the most extensive formal analysis so far of the current IKE versions, IKEv1 and IKEv2. We combine recently introduced formal anal- ysis methods for security protocols with massive parallelization, allowing the scope of our analysis to go far beyond previous formal analysis. While we do not find any significant weaknesses on the secrecy of the session keys established by IKE, we find several previously unreported weaknesses on the authentication properties of IKE. Keywords: Security protocols, IPsec, IKE, IKEv1, IKEv2, Formal anal- ysis, protocol interaction, multi-protocol attacks 1 Introduction IPsec [19] is an IETF protocol suite that provides Internet Protocol (IP) security. In particular, IPsec provides confidentiality, data integrity, access control, and data source authentication [17]. In contrast to, e. g., SSL/TLS [12], IPsec provides end-to-end security in an application-transparent way, i. -
Harris Sierra II, Programmable Cryptographic
TYPE 1 PROGRAMMABLE ENCRYPTION Harris Sierra™ II Programmable Cryptographic ASIC KEY BENEFITS When embedded in radios and other voice and data communications equipment, > Legacy algorithm support the Harris Sierra II Programmable Cryptographic ASIC encrypts classified > Low power consumption information prior to transmission and storage. NSA-certified, it is the foundation > JTRS compliant for the Harris Sierra II family of products—which includes two package options for the ASIC and supporting software. > Compliant with NSA’s Crypto Modernization Program The Sierra II ASIC offers a broad range of functionality, with data rates greater than 300 Mbps, > Compact form factor legacy algorithm support, advanced programmability and low power consumption. Its software programmability provides a low-cost migration path for future upgrades to embedded communications equipment—without the logistics and cost burden normally associated with upgrading hardware. Plus, it’s totally compliant with all Joint Tactical Radio System (JTRS) and Crypto Modernization Program requirements. The Sierra II ASIC’s small size, low power requirements, and high data rates make it an ideal choice for battery-powered applications, including military radios, wireless LANs, remote sensors, guided munitions, UAVs and any other devices that require a low-power, programmable solution for encryption. Specifications for: Harris SIERRA II™ Programmable Cryptographic ASIC GENERAL BATON/MEDLEY SAVILLE/PADSTONE KEESEE/CRAYON/WALBURN Type 1 – Cryptographic GOODSPEED Algorithms* ACCORDION FIREFLY/Enhanced FIREFLY JOSEKI Decrypt High Assurance AES DES, Triple DES Type 3 – Cryptographic AES Algorithms* Digital Signature Standard (DSS) Secure Hash Algorithm (SHA) Type 4 – Cryptographic CITADEL® Algorithms* SARK/PARK (KY-57, KYV-5 and KG-84A/C OTAR) DS-101 and DS-102 Key Fill Key Management SINCGARS Mode 2/3 Fill Benign Key/Benign Fill *Other algorithms can be added later. -
To Interaction Captures the Technology Shift from Mainframes to Worksta
InternetRolf Oppliger Security: Firewalls HE PARADIGM SHIFT FROM ALGORITHMS to interaction captures the technology and shift from mainframes to worksta- tionsT and networks, from number-crunching to embedded systems and graphical user interfaces, Bey and from procedure-oriented to object-based and distributed programming. The radical notion that interactive systems are more powerful problem- solving engines than algorithms is the basis for a new paradigm for computing technology built around the unifying concept of interaction. The emerging use of the TCP/IP communications perhaps, best be described as a collegial environ- protocol suite for internetworking has led to a global ment, where the users and hosts were mutually system of interconnected hosts and networks that is trusting and interested in a free and open exchange commonly referred to as the Internet. During the of information. In this environment, the people on last decade, the Internet has experienced a tri- the Internet were the people who actually built the umphant advance. Projections based on its current Internet. As time went on, the Internet became more rate of growth suggest there will be over one million useful and reliable, and these people were joined by computer networks and well over one billion users others. With fewer goals in common and more peo- by the end of the century. Therefore, the Internet is ple, the Internet steadily twisted away from its orig- seen as the first incarnation of a national information inal intent. infrastructure (NII) as promoted by the U.S. govern- Today, the Internet environment is much less col- ment. legial and trustworthy. -
A History of U.S. Communications Security (U)
A HISTORY OF U.S. COMMUNICATIONS SECURITY (U) THE DAVID G. BOAK LECTURES VOLUME II NATIONAL SECURITY AGENCY FORT GEORGE G. MEADE, MARYLAND 20755 The information contained in this publication will not be disclosed to foreign nationals or their representatives without express approval of the DIRECTOR, NATIONAL SECURITY AGENCY. Approval shall refer specifically to this publication or to specific information contained herein. JULY 1981 CLASSIFIED BY NSA/CSSM 123-2 REVIEW ON 1 JULY 2001 NOT RELEASABLE TO FOREI6N NATIONALS SECRET HA~mLE YIA COMINT CIIA~HJELS O~JLY ORIGINAL (Reverse Blank) ---------- • UNCLASSIFIED • TABLE OF CONTENTS SUBJECT PAGE NO INTRODUCTION _______ - ____ - __ -- ___ -- __ -- ___ -- __ -- ___ -- __ -- __ --- __ - - _ _ _ _ _ _ _ _ _ _ _ _ iii • POSTSCRIPT ON SURPRISE _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ I OPSEC--------------------------------------------------------------------------- 3 ORGANIZATIONAL DYNAMICS ___ -------- --- ___ ---- _______________ ---- _ --- _ ----- _ 7 THREAT IN ASCENDANCY _________________________________ - ___ - - _ -- - _ _ _ _ _ _ _ _ _ _ _ _ 9 • LPI _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ I I SARK-SOME CAUTIONARY HISTORY __ --- _____________ ---- ________ --- ____ ----- _ _ 13 THE CRYPTO-IGNITION KEY __________ --- __ -- _________ - ---- ___ -- ___ - ____ - __ -- _ _ _ 15 • PCSM _ _ _ _ _ _ _ _ _ _ _ _ _ _ -
Information Security and Cryptography
Information Security and Cryptography Series Editors David Basin Kenny Paterson Advisory Board Michael Backes Gilles Barthe Ronald Cramer Ivan Damgård Andrew D. Gordon Joshua D. Guttman Christopher Kruegel Ueli Maurer Tatsuaki Okamoto Adrian Perrig Bart Preneel More information about this series at http://www.springer.com/series/4752 Colin Boyd • Anish Mathuria • Douglas Stebila Protocols for Authentication and Key Establishment Second Edition Colin Boyd Anish Mathuria Department of Information Security Dhirubhai Ambani Institute and Communication Technology of Information and Communication Norwegian University of Science Technology (DA-IICT) and Technology Gandhinagar, Gujarat, India Trondheim, Norway Douglas Stebila Department of Combinatorics and Optimization University of Waterloo Waterloo, ON, Canada Originally published under: Boyd C. and Mathuria A. ISSN 1619-7100 ISSN 2197-845X (electronic) Information Security and Cryptography ISBN 978-3-662-58145-2 ISBN 978-3-662-58146-9 (eBook) https://doi.org/10.1007/978-3-662-58146-9 © Springer-Verlag GmbH Germany, part of Springer Nature 2003, 2020 This work is subject to copyright. All rights are reserved by the Publisher, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilms or in any other physical way, and transmission or information storage and retrieval, electronic adaptation, computer software, or by similar or dissimilar methodology now known or hereafter developed. The use of general descriptive names, registered names, trademarks, service marks, etc. in this publication does not imply, even in the absence of a specific statement, that such names are exempt from the relevant protective laws and regulations and therefore free for general use. -
CS 6004-CYBER-FORENSICS.Pdf
VELTECH HIGHTECH Dr.RANGARAJAN Dr.SAKUNTHALA ENGINEERING COLLEGE DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING CS6004- CYBER FORENSICS UNIT I NETWORK LAYER SECURITY &TRANSPORT LAYER SECURITY IPSec Protocol - IP Authentication Header - IP ESP - Key Management Protocol for IPSec. Transport layer Security: SSL protocol, Cryptographic Computations – TLS Protocol. 1.IPSec Protocol ➢ IPSec is designed to protect communication in a secure manner by using TCP/IP. ➢ The IPSec protocol is a set of security extensions developed by the IETF and it provides privacy and authentication services at the IP layer by using modern cryptography. ➢ There are two main transformation types that form the basics of IPSec: ✓ The Authentication Header (AH) and ✓ The Encapsulating Security Payload (ESP). ➢ Both AH and ESP are two protocols that provide connectionless integrity, data origin authentication, confidentiality and an anti-replay service. ➢ These protocols may be applied alone or in combination to provide a desired set of security services for the IP layer. They are configured in a data structure called a Security Association (SA). ➢ The basic components of the IPSec security architecture are explained in terms of the following functionalities: ✓ Security Protocols for AH and ESP ✓ Security Associations for policy management and traffic processing ✓ Manual and automatic key management for the Internet Key Exchange (IKE), the Oakley key determination protocol and ISAKMP. ✓ Algorithms for authentication and encryption ➢ The seven-group documents describing the set of IPSec protocols are explained in the following: ✓ Architecture: The main architecture document covers the general concepts, security requirements, definitions and mechanisms defining IPSec technology. ✓ ESP: This document covers the packet format and general issues related to the use of the ESP for packet encryption and optional authentication. -
Authenticated Diffie-Hellman Key Agreement Scheme That Protects Client Anonymity and Achieves Half-Forward Secrecy
Hindawi Publishing Corporation Mobile Information Systems Volume 2015, Article ID 354586, 7 pages http://dx.doi.org/10.1155/2015/354586 Research Article Authenticated Diffie-Hellman Key Agreement Scheme that Protects Client Anonymity and Achieves Half-Forward Secrecy Hung-Yu Chien Department of Information Management, National Chi-Nan University, 470 University Road, Puli, Nantou, Taiwan Correspondence should be addressed to Hung-Yu Chien; [email protected] Received 3 January 2015; Revised 30 March 2015; Accepted 12 April 2015 Academic Editor: Francesco Gringoli Copyright © 2015 Hung-Yu Chien. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Authenticated Diffie-Hellman key agreement (D-H key) is the de facto building block for establishing secure session keys inmany security systems. Regarding the computations of authenticated D-H key agreement, the operation of modular exponentiation is the most expensive computation, which incurs a heavy loading on those clients where either their computational capacities or their batteries are limited and precious. As client’s privacy is a big concern in several e-commerce applications, it is desirable to extend authenticated D-H key agreement to protect client’s identity privacy. This paper proposes a new problem: the modified elliptic curves computational Diffie-Hellman problem (MECDHP) and proves that the MECDHP is as hard as the conventional elliptic curves computational Diffie-Hellman problem (ECDHP). Based on the MECDHP, we propose an authenticated D-H key agreement scheme which greatly improves client computational efficiency and protects client’s anonymity from outsiders. -
NSA's Survaliance of the Internet
NSA’s survaliance of the internet Can open-source help? KLID presentation May 21, 2015 Luke Herbert [email protected] Professionelle Keld Simonsen [email protected] Linux-Interessenter Can open-sourcei Danmark help? May 21, 2015 1/ 82 → Contents 1 Introduction 2 Tailored Access Operations 3 Data Collection 4 Analysis 5 Hacking (Malware) 6 Cryptography 7 Using the Data 8 Open-Source Possibilities 9 Conclusion Can open-source help? May 21, 2015 2/ 82 Introduction → NSA National Security Agency (NSA) ”The National Security Agency/Central Security Service (NSA/CSS) leads the U.S. Government in cryptology that encompasses both Signals Intelligence (SIGINT) and Information Assurance (IA) products and services, and enables Computer Network Operations (CNO) in order to gain a decision advantage for the Nation and our allies under all circumstances.” Can open-source help? May 21, 2015 3/ 82 Introduction → 5 Eyes The 5 Eyes alliance (FVEY) UKUSA Agreement • Great Britain • New Zeeland • Canada • Australia Founded August 1941 Backbone STONEGHOST Intel Network Can open-source help? May 21, 2015 4/ 82 Introduction → Partners Partners as of 2013 Glenn Greenwald: No Place To Hide, May-2014. Can open-source help? May 21, 2015 5/ 82 Introduction → Edward Snowden Edward Snowden • Born: 21 June, 1983 • 2006: CIA System admin. • 2009: Dell Consultant at NSA • One of approx. 1000 NSA admins authorised to access almost all systems. • 2010: NSA allows USB sticks to be used in secure areas. • 2013: Charged with Theft of government property, unauthorized communication of national defense information, and ... Can open-source help? May 21, 2015 6/ 82 Introduction → Publication Edward Snowden (ES) • ES stationed at the NSA’s Remote Operations Center facility in Hawaii. -
A Usability Study of Post-Quantum Algorithms
MARCUS KINDBERG Printed by Tryckeriet i E-huset, Lund 2017 Printed by Tryckeriet A usability study of post-quantum algorithms MARCUS KINDBERG MASTER´S THESIS DEPARTMENT OF ELECTRICAL AND INFORMATION TECHNOLOGY FACULTY OF ENGINEERING | LTH | LUND UNIVERSITY A usability study of post-quantum algorithms Series of Master’s theses Department of Electrical and Information Technology LUND 2017 LU/LTH-EIT 2017-583 http://www.eit.lth.se A usability study of post-quantum algorithms Marcus Kindberg [email protected] Department of Electrical and Information Technology Lund University Principal supervisor: Paul Stankovski Assistant supervisors (Advenica AB): Niklas Lindskog, Sebastian Mauritsson and Alexander Nilsson Examiner: Thomas Johansson June 13, 2017 c 2017 Printed in Sweden Tryckeriet i E-huset, Lund Abstract There is a non-negligible risk that a quantum computer capable of breaking most modern public key encryption will be invented within the next couple of decades. All data that have to stay secret for more than 10-20 years should therefore be en- crypted using quantum-resistant algorithms. There are different ways of approach- ing the problem of quantum security and the currently existing quantum-resistant algorithms for encryption and key exchange can be divided into four categories; Lattice-based, Supersingular elliptic curves, Code-based and Multivariate. The performance of the algorithms in the different categories varies and to evaluate the strengths and weaknesses of each, further study is needed. This thesis provides an overview of algorithms in each category, a comparison of existing implementa- tions of algorithms from the first three categories, and an evaluation of the results. -
Improving Copy Protection for Mobile Apps
INSTITUT FÜR INFORMATIK DER TECHNISCHEN UNIVERSITÄT MÜNCHEN Dissertation zum Erreichen des akademischen Grades eines Dr. rer. nat. (Doktor der Naturwissenschaften) Improving Copy Protection for Mobile Apps Nils Timotheus Kannengießer INSTITUT FÜR INFORMATIK DER TECHNISCHEN UNIVERSITÄT MÜNCHEN Improving Copy Protection for Mobile Apps Nils Timotheus Kannengießer Vollständiger Abdruck der von der Fakultät für Informatik der Technischen Universität München zur Erlangung des akademischen Grades eines Doktors der Naturwissenschaften (Dr. rer. nat.) genehmigten Dissertation. Vorsitzende/r: Univ. Prof. Dr. Claudia Eckert Prüfer/in der Dissertation: 1. Univ. Prof. Dr. Uwe Baumgarten 2. Prof. Sejun Song, Ph.D. Die Dissertation wurde am 10.08.2016 bei der Technischen Universität München eingereicht und durch die Fakultät für Informatik am 16.11.2016 angenommen. “Copy protection is never perfect” [1] Thomas Aura, Dieter Gollmann Acknowledgements 1 Acknowledgements First of all, I would like to thank my main supervisor Prof. Dr. Uwe Baumgarten, who was always available to discuss any open questions. He also provided many helpful hints during the writing of this dissertation. Ultimately, he gave me the required workspace and utilities as part of my job at TUM, which surely helped me in finishing this document within the recent years. During this time, I highly enjoyed my work as a Teaching/Research Associate at TUM in introducing students to Android, and working closely together on interesting projects with major industry partners from both Germany and the US. Moreover, I would like to thank Prof. Sejun Song, PhD for the feedback he provided as well as his engagement in related research papers throughout these years. He also provided students and me helpful hints in paper writing. -
Measuring and Securing Cryptographic Deployments
University of Pennsylvania ScholarlyCommons Publicly Accessible Penn Dissertations 2019 Measuring And Securing Cryptographic Deployments Luke Taylor Valenta University of Pennsylvania, [email protected] Follow this and additional works at: https://repository.upenn.edu/edissertations Part of the Computer Sciences Commons Recommended Citation Valenta, Luke Taylor, "Measuring And Securing Cryptographic Deployments" (2019). Publicly Accessible Penn Dissertations. 3507. https://repository.upenn.edu/edissertations/3507 This paper is posted at ScholarlyCommons. https://repository.upenn.edu/edissertations/3507 For more information, please contact [email protected]. Measuring And Securing Cryptographic Deployments Abstract This dissertation examines security vulnerabilities that arise due to communication failures and incentive mismatches along the path from cryptographic algorithm design to eventual deployment. I present six case studies demonstrating vulnerabilities in real-world cryptographic deployments. I also provide a framework with which to analyze the root cause of cryptographic vulnerabilities by characterizing them as failures in four key stages of the deployment process: algorithm design and cryptanalysis, standardization, implementation, and endpoint deployment. Each stage of this process is error-prone and influenced by various external factors, the incentives of which are not always aligned with security. I validate the framework by applying it to the six presented case studies, tracing each vulnerability back to communication