Hubbry Logo
List of cryptographersList of cryptographersMain
Open search
List of cryptographers
Community hub
List of cryptographers
logo
7 pages, 0 posts
0 subscribers
Be the first to start a discussion here.
Be the first to start a discussion here.
Contribute something
List of cryptographers
List of cryptographers
List of cryptographers
View on Wikipedia
from Wikipedia

This is a list of cryptographers. Cryptography is the practice and study of techniques for secure communication in the presence of third parties called adversaries.

Pre twentieth century

[edit]

World War I and World War II wartime cryptographers

[edit]

Other pre-computer

[edit]

Modern

[edit]

See also: Category:Modern cryptographers for a more exhaustive list.

Symmetric-key algorithm inventors

[edit]

Asymmetric-key algorithm inventors

[edit]
Whitfield Diffie, Martin Hellman, Ronald Rivest, and Adi Shamir at RSA 2008

Cryptanalysts

[edit]

Algorithmic number theorists

[edit]

Theoreticians

[edit]

Government cryptographers

[edit]

Cryptographer businesspeople

[edit]

See also

[edit]

References

[edit]
[edit]
Revisions and contributorsEdit on WikipediaRead on Wikipedia

List of cryptographers

View on Grokipedia
from Grokipedia
A list of cryptographers catalogs individuals who have advanced the field of , defined as the of securing through encoding techniques that prevent unauthorized access while enabling legitimate recovery. encompasses both the creation of methods and their mathematical analysis, often drawing on , algebra, and to withstand adversarial attacks. Throughout history, cryptographers have influenced military outcomes, such as Allied code-breaking efforts in that provided decisive intelligence advantages, and modern digital infrastructure, including protocols underpinning secure online transactions and data protection. This compilation highlights pioneers whose empirical innovations and theoretical breakthroughs have demonstrably enhanced causal chains of secure , from ancient ciphers to contemporary quantum-resistant algorithms.

Pre-Modern Cryptographers (Before 1900)

Ancient and Classical Era Cryptographers

Aeneas Tacticus, a Greek military author active in the 4th century BC, provided the earliest known systematic descriptions of cryptographic techniques for securing military communications. In his treatise On the Defense of Fortified Positions (Πολιόρκητικά), particularly chapter 31, he outlined methods including substitution ciphers, where letters were replaced by numbers or symbols; steganography, such as hiding messages under wax on wooden tablets; and signaling systems using torches or flags to convey encoded information without interception. These approaches emphasized practical defense against espionage during sieges, reflecting the era's focus on transposition and concealment over complex substitution. The Spartan military employed the , a using a cylindrical baton wrapped with or leather inscribed with a message in a spiral pattern, dating to at least the and possibly earlier. Described by in his Histories as a tool for secure orders during campaigns, such as those under Lysander in the (431–404 BC), the device required a matching baton diameter for decryption, rendering intercepted messages illegible without it. This method's simplicity suited rapid field use but offered limited security against physical capture of the key tool. Cleoxenus and Democleitus, inventors credited in historical accounts from the 3rd–2nd centuries BC, developed a 5x5 grid system for encoding messages into numeric pairs, later known as the after its documentation by the historian (c. 200–118 BC). adapted this for hydraulic semaphore signaling with torches, dividing the alphabet into coordinates (e.g., 1-1 for alpha) to transmit information efficiently over distances, as detailed in his Histories Book X. While primarily for , the grid enabled substitution-based secrecy, influencing later ciphers by reducing messages to numerical sequences resistant to casual reading. Julius Caesar (100–44 BC), Roman general and statesman, utilized a monoalphabetic shifting letters by three positions (e.g., A to D) for confidential military dispatches, as recorded by in . This "" facilitated secure orders to legions during the (58–50 BC) and civil conflicts, with variations possibly employing different shifts; its strength relied on the secrecy of the fixed offset, though it remained vulnerable to given Latin's letter distributions. No other named Roman cryptographers from this era are prominently attested, underscoring cryptography's ad hoc military application rather than formalized theory.

Medieval and Renaissance Cryptographers

Al-Kindi (c. 801–873), an Arab polymath during the , is credited with developing the first systematic method of , including , which involves tallying letter occurrences in to match against known frequencies for decryption. His treatise Risalah fi'l-rumuz ( on Deciphering Cryptographic Messages) outlined techniques for breaking monoalphabetic substitution ciphers, marking a foundational advance in understanding linguistic patterns for codebreaking. This empirical approach relied on statistical probabilities derived from Arabic texts, such as the , to identify common letters like alif and lam. In the , European cryptography advanced amid diplomatic and military needs, particularly in like , where professional codebreakers emerged as state functionaries. (1404–1472), an Italian architect and scholar, invented the first in 1467, using a rotating disk with two alphabets to vary substitutions and evade . Described in De Cifris, his system employed a movable index and mixed alphabets (one standard, one with numerals and symbols), allowing key-driven shifts that produced ciphertext resistant to simple statistical attacks. Johannes Trithemius (1462–1516), a German abbot, authored Polygraphia (published 1518), the first printed book on , detailing progressive ciphers where each letter shifts by an increasing amount (e.g., +1 for the first, +2 for the second). His work also covered in Steganographia (c. 1499), blending themes with practical concealment methods, influencing later tabular ciphers. Giovan Battista Bellaso (1505–1578), an Italian, introduced a keyed in 1553's La cifra del. Sig. Giovan Battista Bellaso, using a to select rows from an tableau, generating unique substitutions per position. This autokey-like variant, predating similar claims, enhanced security by personalizing the wheel against unauthorized decryption. Blaise de Vigenère (1523–1596), a French , refined polyalphabetic techniques in 1586's Traicté des Chiffres, describing an autokey cipher where the itself extends the key stream, and promoting tableau-based encryption misattributed to him as the "Vigenère cipher." His contributions emphasized practical diplomatic use, building on Italian precedents to counter emerging cryptanalytic threats.

17th to 19th Century Cryptographers

  • Antoine Rossignol (c. 1600–1682) was a French cryptographer who gained prominence by deciphering intercepted Huguenot messages during the 1626 siege of Réalmont, using on a homophonic , which impressed and led to his appointment as royal cryptographer. He served under and later , establishing the for intercepting and decoding diplomatic correspondence. Collaborating with his son , Rossignol devised the Grand Chiffre, a complex homophonic employing over 500 symbols with variable encodings to obscure letter frequencies, which protected French state secrets for over two centuries until its solution in 1893.
  • Bonaventure Rossignol (died 1701), son of , continued the family legacy as chief cryptographer to , refining the Grand Chiffre into a system resistant to contemporary attacks by incorporating digraphs, trigraphs, and nulls alongside monosyllabic substitutions. Their work emphasized practical state security, with Bonaventure managing decryption operations that influenced French military and diplomatic decisions.
  • (1616–1703), English mathematician and Savilian Professor of Geometry at , served as chief codebreaker for Parliament during the (1642–1651), intercepting and solving Royalist ciphers, including those of James II, using systematic and pattern recognition on substitution and polyalphabetic systems. Post-Restoration, he continued cryptanalytic work for the crown until 1689, pioneering methods like estimating message lengths from probable words and advocating variable keys for enhanced security, though he published little on due to its classified nature.
  • Thomas Jefferson (1743–1826) invented the wheel cipher, or , in the early 1790s—a mechanical device comprising 36 wooden wheels, each inscribed with a randomized , allowing polyalphabetic by aligning on one index line and reading ciphertext from another. Designed for diplomatic use, it supported keys via wheel permutations and resisted through its 26^26 possible configurations, predating similar devices like the U.S. M-94 adopted in 1922; Jefferson described it in notes dated before March 1802 but did not deploy it widely.
  • Charles Babbage (1791–1871), British mathematician and inventor of the , independently solved the Vigenère around 1854 during the era by identifying repeated sequences to deduce key lengths, employing statistical methods and cribs without publishing details, which delayed formal recognition until later confirmations. His unpublished cryptanalytic insights, applied to intercepted diplomatic messages, demonstrated the vulnerability of repeating-key systems to length analysis, influencing subsequent theoretical advances.
  • Friedrich Kasiski (1805–1881), Prussian military officer and cryptographer, published Die Geheimschriften und die Dechiffrir-Kunst in 1863, introducing the —a method to break polyalphabetic ciphers like Vigenère by detecting repeated or longer sequences in , whose distances reveal key length via greatest common divisors, enabling subsequent single-alphabet attacks. This systematic approach marked a shift toward probabilistic , effective against keyword-based encryptions with periods under 20, though limited against short or non-repeating keys.

Early 20th Century Cryptographers

Pre-World War I Cryptographers

Parker Hitt (1871–1955), a U.S. Army officer, conducted early systematic for the American military, including solving encrypted Mexican diplomatic messages during his service in the from 1900 to 1906 and later at from 1911 onward. He authored the U.S. Army's first manual on codes and ciphers, establishing foundational practices amid limited institutional support for cryptology prior to sustained wartime efforts. François Cartier (1862–1953), a French military officer, served on official commissions evaluating cryptographic systems in the late 19th and early 20th centuries, contributing to France's prewar as head of the army's cryptographic bureau by 1914. His work emphasized practical military applications, bridging manual traditions with emerging needs for secure field communications. Ernst Fetterlein (1873–1945), a Russian cryptanalyst in the from 1896, specialized in breaking German, Austrian, and British diplomatic codes through and pattern recognition before 1914. His prewar successes informed Russia's early wartime intelligence advantages, relying on empirical reconstruction of codebooks without mechanical aids.

World War I Cryptographers

Georges Painvin, a and , led the of the German ADFGVX field cipher introduced on March 1, 1918, solving the first key on April 5, 1918, and achieving a full break by early June, which yielded intelligence on German troop movements during the Second Battle of the Marne. Fritz Nebel, a German radio staff officer, invented the in 1918 as a fractionating transposition system to secure mobile army communications, replacing earlier ADFGX variants amid increasing Allied intercepts. In Britain, of the Admiralty conducted naval ; Nigel de Grey and William Montgomery decrypted the Zimmermann Telegram on January 16, 1917, exposing German proposals for a Mexican alliance against the U.S., which influenced American entry into the war on April 6, 1917. Alfred Dillwyn Knox contributed to breaking German naval and diplomatic codes in , applying classical scholarship to in ciphers. Herbert O. Yardley, commissioned as a U.S. Army on June 29, 1917, headed Section 8 (MI-8), directing the decryption of over 10,000 German diplomatic messages and observing Allied methods in Europe during the war's final months. Elizebeth S. Friedman and , working for the U.S. government from 1917, pioneered statistical techniques applied to German codes, training cryptologists and establishing foundational methods for in machine-era .

Interwar Period Cryptographers

Herbert O. Yardley (1889–1958) directed the ' Cipher Bureau, known as the , from its establishment in 1919 until its disbandment in 1929, where his team decrypted thousands of foreign diplomatic messages, including Japanese codes during the of 1921–1922. The organization collaborated with the State Department to intercept and analyze cable traffic, revealing sensitive negotiations and espionage activities, though it was shut down amid budget cuts and privacy concerns under Secretary Henry Stimson. William F. Friedman (1891–1969), working for the U.S. Army's after 1930, advanced cryptanalytic techniques and machine-based methods during the interwar years, including authorship of key textbooks on and leadership in developing the organizational framework for codebreaking that persisted into . Friedman's efforts emphasized the shift toward machines and complex algorithms, recognizing their growing role in by the mid-1930s. In Poland, the Cipher Bureau (Biuro Szyfrów), formed in 1919, employed mathematicians Marian Rejewski (1906–1980), Jerzy Różycki (1909–1942), and Henryk Zygalski (1906–1978), who achieved the first breaks into the German Enigma machine in December 1932 using mathematical permutation analysis and limited message intercepts. Their interwar innovations, including cyclometer devices and perforated sheets for rapid decryption, enabled ongoing recovery of daily Enigma settings until 1939, providing critical intelligence during the Polish-Soviet War of 1919–1920 and against German threats. Gilbert Vernam (1890–1960) patented an electrical multiplexing system in 1919 that evolved into the cipher when combined with random keys, offering theoretical perfect secrecy as later formalized, though practical implementation lagged until wartime applications. Edward Hebern (1868–1952) developed one of the first rotor-based cipher machines in the early 1920s, patenting a device in 1922 that used rotating disks to substitute letters, influencing subsequent electromechanical designs like Enigma despite commercial failures.

World War II Cryptographers

Cryptosystem Designers

Fritz Menzer (1908–2005), a German cryptologist in the Wehrmacht's signals intelligence agency (In 7/VI), designed the (SG-41), a portable, hand-cranked rotor-based cipher machine introduced in 1941 for secure as a less complex alternative to the Enigma. The SG-41 featured 11 rotors and produced a 10-to-1 substitution, with production reaching approximately 5,000 units by 1944 for army field use. Menzer also contributed to evaluations and modifications of captured foreign devices, such as Swedish B-21 machines, informing German designs. Kazuo Tanabe served as chief designer of Japan's (U.S. codenamed ), an electromechanical stepping-switch system deployed by the Foreign Ministry from 1939 for diplomatic traffic, succeeding the weaker Type A (). Engineers and Eikichi assisted, incorporating 25-position switches to mimic stepping and address Red's vulnerabilities, with over 300 units built by war's end. encrypted 5-bit International Telegraph Alphabet No. 2 code, using 6 telephone-type selectors for , though its design flaws enabled U.S. cryptanalytic recovery by 1940. Oswyn George William Lywood, a , led the development of the British in 1934, which entered widespread military service by 1939 with variants like Mk VI for high-security use. Collaborators included Coulson, E.W. Smith, and Sergeant Albert Lemon; the machine employed five or six rotors (unlike Enigma's three), a reflecting plugboard, and power drive, producing output on paper tape. Over 10,000 units were manufactured during the war, securing Allied communications until the 1950s. In the United States, the (ECM Mark II) rotor cipher machine, adopted by Army and Navy in 1940, was developed by the under , with key input from Frank Rowlett; it featured 15 rotors in two independent banks for irregular stepping, ensuring resistance to known attacks. The design originated from prototypes, with final implementation using 10 cipher rotors and 5 control rotors, encrypting teletype traffic; no breaks occurred during wartime use despite intensive Axis efforts.

Cryptanalysts and Codebreakers

Cryptanalysts and codebreakers during focused on decrypting Axis cipher systems, such as the German Enigma and Japanese machines, yielding intelligence like Ultra that shortened the war by an estimated two years through Allied naval and air successes. Their work relied on mathematical innovations, captured materials, and electromechanical aids, often under secrecy oaths that delayed public recognition until the 1970s.
  • Marian Rejewski, Jerzy Różycki, and Henryk Zygalski, Polish mathematicians recruited by the Cipher Bureau in 1929, exploited Enigma's message protocols and built cyclometer devices to deduce rotor wirings by late 1932, achieving routine breaks until German changes in 1938; they delivered Enigma replicas and algorithms to British and French allies on July 26, 1939, enabling wartime continuations.
  • Alan Turing, a British mathematician at Bletchley Park's from 1939, refined Polish methods and designed the electromechanical (first operational March 1940) to test Enigma wheel settings against cribs—known plaintexts—breaking traffic by May 1941 and four-rotor naval variants by December 1942.
  • Gordon Welchman, head of Bletchley Park's Hut 6 (air and army Enigma) from 1939, enhanced the with a "Welchman diagonal board" for logical deductions from , processing up to 39,000 messages monthly by 1943 and coordinating with .
  • Dilly Knox, a veteran Admiralty cryptanalyst, manually broke early Enigma variants using captured keys and "pinch" methods pre-1939, contributing to breaks in 1940 despite health decline.
  • Hugh Alexander, succeeding Turing in by 1943, optimized procedures for three- and four-rotor Enigma, achieving 90% daily breaks by war's end through statistical cribbing and shift management.
  • William Friedman, chief of the U.S. Army's Service from 1930, directed the cryptanalytic attack on Japan's Type B () diplomatic machine, with team successes in recovering stepping mechanisms by August 1940 and full breaks by September, decrypting 10,000 messages annually via analog computers.
  • Frank Rowlett, Friedman's deputy, led the solution team from 1939, exploiting recovered and machine recoveries to reconstruct the stepping cam and plugboard equivalents by mid-1940, informing U.S. diplomacy pre-Pearl Harbor.

Mid-20th Century Cryptographers (1945-1970)

Government and Military Cryptographers

(1891–1969), a pioneering U.S. cryptologist, directed cryptographic research and development for the Armed Forces Security Agency and its successor, the (NSA), from 1949 until his retirement in 1955 due to health issues. His post-World War II efforts focused on advancing secure communications systems and training cryptanalysts to counter Soviet encryption techniques amid escalating tensions. Ann Z. Caracristi (1918–2011) served as a cryptanalyst at the NSA from its inception in 1952 through the 1960s, specializing in the exploitation of Soviet diplomatic and military communications. Recruited from wartime service at , she led teams that applied manual and early computational methods to break high-level cipher systems, contributing to U.S. successes in monitoring communist bloc activities during the and beyond. Dorothy "Dottie" Toplitzky Blum (1924–1980) worked as a cryptanalyst and computer specialist at the NSA from 1944 into the 1970s, pioneering the integration of electronic computers for codebreaking tasks in the 1950s and 1960s. Her innovations in automating cryptanalytic processes supported military intelligence operations, including the analysis of encrypted signals from adversarial states, and she advanced from code clerk to senior technical roles by 1960. Frank B. Austin (1916–2000), an Army Signal Corps officer, led cryptanalytic teams at and later NSA facilities from the late 1940s through the 1960s, focusing on and machine-aided decryption of foreign military codes. His work emphasized defensive , developing safeguards against interception that informed U.S. during early conflicts. William H. Martin (1931–2016) and Bernon S. Mitchell (1929–2001), mathematicians employed as NSA cryptologists in the 1950s, conducted advanced theoretical on Soviet systems until their to the USSR in June 1960. Their expertise in high-level enabled breakthroughs in evaluating vulnerabilities, though their subsequent revelations compromised U.S. capabilities and prompted internal security reforms at NSA.

Academic and Theoretical Contributors

Claude Elwood Shannon (1916–2001), an American mathematician and electrical engineer at Bell Laboratories, laid the mathematical foundations of modern cryptography by applying to secrecy systems. In a classified 1945 memorandum followed by his declassified 1949 publication "Communication Theory of Secrecy Systems" in the Bell System Technical Journal, Shannon defined perfect secrecy as a condition where the distribution of the given the equals the prior distribution, rendering the statistically independent of the . He proved that perfect secrecy requires the key space to be at least as large as the message space, achievable via a with a truly random key of equal length to the message, which an adversary cannot distinguish from random noise without the key. Shannon further quantified practical security limits through the concept of unicity distance, calculated as the ratio of the key length to the redundancy rate of the language (approximately 1.3 bits per letter in English), indicating the minimum ciphertext length needed for cryptanalytic uniqueness of the key. His analysis extended to product and source ciphers, showing that secrecy degrades with reuse or predictable patterns, and emphasized entropy as a measure of uncertainty in cryptosystems. These information-theoretic bounds established absolute theoretical limits on , independent of computational assumptions, and demonstrated that no system shorter than a can guarantee unconditional security against an eavesdropper with unlimited resources. Beyond Shannon, academic and theoretical advancements in during 1945–1970 were sparse, as research remained dominated by classified government efforts amid secrecy constraints, with limited public dissemination until the 1970s. Shannon's framework influenced isolated studies, such as early explorations of error-correcting codes intersecting with secure coding, but no comparable theoretical paradigms emerged from universities in this era, reflecting the field's institutional silos. His work bridged and secrecy, enabling later probabilistic models, though practical implementations awaited computational maturity.

Modern Cryptographers (1970-Present)

Public-Key and Asymmetric Cryptography Pioneers

Public-key cryptography, a cornerstone of modern asymmetric encryption systems, enables secure key exchange and digital signatures without requiring parties to share secret keys in advance, fundamentally addressing limitations in symmetric cryptography for open networks. The field's conceptual origins trace to 1970, when James H. Ellis at the British Government Communications Headquarters (GCHQ) proposed "non-secret encryption" as a theoretical framework for public dissemination of encryption keys while retaining decryption secrecy, though practical implementation eluded him and the work remained classified until 1997. Building on Ellis's vision, Clifford Cocks at GCHQ devised a viable asymmetric scheme in 1973, equivalent to the later RSA algorithm, using large prime factorization difficulty for security; this too stayed secret until declassification in 1997. Malcolm Williamson, also at GCHQ, independently developed a key agreement protocol in 1974 analogous to Diffie-Hellman, leveraging discrete logarithm problems, further advancing the classified foundations before public disclosure decades later. In the United States, and publicly introduced the paradigm in their 1976 paper "New Directions in Cryptography," proposing the protocol, which allows two parties to compute a over an insecure channel using and the hardness of the problem. Their work, published on November 1, 1976, explicitly outlined public-key distribution systems and one-way functions, earning them the 2015 for foundational contributions to secure communications. , a student, concurrently advanced related ideas through his 1974 invention of Merkle Puzzles—a probabilistic precursor—and later trapdoor knapsack functions for public-key , recognized as co-inventing core public-key concepts alongside Diffie and Hellman. The RSA cryptosystem, named after its inventors Ron Rivest, Adi Shamir, and Leonard Adleman, emerged in 1977 from MIT, providing a practical public-key encryption and signature scheme based on the integer factorization problem: users generate key pairs where encryption uses the public modulus (product of two large primes) and exponent, while decryption relies on the private factorization knowledge. Rivest conceived the approach on April 4, 1977, with Shamir and Adleman refining it; they patented it on September 20, 1983 (U.S. Patent 4,405,829), enabling widespread applications in secure data transmission. These American innovations, unburdened by classification, spurred rapid adoption and commercialization, contrasting with the delayed impact of GCHQ's earlier but undisclosed breakthroughs.

Symmetric-Key and Block Cipher Developers

Cryptographers specializing in symmetric-key and block cipher development post-1970 focused on creating algorithms that process data in fixed-length blocks using a key, emphasizing security against emerging cryptanalytic attacks while balancing efficiency for practical deployment. These efforts built on Feistel networks and substitution-permutation paradigms, leading to standards like DES and AES that underpin secure communications, data storage, and financial systems worldwide. Key innovations addressed vulnerabilities in earlier ciphers, incorporating larger key sizes, resistance to differential and , and adaptability to hardware constraints.
  • Horst Feistel (1915–1990): German-American cryptographer at IBM who invented the Feistel network structure in the late 1960s and early 1970s, enabling reversible block ciphers without needing distinct decryption functions; his Lucifer cipher, developed around 1971, served as the prototype for DES after modifications by IBM and NSA review.
  • Joan Daemen (born 1965) and Vincent Rijmen (born 1970): Belgian cryptographers who designed Rijndael in 1998, a substitution-permutation network block cipher with 128-bit blocks and variable key lengths up to 256 bits; selected by NIST as the AES standard in 2001 after a multi-year competition evaluating security margins and performance across platforms.
  • Bruce Schneier (born 1963): American cryptographer who created Blowfish in 1993, a 64-bit block with variable key lengths up to 448 bits, featuring key-dependent S-boxes for resistance to known attacks and free licensing to promote adoption in software like SSH; later led the team, an AES finalist in 1998 using a 128-bit block with advanced key scheduling and pseudorandom permutations.
  • Xuejia Lai and James Massey (1934–2013): Swiss cryptographers who developed IDEA in 1991, a 64-bit employing the Lai-Massey scheme with 128-bit keys, combining addition, XOR, and multiplication operations for proven security against at the time; initially proposed as PES and refined for commercial use in protocols like early PGP.
  • Ross Anderson (born 1956), Eli Biham (born 1960), and Lars Knudsen (born 1962): International team who designed Serpent in 1998, a 128-bit with up to 256-bit keys using a narrow-pipe Feistel-like structure with 32 rounds and conservative S-boxes derived from DES; ranked second in the AES competition for its high security margin against brute-force and analytical attacks, prioritizing long-term robustness over speed.

Hash Function and Integrity Mechanism Inventors

developed the foundational concepts for cryptographic hash functions in his 1979 PhD thesis, introducing one-way hash functions suitable for and digital signatures, which laid the groundwork for secure verification. His work demonstrated that iterating a compression function over message blocks, with appropriate padding to encode length, could produce collision-resistant hashes from weaker components, influencing subsequent designs. Ivan Damgård independently formalized the Merkle-Damgård construction in 1989, proving its security properties for building provably secure hash functions from collision-resistant compression functions, a adopted in standards like and SHA-1. This structure processes messages in fixed-size blocks, chaining internal states to ensure that any alteration propagates, thereby enabling reliable integrity checks in cryptographic protocols. Ronald Rivest designed the in 1990 and its successor in 1991, both 128-bit cryptographic hashes intended for applications requiring fast computation and resistance to preimage and collision attacks. , specified in RFC 1321 in 1992, became widely used for file integrity verification despite later vulnerabilities, exemplifying practical hash design balancing speed and security for real-world deployment. Mihir Bellare, Ran Canetti, and Hugo Krawczyk invented (Hash-based Message Authentication Code) in 1996, a keyed hash mechanism that enhances unkeyed hashes like or for integrity and authenticity by nesting the hash function around a secret key, providing provable against existential forgery under chosen-message attacks. 's design mitigates length-extension weaknesses inherent in Merkle-Damgård hashes, making it a standard for secure message authentication in protocols like and TLS.

Cryptanalysts

Eli Biham and developed differential cryptanalysis, a technique that exploits probabilistic differences in plaintext pairs propagating through cipher rounds to recover keys, first published in 1990 and applied to break reduced-round variants of DES with eight rounds using modest computational resources. Their 1993 book detailed full 16-round DES attacks requiring 2^47 chosen plaintexts, influencing subsequent cipher designs to resist such differentials. Biham, born in 1960, continues research at Technion, while Shamir, born in 1952, co-invented RSA but advanced analysis through this method. Lars Knudsen contributed integral in 2002 with David Wagner, targeting ciphers like Square by analyzing byte sums over sets to deduce internal states, extending differential approaches for structures with incomplete . Born in 1962, Knudsen's work includes provable security bounds against differential attacks and analyses of ciphers like , emphasizing truncated differentials. His research at advanced evaluation, with over 100 publications on design and breaking techniques. Xiaoyun Wang demonstrated practical collisions in in 2004, constructing distinct inputs yielding identical 128-bit hashes with 2^39 operations, undermining its for applications like digital signatures. Extending to , her 2005 attack found collisions in 2^69 steps, prompting NIST deprecation; by 2017, practical collisions followed similar paths. A professor at , Wang's differential path constructions revolutionized , affecting standards like TLS certificates. Alex Biryukov advanced and attacks, combining differential trails for amplified probabilities in block ciphers, with applications to AES variants and stream ciphers since the late . As a professor at the , his work on memory-hard functions and tradeoff critiques primitives like , while breaking reduced-round Khazad and analyzing PRESENT-like ciphers with secret S-boxes. Biryukov's over 15,000 citations underscore impacts on symmetric security assessments.

Theoretical and Complexity-Based Cryptographers

(born 1959) co-developed the foundational framework for zero-knowledge proofs in 1985 with Silvio Micali and Charles Rackoff, enabling protocols that verify statements without revealing underlying secrets, grounded in assumptions. Her work also established probabilistic encryption as a standard for , reducing it to the hardness of one-way functions, and advanced pseudorandom function families with Micali in 1989, influencing . Silvio Micali (born 1954) contributed to the theoretical underpinnings of interactive proofs and zero-knowledge systems, co-authoring the 1985 paper that formalized these concepts under black-box simulation paradigms, proving their completeness, soundness, and zero-knowledge properties relative to complexity classes like IP=PSPACE. His research extends to pseudorandom generators and secure computation protocols, emphasizing reductions from to average-case hardness in NP. Manuel Blum (born 1938) pioneered the integration of computational complexity into cryptography by demonstrating in the 1980s that pseudorandom generators exist if one-way permutations do, providing a bridge between complexity theory's P vs. NP questions and practical secure systems like public-key encryption. Blum's Blum-Blum-Shub pseudorandom number generator, proposed in 1986, relies on the quadratic residuosity assumption, offering provable security against polynomial-time adversaries under the intractability of integer factorization. Oded Goldreich (born 1957) advanced the theoretical foundations by authoring comprehensive treatments of in -theoretic terms, including zero-knowledge proofs and secure function evaluation, as detailed in his two-volume "Foundations of Cryptography" series (1998–2004), which formalizes security via asymptotic reductions to minimal assumptions like the existence of one-way functions. His work traces bidirectional influences between and , such as derandomization techniques impacting proofs. Russell Impagliazzo (born 1963) formulated the "five worlds" framework in 1995, classifying possible computational universes based on P vs. NP outcomes and their implications for —ranging from Pessiland (no hard problems) to Cryptomania (rich )—to analyze the plausibility of security assumptions like the existence of one-way functions or public-key systems. His contributions include black-box lower bounds separating from one-way functions, highlighting limitations in provable reductions within complexity hierarchies.

Post-Quantum and Quantum-Resistant Cryptographers

Oded Regev introduced the (LWE) problem in 2005, establishing a foundational hard problem for that resists quantum attacks and forms the basis for several NIST-standardized post-quantum algorithms, including those relying on module-LWE variants. His work demonstrated reductions from worst-case lattice problems to average-case LWE instances, enabling efficient cryptographic constructions secure against both classical and quantum adversaries. Robert J. McEliece proposed the first code-based public-key cryptosystem in 1978, using Goppa codes to hide structure while allowing efficient decryption, a design that has withstood quantum threats and inspired modern candidates like Classic McEliece in NIST's ongoing standardization process. The scheme's security relies on the hardness of decoding general linear codes, which remains uncompromised by known quantum algorithms beyond Grover's quadratic speedup for search problems. The CRYSTALS-Kyber , standardized by NIST as ML-KEM (FIPS 203) in August 2024, was developed by a team including Joppe W. Bos, Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, John M. Schanck, Peter Schwabe, and Damien Stehlé, who optimized module-lattice-based constructions for IND-CCA security with compact keys and fast performance. Similarly, the CRYSTALS-Dilithium scheme, standardized as ML-DSA (FIPS 204) in the same announcement, emerged from contributions by Léo Ducas, Eike Kiltz, Tancrède Lepoint, Vadim Lyubashevsky, Peter Schwabe, Damien Stehlé, and Gregor Seiler, leveraging Fiat-Shamir with aborts over module lattices for strong unforgeability under chosen-message attacks. Michele Mosca has advanced quantum-resistant cryptography through , including his 2015 theorem quantifying the risk of cryptographic breaks as the product of quantum advancement probability and data lifetime, urging proactive migration timelines of 10-20 years for long-term secrets. As co-founder of CryptoWorks21, he promotes practical quantum-safe protocols, emphasizing hybrid schemes combining classical and post-quantum elements during transition periods.

Blockchain, Cryptocurrency, and Decentralized Protocol Designers

Cryptographers have played a pivotal role in designing , , and decentralized protocols by developing cryptographic mechanisms such as hash chaining for immutability, proof-of-work for consensus, and digital signatures for transaction validation, enabling trustless systems resistant to tampering and central control. These innovations addressed longstanding challenges in distributed ledgers, including timestamping, , and structures for participation, predating widespread adoption by decades. Early proposals emphasized mutual suspicion among participants, using cryptographic proofs to verify without relying on trusted intermediaries. Stuart Haber and W. Scott Stornetta introduced the core concept of in their 1991 paper "How to Time-Stamp a Digital Document," proposing a system of cryptographically linked blocks using hash functions and Merkle trees to create tamper-evident chains for document timestamping, ensuring chronological integrity in a distributed environment. Their protocol formed the basis for subsequent blockchain designs, including Bitcoin's structure, by solving the problem of verifiable append-only logs without a central authority. , in his 1982 University of California, Berkeley dissertation "Computer Systems Established, Maintained, and Trusted by Mutually Suspicious Groups," outlined a protocol resembling for coordinating actions among distrustful parties via cryptographic commitments and distributed validation, predating modern implementations by incorporating elements like chained records and group consensus without proof-of-work. This work influenced privacy-focused digital cash systems and highlighted cryptography's potential for decentralized trust in suspicious networks. proposed Bit Gold in 1998 as a decentralized protocol, utilizing proof-of-work puzzles solved by participants to generate unforgeable "bits" timestamped via Byzantine fault-tolerant replication, aiming to create a scarcity-based asset immune to inflationary control by issuers. Bit Gold's design emphasized cryptographic scarcity and decentralized issuance, serving as a direct precursor to Bitcoin's and validation mechanisms. described b-money in 1998 as an anonymous, distributed system relying on cryptographic pseudonyms, computational puzzles for , and contract through bonded participants, proposing two variants: one centralized for simplicity and one fully decentralized using hash-cash-like work for minting. This scheme introduced incentives for validators to maintain ledgers and penalize fraud via cryptographic bonds, influencing Bitcoin's for decentralized consensus. Adam Back invented in 1997 as a proof-of-work protocol to counter and denial-of-service attacks by requiring computational effort for message submission, using partial hash inversions to impose adjustable costs verifiable with minimal resources. 's mechanism was adapted in for mining and anti-double-spending, providing a sybil-resistant consensus layer in permissionless networks. Under the pseudonym , the 2008 whitepaper "Bitcoin: A Electronic Cash System" integrated prior —including for proof-of-work, linked hash chains for immutability, and elliptic curve digital signatures for ownership—into the first viable for decentralized currency, enabling timestamped transactions in a longest-chain consensus model resistant to Byzantine failures up to 50% network control. 's implementation on January 3, 2009, marked the practical realization of these protocols, with over 800,000 blocks mined by 2025 confirming the system's robustness.

Industry and Commercial Cryptography Leaders

Jim Bidzos served as president and CEO of RSA Data Security from 1986 to 1999, transforming the startup—founded in 1982 by , , and to license their RSA algorithm—into a leading commercial provider of cryptographic tools amid stringent U.S. export controls on encryption software classified as munitions. Under Bidzos's leadership, RSA secured key contracts, such as with Lotus Notes for secure email in 1989, and expanded into hardware tokens and software libraries, generating revenues that reached $50 million by the mid-1990s despite legal battles over patent enforcement and international sales restrictions. He also established the RSA Conference in 1991 as a platform to promote cryptographic standards and industry collaboration, which by 1999 attracted over 6,000 attendees annually. Phil released (PGP) in 1991 as , enabling widespread public adoption of public-key for despite violating U.S. export laws on , which prompted a three-year federal investigation ending in 1996 without charges. Following the dismissal, Zimmermann founded PGP Inc. in 1996 to develop and sell commercial versions, incorporating features like and corporate integration; the firm was acquired by Network Associates in 1997 for $40 million and later spun out as PGP Corporation in 2002, which by 2010 served enterprise clients with encrypted data protection tools generating multimillion-dollar revenues. Bruce Schneier contributed to commercial cryptography through practical implementations like the Blowfish symmetric cipher in 1993, adopted in products such as SSL VPNs, and by co-founding Counterpane Internet Security in 1999 to deliver managed detection and response services leveraging cryptographic analysis, which BT acquired in 2004 as BT Counterpane, serving clients with proactive threat monitoring based on real-time crypto protocol evaluation. Schneier's emphasis on applied protocols influenced industry standards, including critiques of weak commercial systems that led to stronger deployments in by the early 2000s. Taher El Gamal, inventor of the 1985 ElGamal encryption scheme, advanced commercial applications as vice president of engineering at in 1995, where he oversaw the integration of SSL/TLS protocols into browsers, enabling secure online transactions that underpinned the growth of web commerce to $1 trillion annually by 2000; he later co-founded Securing Our eCity (Secure eCity) and InfoSec Global to develop agile cryptographic solutions for enterprise .

Government and Signals Intelligence Cryptographers

United States William F. Friedman (1891–1969) served as the chief cryptographer for the U.S. Army Signal Corps starting in 1920 and founded the (SIS) on April 1, 1930, hiring initial staff including Solomon Kullback, Abraham Sinkov, and Leo Rosen as junior cryptanalysts. Under his leadership, SIS cryptanalysts, including Friedman and team member Frank Rowlett, succeeded in breaking Japan's (RED) in 1935 and the more complex Type A (PURPLE) by September 20, 1940, providing critical intelligence during . Herbert O. Yardley (1889–1958) established the Cipher Bureau () in 1919 under the State Department and later directed military intelligence's MI-8 codebreaking unit until 1929, achieving successes such as decrypting Japanese diplomatic traffic that influenced U.S. positions at the 1921 . Joseph O. Mauborgne (1881–1971), a U.S. , pioneered early 20th-century cryptologic advancements, including the development of the system in collaboration with around 1917, which provided theoretically unbreakable when keys were truly random and used only once. Ann Z. Caracristi (1920–2016) joined the SIS as a cryptanalyst in 1943, contributing to the breaking of Axis codes and later serving in senior NSA roles, including as deputy director for production in the , where she oversaw analysis. (1916–2019) was instrumental in SIS during , identifying patterns in the Japanese PURPLE cipher in 1940 that enabled its cryptanalytic solution, a breakthrough confirmed by machine verification on September 20, 1940. United Kingdom James H. Ellis (1924–1999) worked at 's Communications-Electronics Security Group from 1965, conceiving the concept of non-secret in 1970 by demonstrating secure without prior shared secrets, though practical implementation remained classified until 1997. Clifford (born 1950) developed a scheme equivalent to RSA at in 1973, using large prime factorization for secure messaging, independently of academic work and kept secret for until declassification in 1997. Malcolm Williamson (1954–2015) invented a at in 1974, analogous to Diffie-Hellman, enabling secure exchange over insecure channels without prior keys, as part of the same classified public-key research program revealed in 1997.

References

  1. https://sopa.tulane.edu/blog/what-is-cryptography
  2. https://www.cs.purdue.edu/homes/clg/CS590/files/HistoricalCryptography.pdf
  3. https://www.gcsu.edu/sites/files/page-assets/node-808/attachments/callahan.pdf
  4. https://www.redhat.com/en/blog/brief-history-cryptography
  5. https://www.historyofinformation.com/detail.php?id=4201
  6. https://www.musee-armee.fr/en/collections/museum-treasures/cryptographic-device-of-the-enigma-type.html
  7. https://antigonejournal.com/2022/02/greek-fire-signalling/
  8. https://www.ibm.com/think/topics/cryptography-history
  9. https://thereader.mitpress.mit.edu/a-history-of-cryptography-from-the-spartans-to-the-fbi/
  10. https://imperiumromanum.pl/en/curiosities/polybius-square/
  11. https://teachinglondoncomputing.org/polybius/
  12. https://ethw.org/Cryptography
  13. https://www.muslimheritage.com/al-kindi-cryptography/
  14. https://simonsingh.net/media/articles/maths-and-science/arab-code-breakers/
  15. https://www.1001inventions.com/code-breaking/
  16. https://www.atlasobscura.com/articles/cryptography-renaissance-venice
  17. https://www.cs.trincoll.edu/~crypto/historical/alberti.html
  18. https://www.historyofinformation.com/detail.php?id=3161
  19. https://www.historyofinformation.com/detail.php?id=348
  20. https://blog.gcwizard.net/manual/en/thritemus-cipher/01-what-is-the-trithemius-cipher/
  21. https://crypto.interactive-maths.com/vigenegravere-cipher.html
  22. https://www.probabilisticworld.com/vigenere-and-the-age-of-polyalphabetic-ciphers/
  23. https://pages.mtu.edu/~shene/NSF-4/Tutorial/VIG/Vig-Intro.html
  24. https://historyofinformation.com/detail.php?id=1678
  25. https://cryptiana.web.fc2.com/code/louisxiii.htm
  26. https://www.britishmuseum.org/collection/term/BIOG238180
  27. https://mathshistory.st-andrews.ac.uk/Biographies/Wallis/
  28. https://cryptiana.web.fc2.com/code/wallis_e.htm
  29. https://www.monticello.org/research-education/thomas-jefferson-encyclopedia/wheel-cipher/
  30. https://founders.archives.gov/documents/Jefferson/01-37-02-0082
  31. https://www.simonsingh.net/The_Black_Chamber/vigenere_cracking.html
  32. https://cryptologicfoundation.org/community/cryptologic-history/cryptologic-history-calendar.html/event/2025/05/22/1747911600/1881-death-of-friedrich-wilhelm-kasiski/96291
  33. https://crypto.interactive-maths.com/kasiski-analysis-breaking-the-code.html
  34. https://media.defense.gov/2021/Jul/13/2002761511/-1/-1/0/DAWNAMERICANCRYPTOLOGY_HATCH.PDF
  35. https://eprint.iacr.org/2020/390.pdf
  36. https://francisbaconsociety.co.uk/emblem-cipher/detecting-deception-in-cryptography-restoring-truth-in-history/
  37. https://cryptologicfoundation.org/community/cryptologic-history/cryptologic-history-calendar.html/event/2029/04/05/1870059600/1918-french-army-lt-georges-painvin-solved-the-first-key-for-the-adfgvx-cipher-/94052
  38. http://practicalcryptography.com/ciphers/adfgvx-cipher/
  39. https://cryptologicfoundation.org/community/cryptologic-history/cryptologic-history-calendar.html/event/2030/03/01/1898571600/1918-german-adfgvx-cipher-first-used-/91392
  40. https://thehistorypress.co.uk/article/room-40s-brilliant-world-war-i-codebreakers/
  41. https://www.roseannamwhite.com/2023/03/the-codebreakers-of-room-40.html
  42. https://www.ikn.army.mil/apps/MIHOF/biographies/Yardley%2C%2520Herbert.pdf
  43. https://www.nsa.gov/portals/75/documents/news-features/declassified-documents/cryptologic-spectrum/many_lives.pdf
  44. https://www.pbslearningmedia.org/resource/amex33cb-soc-codebreaking/technology-and-wwi-the-transformation-of-codebreaking-during-the-great-war-american-experience/
  45. https://time.com/5928583/elizebeth-friedman-codebreaker/
  46. https://www.nsa.gov/History/Cryptologic-History/Historical-Events/Article-View/article/2740622/the-black-chamber/
  47. https://www.researchgate.net/publication/327197749_The_Interwar_Period_1919-1941_Codes_Ciphers_and_Their_Algorithms
  48. https://www.nsa.gov/portals/75/documents/about/cryptologic-heritage/historical-figures-publications/publications/cryptologic-quarterly/cryptologic-quarterly-2015-01.pdf
  49. https://www.history.co.uk/articles/the-polish-cryptographers-who-cracked-the-enigma-code
  50. https://www.bl.uk/stories/blogs/posts/polish-mathematicians-and-cracking-the-enigma
  51. https://vanemden.wordpress.com/2017/03/28/explosive-knowledge-cryptology-in-the-20th-century/
  52. https://www.cryptomuseum.com/people/menzer/fritz.htm
  53. https://www.nsa.gov/portals/75/documents/news-features/declassified-documents/cryptologic-quarterly/Regierungs_Oberinspektor.pdf
  54. https://www.deutsches-museum.de/en/fritz
  55. https://link.springer.com/chapter/10.1007/978-981-10-8618-2_1
  56. https://www.cryptomuseum.com/crypto/uk/typex/index.htm
  57. https://www.jproc.ca/crypto/typex.html
  58. https://commsmuseum.co.uk/Typex/typex.htm
  59. https://www.cryptomuseum.com/crypto/usa/sigaba/index.htm
  60. https://www.nationalmuseum.af.mil/Visit/Museum-Exhibits/Fact-Sheets/Display/Article/196193/war-of-secrets-cryptology-in-wwii/
  61. https://www.nsa.gov/portals/75/documents/about/cryptologic-heritage/historical-figures-publications/publications/technology/The_SIGABA_ECM_Cipher_Machine_A_Beautiful_Idea3.pdf
  62. https://www.iwm.org.uk/history/how-alan-turing-cracked-the-enigma-code
  63. https://ieee-aess.org/post/blog/history-column-polish-cryptographers-marian-rejewski-jerzy-rozycki-and-henryk-zygalski
  64. https://www.tnmoc.org/bh-6-enter-turing-and-welchman
  65. https://www.bletchleypark.org.uk/our-story/who-were-the-codebreakers/
  66. https://artsandculture.google.com/story/gordon-welchman-the-architect-of-ultra-intelligence-bletchley-park/hwVhnw7J36GHKQ
  67. https://www.nsa.gov/History/National-Cryptologic-Museum/Exhibits-Artifacts/Exhibit-View/Article/2718925/the-magic-of-purple/
  68. https://www.army.mil/article/127519/william_f_friedman_master_code_breaker
  69. https://www.marshallfoundation.org/articles-and-features/breaking-purple-in-william-friedmans-own-words/
  70. https://transforming-classification.blogs.archives.gov/2015/04/30/nsa-declassifies-and-releases-the-friedman-collection/
  71. https://www.governmentattic.org/docs/NSA_AmerCryptColdWarBk1.pdf
  72. https://www.nsa.gov/History/Cryptologic-History/Historical-Figures/Historical-Figures-View/Article/1620892/ann-caracristi/
  73. https://www.nps.gov/articles/000/the-code-girls-of-arlington-hall-station-women-cryptologists-of-the-second-world-war-teaching-with-historic-places.htm
  74. https://msa.maryland.gov/msa/educ/exhibits/womenshallfame/html/blum.html
  75. https://www.nsa.gov/History/Cryptologic-History/Historical-Figures/Historical-Figures-View/Article/1620682/frank-austin/
  76. https://nsarchive2.gwu.edu/NSAEBB/NSAEBB426/docs/2.American%2520Cryptology%2520During%2520the%2520Cold%2520War%25201945-1989%2520Book%2520IV%2520Cryptologic%2520Rebirth%25201981-1989-1999.pdf
  77. https://www.itsoc.org/about/shannon
  78. https://www.scientificamerican.com/article/claude-e-shannon-founder/
  79. https://www.nsa.gov/History/Cryptologic-History/Historical-Figures/Historical-Figures-View/Article/3006218/clifford-cocks-james-ellis-and-malcolm-williamson/
  80. https://cs.stanford.edu/people/eroberts/courses/soco/projects/public-key-cryptography/history.html
  81. https://www.ams.org/publications/journals/notices/201606/rnoti-p668.pdf
  82. https://www.nexusgroup.com/who-invented-public-key-cryptography/
  83. https://www2.math.upenn.edu/~kazdan/210S19/Notes/crypto/RSA_cryptosystem.html
  84. https://cryptologicfoundation.org/community/cryptologic-history/cryptologic-history-calendar.html/event/2025/09/20/1758344400/1983-three-inventors-receive-patent-for-encryption-algorithm-rsa/78258
  85. https://research.ibm.com/topics/cryptography
  86. https://www.ithistory.org/honor-roll/mr-horst-feistel
  87. https://csrc.nist.gov/csrc/media/projects/cryptographic-standards-and-guidelines/documents/aes-development/rijndael-ammended.pdf
  88. https://nvlpubs.nist.gov/nistpubs/jres/126/jres.126.024.pdf
  89. https://www.schneier.com/academic/blowfish/
  90. https://www.schneier.com/wp-content/uploads/2016/02/paper-twofish-paper.pdf
  91. https://datatracker.ietf.org/doc/html/rfc5469
  92. https://www.rroij.com/open-access/international-data-encryption-algorithm-idea-a-typical-illustration.php?aid=37580
  93. https://www.cl.cam.ac.uk/archive/rja14/serpent.html
  94. https://biham.cs.technion.ac.il/Reports/Serpent/
  95. https://utimaco.com/service/knowledge-base/post-quantum-cryptography/what-hash-based-cryptography
  96. https://jurnal.seaninstitute.or.id/index.php/juti/article/download/652/417/1946
  97. https://asecuritysite.com/blog/2023-09-18_The-Wonderful-Research-of-Ivan-Damg-rd--Hashing--Homomorphic-Encryption-and-Zero-Knowledge-Proofs-fa0a2e860fd.html
  98. https://www.ithistory.org/honor-roll/dr-ronald-linn-rivest
  99. https://crypto.stackexchange.com/questions/9336/is-hmac-md5-considered-secure-for-authenticating-encrypted-data
  100. https://ieeexplore.ieee.org/author/37342337700
  101. https://link.springer.com/article/10.1007/BF00630563
  102. https://link.springer.com/book/10.1007/978-1-4613-9314-6
  103. https://biham.cs.technion.ac.il/Reports/differential-cryptanalysis-of-the-data-encryption-standard-biham-shamir-authors-latex-version.pdf
  104. https://link.springer.com/chapter/10.1007/3-540-45661-9_9
  105. https://www.iacr.org/cryptodb/data/paper.php?pubkey=14114
  106. https://scholar.google.com/citations?user=YayQtGUAAAAJ&hl=en
  107. https://eprint.iacr.org/2004/199
  108. https://link.springer.com/chapter/10.1007/11426639_2
  109. http://www.cems.uwe.ac.uk/~irjohnso/coursenotes/ufeen8-15-m/md5-attack.pdf
  110. https://scholar.google.com/citations?user=tP5rH0wAAAAJ&hl=en
  111. https://www.iacr.org/cryptodb/data/author.php?authorkey=42
  112. https://dblp.org/pid/09/5071
  113. https://amturing.acm.org/award_winners/goldwasser_8627889.cfm
  114. https://amturing.acm.org/award_winners/micali_9954407.cfm
  115. https://www.csail.mit.edu/person/silvio-micali
  116. https://amturing.acm.org/award_winners/blum_4659082.cfm
  117. https://www.cs.cmu.edu/~mblum/
  118. https://dl.acm.org/doi/pdf/10.1145/3335741.3335760
  119. https://www.quantamagazine.org/the-researcher-who-explores-computation-by-conjuring-new-worlds-20240327/
  120. https://www.simonsfoundation.org/people/russell-impagliazzo/
  121. https://cims.nyu.edu/~regev/papers/qcrypto.pdf
  122. https://cims.nyu.edu/~regev/papers/lwesurvey.pdf
  123. https://ipnpr.jpl.nasa.gov/progress_report/42-44/44N.PDF
  124. https://classic.mceliece.org/
  125. https://eprint.iacr.org/2017/634.pdf
  126. https://eprint.iacr.org/2017/633.pdf
  127. https://eprint.iacr.org/2015/1075.pdf
  128. https://uwaterloo.ca/institute-for-quantum-computing/profiles/michele-mosca
  129. https://link.springer.com/article/10.1007/BF00196791
  130. https://evervault.com/papers/chaum.pdf
  131. http://www.staroceans.org/e-book/Haber_Stornetta.pdf
  132. https://chaum.com/publications/
  133. https://nakamotoinstitute.org/library/bit-gold/
  134. http://www.weidai.com/bmoney.txt
  135. https://bitcoin.org/bitcoin.pdf
  136. https://courses.csail.mit.edu/6.857/2022/files/L21-jim-bidzos-guest-lecture-slides.pdf
  137. https://investor.verisign.com/board-directors-executive-officers/d-bidzos
  138. https://cybersecurityventures.com/story-of-the-first-rsa-conference-told-by-jim-bidzos/
  139. https://www.openpgp.org/about/history/
  140. https://www.infosecglobal.com/company/leadership-team
  141. https://www.army.mil/article/99638/army_signal_corps_takes_control_of_cryptography_and_cryptanalysis_this_week_in_history_april_5
  142. https://www.nsa.gov/History/Cryptologic-History/Historical-Figures/Historical-Figures-View/Article/1623043/dr-solomon-kullback/
  143. https://www.nsa.gov/portals/75/documents/news-features/declassified-documents/nsa-60th-timeline/1990s/19950000_1990_Doc_3188691_American.pdf
  144. https://www.goodfellow.af.mil/Newsroom/Features/Display/Article/1416515/a-century-of-army-cryptology-and-signals-intelligence/
  145. https://www.nsa.gov/Press-Room/Press-Releases-Statements/Press-Release-View/article/3631341/five-cryptologic-giants-to-be-inducted-into-nsas-cryptologic-hall-of-honor/
  146. https://cryptologicfoundation.org/community/cryptologic-history/pioneers/female-pioneers-in-cryptology-and-related-fields.html
  147. https://www.gchq.gov.uk/section/history/people-from-our-past
Add your contribution
Related Hubs
Contribute something
User Avatar
No comments yet.