James Gillogly

Last updated

James J. Gillogly (born 5 March 1946) is an American computer scientist and cryptographer.

Contents

Biography

Early life

His interest in cryptography stems from his boyhood, as did his interest in mathematics. [1] By junior high he was inventing his own ciphers and challenging his father, entomologist Lorin Gillogly, to solve them. [1]

Gillogly wrote a chess-playing program in the Fortran programming language in 1970, and in 1977 he ported the code for "Colossal Cave" from Fortran to C.

Education

He graduated from Carnegie Mellon University in 1978, receiving a Ph.D. in computer science. He was advised by Allen Newell, with his dissertation titled "Performance Analysis of the Technology Chess Program". [2]

Career

Gillogly worked as a computer scientist at RAND, specializing in system design and development, and computer security. He has written several articles about technology and cryptography, is currently the editor of the "Cipher Exchange" column for The Cryptogram , and was president of the American Cryptogram Association.

Gillogly was one of the earliest authors of personal computer software, writing utility programs, [3] games and a computerized cookbook published by the Software Toolworks beginning in 1980.

Cryptanalysis

He is best known for his work solving or debunking some of the world's most famous unsolved codes. In 1980 he wrote a paper on unusual strings in the Beale Ciphers, and he received international media attention for being the first person to publicly solve parts 1-3 on the CIA's Kryptos sculpture in 1999. He also coordinates a large mailing list about the ciphers in the Voynich Manuscript. On the PBS website, they report that he has been called "arguably the best non-government cryptanalyst in the U.S." in the field of classical (historical) cryptosystems.

In 1995 he deciphered a text enciphered by Robert H. Thouless who had hoped the message could prove that the dead could communicate with the living. [1] Gillogly wrote his own software to decipher the text, which was in a variant of the playfair cipher. [1]

Selected articles

See also

Related Research Articles

<span class="mw-page-title-main">Cipher</span> Algorithm for encrypting and decrypting information

In cryptography, a cipher is an algorithm for performing encryption or decryption—a series of well-defined steps that can be followed as a procedure. An alternative, less common term is encipherment. To encipher or encode is to convert information into cipher or code. In common parlance, "cipher" is synonymous with "code", as they are both a set of steps that encrypt a message; however, the concepts are distinct in cryptography, especially classical cryptography.

<span class="mw-page-title-main">Cryptanalysis</span> Study of analyzing information systems in order to discover their hidden aspects

Cryptanalysis refers to the process of analyzing information systems in order to understand hidden aspects of the systems. Cryptanalysis is used to breach cryptographic security systems and gain access to the contents of encrypted messages, even if the cryptographic key is unknown.

<span class="mw-page-title-main">Frequency analysis</span> Study of the frequency of letters or groups of letters in a ciphertext

In cryptanalysis, frequency analysis is the study of the frequency of letters or groups of letters in a ciphertext. The method is used as an aid to breaking classical ciphers.

<span class="mw-page-title-main">Ciphertext</span> Encrypted information

In cryptography, ciphertext or cyphertext is the result of encryption performed on plaintext using an algorithm, called a cipher. Ciphertext is also known as encrypted or encoded information because it contains a form of the original plaintext that is unreadable by a human or computer without the proper cipher to decrypt it. This process prevents the loss of sensitive information via hacking. Decryption, the inverse of encryption, is the process of turning ciphertext into readable plaintext. Ciphertext is not to be confused with codetext because the latter is a result of a code, not a cipher.

<span class="mw-page-title-main">Rotor machine</span>

In cryptography, a rotor machine is an electro-mechanical stream cipher device used for encrypting and decrypting messages. Rotor machines were the cryptographic state-of-the-art for much of the 20th century; they were in widespread use in the 1920s–1970s. The most famous example is the German Enigma machine, the output of which was deciphered by the Allies during World War II, producing intelligence code-named Ultra.

Articles related to cryptography include:

<span class="mw-page-title-main">Beale ciphers</span> A set of three ciphertexts

The Beale ciphers are a set of three ciphertexts, one of which allegedly states the location of a buried treasure of gold, silver and jewels estimated to be worth over 43 million US dollars as of January 2018. Comprising three ciphertexts, the first (unsolved) text describes the location, the second (solved) ciphertext accounts the content of the treasure, and the third (unsolved) lists the names of the treasure's owners and their next of kin.

<i>Kryptos</i> Encrypted sculpture by American artist Jim Sanborn

Kryptos is a distributed sculpture by the American artist Jim Sanborn located on the grounds of the Central Intelligence Agency (CIA) headquarters, the George Bush Center for Intelligence in Langley, Virginia. Since its dedication on November 3, 1990, there has been much speculation about the meaning of the four encrypted messages it bears. Of these four messages, the first three have been solved, while the fourth message remains one of the most famous unsolved codes in the world. The sculpture continues to be of interest to cryptanalysts, both amateur and professional, who are attempting to decipher the fourth passage. The artist has so far given four clues to this passage.

<span class="mw-page-title-main">Books on cryptography</span>

Books on cryptography have been published sporadically and with highly variable quality for a long time. This is despite the tempting, though superficial, paradox that secrecy is of the essence in sending confidential messages — see Kerckhoffs' principle.

Cryptography, the use of codes and ciphers to protect secrets, began thousands of years ago. Until recent decades, it has been the story of what might be called classical cryptography — that is, of methods of encryption that use pen and paper, or perhaps simple mechanical aids. In the early 20th century, the invention of complex mechanical and electromechanical machines, such as the Enigma rotor machine, provided more sophisticated and efficient means of encryption; and the subsequent introduction of electronics and computing has allowed elaborate schemes of still greater complexity, most of which are entirely unsuited to pen and paper.

Cryptography was used extensively during World War II because of the importance of radio communication and the ease of radio interception. The nations involved fielded a plethora of code and cipher systems, many of the latter using rotor machines. As a result, the theoretical and practical aspects of cryptanalysis, or codebreaking, were much advanced.

Below is a timeline of notable events related to cryptography.

The D'Agapeyeff cipher is an unsolved cipher that appears in the first edition of Codes and Ciphers, an elementary book on cryptography published by the Russian-born English cryptographer and cartographer Alexander D'Agapeyeff in 1939.


Edward Michael Scheidt is a retired Chairman of the Central Intelligence Agency (CIA) Cryptographic Center and the designer of the cryptographic systems used in the Kryptos sculpture at CIA Headquarters in Langley, Virginia.

<span class="mw-page-title-main">American Cryptogram Association</span> American non-profit organization

The American Cryptogram Association (ACA) is an American non-profit organization devoted to the hobby of cryptography, with an emphasis on types of codes, ciphers, and cryptograms that can be solved either with pencil and paper, or with computers, but not computer-only systems.

The Chaocipher is a cipher method invented by John Francis Byrne in 1918 and described in his 1953 autobiographical Silent Years. He believed Chaocipher was simple, yet unbreakable. Byrne stated that the machine he used to encipher his messages could be fitted into a cigar box. He offered cash rewards for anyone who could solve it.

<span class="mw-page-title-main">Elonka Dunin</span> American video game developer and cryptologist

Elonka Dunin is an American video game developer and cryptologist. Dunin worked at Simutronics Corp. in St. Louis, Missouri from 1990–2014, and in 2015 was Senior Producer at Black Gate Games in Nashville, Tennessee. She is Chairperson Emerita and one of the founders of the International Game Developers Association's Online Games group, has contributed or been editor in chief on multiple IGDA State of the Industry white papers, and was one of the Directors of the Global Game Jam from 2011–2014. As of 2020 she works as a management consultant at Accenture.

ʻAfīf al-Dīn ʻAlī ibn ʻAdlān al-Mawsilī, born in Mosul, was an Arab cryptologist, linguist and poet who is known for his early contributions to cryptanalysis, to which he dedicated at least two books. He was also involved in literature and poetry, and taught on the Arabic language at the Al-Salihiyya Mosque of Cairo.

Unsolved! The History and Mystery of the World’s Greatest Ciphers from Ancient Egypt to Online Secret Societies is a 2017 book by American mathematician and cryptologist Craig P. Bauer. The book explores the history and challenges of various unsolved ciphers, ranging from ancient scripts to modern codes and puzzles. The book also invites readers to try their hand at cracking the ciphers, offering clues and hints along the way. The book received positive reviews from critics and readers, who praised its engaging style, comprehensive coverage, and intriguing content.

References

  1. 1 2 3 4 Pool, Bob (5 November 1995). "UMGTN CMGVP TLGE RVGB : (The Solution to This Headline Is at Bottom of Story)". Los Angeles Times . Retrieved 11 March 2018.
  2. "James Gillogly". The Mathematics Genealogy Project .
  3. "BUSS Newsletter #21, January 1980" (PDF). p. 2.