GRAPH NAME SECURITY AND CRYPTOGRAPHY *** ## NODE 1 NAME ENIGMA CRYPTANALYSIS DATE 1932 PLACE Poland - Warsaw WHO Marian Rejewski BRIEF DESCRIPTION Marian Rejewski mathematically reconstructs the operation of the Enigma machine used by Germany. The work combines permutation theory, intelligence information, and mechanized procedures, constituting an important precursor to computational cryptanalysis. LINK *** ## NODE 2 NAME BLETCHLEY PARK DATE 1939 PLACE United Kingdom - England - Bletchley WHO GOVERNMENT CODE AND CYPHER SCHOOL BRIEF DESCRIPTION Bletchley Park becomes the center of British cryptanalysis operations during World War II. Mathematicians, cryptographers, and engineers develop specialized methods and machines for analyzing encrypted communications, linking cryptography, automation, and early computing. LINK *** ## NODE 3 NAME THEORY OF SECRECY SYSTEMS DATE 1949 PLACE USA - New Jersey WHO Claude Shannon BRIEF DESCRIPTION Claude Shannon publishes a mathematical formulation of cryptographic systems and defines concepts such as perfect secrecy, entropy, and statistical properties of ciphers. The work establishes a scientific foundation for the modern analysis of cryptographic security. LINK *** ## NODE 4 NAME CTSS PASSWORDS DATE 1961 PLACE USA - Massachusetts - Cambridge WHO MIT BRIEF DESCRIPTION CTSS incorporates password authentication to separate the sessions and files of multiple users sharing the same computer. The need to control access in multiuser systems establishes one of the earliest operational problems in computer security. LINK *** ## NODE 5 NAME MULTICS PROTECTION DATE 1965 PLACE USA - Massachusetts - Cambridge WHO MIT, BELL LABORATORIES AND GENERAL ELECTRIC BRIEF DESCRIPTION Multics develops protection mechanisms, segmentation, access control, and separation between privilege levels. Its architecture influences the later design of secure operating systems and the principle of limiting the capabilities available to each process. LINK *** ## NODE 6 NAME LUCIFER DATE 1971 PLACE USA - New York WHO Horst Feistel and IBM BRIEF DESCRIPTION IBM develops the Lucifer family of ciphers through work led by Horst Feistel. Its block structure and successive rounds directly influence the later design of the Data Encryption Standard. LINK *** ## NODE 7 NAME CREEPER DATE 1971 PLACE USA WHO Bob Thomas BRIEF DESCRIPTION Creeper demonstrates a program capable of moving between computers connected through ARPANET. Although experimental and not designed as a destructive attack, it constitutes a precursor to self-propagating programs and the later problem of network malware. LINK *** ## NODE 8 NAME REAPER DATE 1972 PLACE USA WHO Ray Tomlinson BRIEF DESCRIPTION Reaper is developed to locate and remove instances of Creeper from connected systems. It is considered a conceptual precursor to automated tools designed to detect and remove unwanted software. LINK *** ## NODE 9 NAME DIFFIE-HELLMAN DATE 1976 PLACE USA - California - Stanford WHO Whitfield Diffie and Martin Hellman BRIEF DESCRIPTION Diffie and Hellman publish a method for establishing a shared key over an insecure channel without directly transmitting that key. The work publicly introduces fundamental concepts of public-key cryptography and transforms cryptographic key management. LINK *** ## NODE 10 NAME DATA ENCRYPTION STANDARD DATE 1977-01-15 PLACE USA WHO NBS BRIEF DESCRIPTION The United States adopts DES as a federal data-encryption standard. The block cipher is widely used for decades and establishes a precedent for the evaluation, standardization, and interoperable implementation of cryptographic algorithms. LINK *** ## NODE 11 NAME RSA DATE 1977 PLACE USA - Massachusetts - Cambridge WHO Ron Rivest, Adi Shamir and Leonard Adleman BRIEF DESCRIPTION RSA introduces a practical public-key cryptographic system based on arithmetic properties of large integers. It enables encryption and digital signatures without requiring both parties to share the same secret key in advance. LINK *** ## NODE 12 NAME KERBEROS DATE 1988 PLACE USA - Massachusetts - Cambridge WHO MIT BRIEF DESCRIPTION Kerberos develops an authentication protocol for insecure networks based on symmetric cryptography and tickets issued by a trusted authority. Its architecture enables users and services to authenticate without repeatedly transmitting passwords across the network. LINK *** ## NODE 13 NAME MORRIS WORM DATE 1988-11-02 PLACE USA WHO Robert Tappan Morris BRIEF DESCRIPTION The Morris worm automatically propagates among systems connected to the Internet by exploiting multiple vulnerabilities and trust mechanisms. Its impact demonstrates the ability of a self-replicating program to disrupt network infrastructure on a large scale. LINK *** ## NODE 14 NAME CERT/CC DATE 1988 PLACE USA - Pennsylvania - Pittsburgh WHO CARNEGIE MELLON UNIVERSITY BRIEF DESCRIPTION The CERT Coordination Center is established after the Morris worm incident to improve coordination in response to computer vulnerabilities and incidents. Its creation contributes to institutionalizing security response, disclosure, and analysis processes. LINK *** ## NODE 15 NAME PRETTY GOOD PRIVACY DATE 1991 PLACE USA WHO Phil Zimmermann BRIEF DESCRIPTION Pretty Good Privacy provides encryption and digital signatures for files and email through a combination of symmetric and public-key cryptography. The system extends strong cryptographic tools to individual users of personal computers. LINK *** ## NODE 16 NAME SSL DATE 1994 PLACE USA - California WHO NETSCAPE BRIEF DESCRIPTION Netscape develops Secure Sockets Layer to protect communications between browsers and servers through encryption, authentication, and integrity mechanisms. SSL establishes the direct predecessor of TLS and the security model later used by HTTPS. LINK *** ## NODE 17 NAME SHA-1 DATE 1995 PLACE USA WHO NIST BRIEF DESCRIPTION SHA-1 is standardized as a cryptographic hash function designed to produce fixed-length digests. It is widely used in digital signatures, certificates, and integrity verification before cryptanalytic advances reveal weaknesses incompatible with modern security applications. LINK *** ## NODE 18 NAME TLS 1.0 DATE 1999-01 PLACE WHO IETF BRIEF DESCRIPTION Transport Layer Security 1.0 standardizes a protocol for providing confidentiality, integrity, and authentication over network connections. TLS technically succeeds SSL and becomes essential infrastructure for protecting Internet applications. LINK *** ## NODE 19 NAME AES DATE 2001-11-26 PLACE USA WHO NIST BRIEF DESCRIPTION NIST publishes AES as a symmetric encryption standard based on the Rijndael algorithm developed by Joan Daemen and Vincent Rijmen. AES progressively replaces DES and becomes one of the most widely used block-encryption algorithms in modern systems. LINK *** ## NODE 20 NAME WPA2 DATE 2004 PLACE WHO WI-FI ALLIANCE BRIEF DESCRIPTION WPA2 adopts security mechanisms based on IEEE 802.11i and uses AES through CCMP to protect wireless networks. The standard progressively replaces earlier mechanisms with significant cryptographic weaknesses. LINK *** ## NODE 21 NAME STUXNET DATE 2010 PLACE WHO AUTHORSHIP UNCONFIRMED BRIEF DESCRIPTION Stuxnet demonstrates malware specifically designed to modify the behavior of industrial control systems. The incident shows that cyberattacks can produce physical effects through coordinated exploitation of software, operating systems, and industrial controllers. LINK *** ## NODE 22 NAME HEARTBLEED DATE 2014-04-07 PLACE WHO OPENSSL PROJECT BRIEF DESCRIPTION Heartbleed identifies an out-of-bounds read vulnerability in the implementation of the OpenSSL Heartbeat extension. The flaw allows fragments of remote process memory to be recovered and demonstrates the systemic impact of a vulnerability in a widely deployed cryptographic library. LINK *** ## NODE 23 NAME SHA-3 DATE 2015-08-05 PLACE USA WHO NIST BRIEF DESCRIPTION NIST publishes SHA-3 as a standard based on the Keccak algorithm. The family provides hash functions with an internal construction different from SHA-2 and expands the standardized alternatives available for integrity and cryptographic applications. LINK *** ## NODE 24 NAME TLS 1.3 DATE 2018-08 PLACE WHO IETF BRIEF DESCRIPTION TLS 1.3 simplifies the protocol, eliminates multiple obsolete cryptographic algorithms, and reduces the number of exchanges required to establish secure connections. The version strengthens security properties and decreases latency compared with previous generations. LINK *** ## NODE 25 NAME SOLARWINDS DATE 2020-12 PLACE USA WHO SOLARWINDS BRIEF DESCRIPTION The intrusion associated with SolarWinds compromises a software supply chain through legitimately distributed updates containing malicious code. The incident demonstrates the risk of relying solely on the apparent origin of software components and update mechanisms. LINK *** ## NODE 26 NAME LOG4SHELL DATE 2021-12-09 PLACE WHO APACHE SOFTWARE FOUNDATION BRIEF DESCRIPTION The vulnerability known as Log4Shell enables remote code execution in certain configurations of Apache Log4j. Its widespread presence as a software dependency demonstrates the risks associated with transitive libraries and incomplete component inventory management. LINK *** ## NODE 27 NAME POST-QUANTUM CRYPTOGRAPHY DATE 2024-08-13 PLACE USA WHO NIST BRIEF DESCRIPTION NIST publishes the first final post-quantum cryptography standards intended to protect key establishment and digital signatures against future cryptographically relevant quantum computers. The standards establish a foundation for progressively migrating from schemes vulnerable to known quantum algorithms. LINK