DOCSLIB.ORG

SOLVING CIPHER SECRETS Edited by M

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
SOLVING CIPHER SECRETS Edited by M SOLVING CIPHER SECRETS Edited by M. E. Ohaver TRY YOUR WITS ON THE GREAT CODES AND CRYPTOGRAMS IN WHICH MEN HAVE MASKED THEIR MESSAGES OF LIFE AND DEATH IS PROUD to add this new department to the notable achievements of FLYNN'S. No man can touch practical detective problems without soon coming in contact with some sort of code or cipher writing. Sometimes it is very simple, a mere trans• position of letters or words of the sort that every schoolboy would soon solve. Frequently, however, the cryptogram is blind and complicated beyond the under• standing of any except the most experienced and ingenious of experts. Here is one phase in which the fiction writer has still to learn from fact. The examples that Mr. Ohaver gives are of ciphers actually used. Many of them are in connection with great historic events. There are few dases in fiction showing greater ingenuity than is exhibited here. Codes play a larger part in the world to-day probably than ever before. The development of commerce, the growth of complex international relationships, the crossing of military and political wires, all have laid greater emphasis on the need of secret writing—of masking the meaning in innocent words that shall be clear only to the one for whom they are intended. The examples given here cover the world, historically and geographically. Here's a chance to try your wits. They have all been solved, and once the key is found the solution is comparatively simple in each case. Work it out and send your solution to the editor of the Cipher Department of FLYNN'S, New York. Perhaps you have a cipher of your own to suggest. The cipher editor will be glad to considier it. This department, with new ciphers to solve and solutions of the old ones, will ppear in FLYNN'S at frequent intervals. N selecting a cipher system cryptographic system ever used, but such a for the first article in our statement is rather broad. It is safer, and new department, probably more correct, to say that it is one of the first none could be more appro• of which we can find any record. priate than the Lacedee- Certain authorities on cryptography have monian Scytale, one of the credited the invention of the scytale to earliest known methods of secret writing. Archimedes. As a matter of history it is Some have claimed that this is the first definitely known to have been used by the 138 SOLVING CIPHER SECRETS 139 Spartans as a means of military communi• case this interval is 3. That is, if the groups cation at least four centuries B.C. be read off from left to right, taking every The old Greek biographer Plutarch de• third group, the message can be readily scribes the use of the scytale in his life of deciphered. Lysander. When the Spartan magistrates The scytale cipher is of the transposition sent an admiral or general on his way, they class. That is, it is a cipher in which the prepared two staffs of wood, called scytales, letters keep their original meanings, merely both of the same length and diameter. having their relative positions changed or They kept one themselves, and the other transposed. they gave to the person sent forth. To read a scytale cipher it is only neces• When they had occasion to communicate sary to find the interval. This may be done any secret or important matter, they wound by trying any letter group with several a narrow strip of white leather or parch• others until one is found with which it forms ment spirally around the staff, so that the a logical sequence. edges came exactly together, forming a Scholars of various times have burned smooth and continuous surface. Then they gallons of midnight oil in delving into the wrote what they desired lengthwise of the mysteries of the scytale, and have formed staff, after which the scroll was unrolled and their own ideas as to how it should be de• sent to its destination. ciphered. We append a few of these meth• The official receiving the message could ods. The learned Julius Caesar Scaliger in read nothing of the writing, because the the sixteenth century, and after him John words and letters were not connected, but Falconer, author of a book on ciphers pub• all broken up. Upon winding the scroll lished in 1685, proposed to join the edges about his own exactly similar staff, however, of the strip together in a serpentine revolu• all the parts were restored to their original tion, and by slipping the strip through the order, thus bringing the whole contents of fingers unite the portions of the divided the message to view. word, and thus find the correct circumfer- I -J P " f I ^ ° It Above is shown a drawing of a scytale ence to make a scytale by on which the mes• bearing the message: This is a very old sage might be read. method of secret writing. The illustration Philip Thicknesse, also author of a book also shows the scroll removed from the on cryptography in 1772, advised a much scytale. The message is broken up into more ready method, that of cutting the stij^ small groups of letters, which, if read off in in short pieces equal to the circumference order, stand as follows: of the staff, and then by joining the edges TH-OL-SEC-IS I-D M-RET-S A-ETH- of these strips together on a flat surface, WR- VE-OD -ITI-RY -OF-NG such as a table, the entire writing would In this cipher arrangement of the scytale be exposed at once. message, it will be seen that each group of Edgar Allan Poe suggested the use of a letters is separated from the group with cone of about six feet length, and of a cir• which it forms sequence in the original mes• cumference at the base equal to the length sage by an " interval " equal to the number of the parchment strips. By adjusting the of lines written on the scytale. In the above strip about the base of the cone with the 140 FLYNN'S edges together, and sliding the same gradu• darus lost his life in this battle, as you will ally toward the apex, a point would be discover in the cipher. reached where the proper connection be• AL-KIL-FOO-HEN-L I-LED-D.VV-CE,-S tween parts of words would be formed. L-.TH-E C-NOR-OST-E S-AN -STA-.MI- Having thus learned the circumference of OLD-NEI-Y LO-NDA-IER-THE-NGE- the staff, Poe advised the making of a RUS-S W-R G-R H- IS- ANT-ET-ERE. special scytale of this size, as did Scaliger The periods and commas are a part of and Falconer. the cifAer, but the dashes only mark the The scytale was, in its time, considered divisions between the groups, as illustrated absolutely secret. Messages are known to above. have been intercepted, but there is no in• stance on record when any were ever de• In the next installment of this department ciphered. So we will now give our readers we will offer for your entertainment an in• an opportunity to match their wits against genious cipher which saved the life of a this clever device of the ancients. prisoner during the administration of Wil• The following cipher is an English trans• liam Pitt as Premier of England about a lation of a genuine scytale message written hundred and fifty years ago. We will also over two thousand years ago. It was sent give the correct interpretation of this week's by the Spartans when they had met the scytale cipher. Don't fail to get a copy of Athenians with disastrous results near Czyi- the issue containing the new cipher and the cus in B.C. 410. The Spartan admiral Min- solution of this. THE HEATHEN CHINEE! OR ways that are dark and tricks Sometimes they cross the border in sealed F that are vain, the heathen Chinee is box cars. On one occasion, an alert immi• peculiar." So sang Bret Harte, many gration official smelled something while years ago. The Chinaman didn't under• passing a box car supposed to contain stand the game, but in his sleeves, " which barbed wire. It did contain barbed wire were long," were twenty-four packs of and also forty Chinese coolies. They were cards! arrested and taken to the nearest jail to John Chinaman, of the coolie class, be deported to China. From this jail they hasn't changed much. He still has ways were taken in regular prison car to San that are dark when he wishes to enter the Francisco and shipped as steerage passen• United States—ostensibly. But one of his gers on the first steamship back to their tricks is out of date and hereafter always native land. Uncle Sam paid their trans• will be along the international borderline portation to be rid of them. that runs between Mexico and the United Immigration officials made a secret inves• States. tigation south of the international boun• Almost any one can cross from Mexico dary line and learned that the Chinese into the United States between El Paso, coolies didn't want to get into the United Texas, and Yuma, California, without be• States to live—but to be caught and sent ing detected, for there are many miles of back to China, free of charge. boundary and only a few " line riders " for " The heathen Chinee" coolie after Uncle Sam.
Load more

Recommended publications
  • Simple Substitution and Caesar Ciphers
    Spring 2015 Chris Christensen MAT/CSC 483 Simple Substitution Ciphers The art of writing secret messages – intelligible to those who are in possession of the key and unintelligible to all others – has been studied for centuries. The usefulness of such messages, especially in time of war, is obvious; on the other hand, their solution may be a matter of great importance to those from whom the key is concealed. But the romance connected with the subject, the not uncommon desire to discover a secret, and the implied challenge to the ingenuity of all from who it is hidden have attracted to the subject the attention of many to whom its utility is a matter of indifference. Abraham Sinkov In Mathematical Recreations & Essays By W.W. Rouse Ball and H.S.M. Coxeter, c. 1938 We begin our study of cryptology from the romantic point of view – the point of view of someone who has the “not uncommon desire to discover a secret” and someone who takes up the “implied challenged to the ingenuity” that is tossed down by secret writing. We begin with one of the most common classical ciphers: simple substitution. A simple substitution cipher is a method of concealment that replaces each letter of a plaintext message with another letter. Here is the key to a simple substitution cipher: Plaintext letters: abcdefghijklmnopqrstuvwxyz Ciphertext letters: EKMFLGDQVZNTOWYHXUSPAIBRCJ The key gives the correspondence between a plaintext letter and its replacement ciphertext letter. (It is traditional to use small letters for plaintext and capital letters, or small capital letters, for ciphertext. We will not use small capital letters for ciphertext so that plaintext and ciphertext letters will line up vertically.) Using this key, every plaintext letter a would be replaced by ciphertext E, every plaintext letter e by L, etc.
    [Show full text]
  • Download Full-Text
    IJCSI International Journal of Computer Science Issues, Vol. 10, Issue 4, No 2, July 2013 ISSN (Print): 1694-0814 | ISSN (Online): 1694-0784 www.IJCSI.org 89 An Eccentric Scheme for Oblivious Communication Khan Farhan Rafat and Muhammad Sher Department of Computer Science, International Islamic University Islamabad, 44000, Pakistan alphabets and then threading the yarn through these holes Abstract in an order which when detached spelt out letters of hidden Trust is the foremost requirement in any form of communication. message in its correct sequence [3]: Building trust through physical contact, gesture etc. is easy but hard to establish in electronic data communication as one can’t “padielaporsymesarponomeuaspeludynmalpreaxo” be sure of the presence of the intended recipient at the other end. “Ave Maria” is yet another smart method for encoding This necessitated the need to devise and suggest covert schemes secret message where list of distinct words for each unique for oblivious communication that only the intended recipient may alphabet are grouped in a series of Tables. For every unveil. Steganography is one such technique where information alphabet constituting the message, word corresponding to to be sent is seamlessly superimposed on the carrier such that it that letter from the set of Tables gets substituted and easily crosses the information confronting barriers without appeared as innocent rhyme whenever the Tables are used detection. This paper endeavors at evolving a data hiding scheme in sequence. envisaged by Shannon and in adherence to Kerchoff’s principle that hides secret information inside statistically random English Cardano introduced the “Grille System” [4] where every alphabets appearing as cryptogram.
    [Show full text]
  • Cryptography: Symmetric Encryption Unit 3
    10/22/2019 CS Matters in Maryland (http://csmatters.org) 3 - 11 0b11 - 0b1011 Cryptography: Symmetric Encryption Unit 3. Information and the Internet Revision Date: Jul 22, 2019 Duration: 1 50-minute session Lesson Summary Summary Students are introduced to the topic of cryptography and learn to perform two encryption techniques. The students will identify the role of the algorithm and key in the encryption process. Students will use abstraction to see the general process used in symmetric encryption. The students will consider the strength of ciphers and the importance of keeping the key a secret. Outcomes Students will understand how encryption is used to keep data secure. Students will learn how encrypting and decrypting data is accomplished using an algorithm and a key. Students will understand why the key must be kept a secret. Overview 1. Getting Started (5 min) - Journal 2. Introduction to Content (15 min) 1. Lesson Motivation [5 min] 2. Presenting the Key Concepts [10 min] 3. Guided Activities (25 min) 1. Practice [15 min] 2. Follow Up: Analyzing the Strength of Ciphers [5 min] 3. Follow Up: Defining Symmetric Encryption and Seeing the Abstraction in Symmetric Encryption Systems [5 min] 4. Wrap Up (5 min) - Journal Learning Objectives CSP Objectives EU AAP-2 - The way statements are sequenced and combined in a program determines the computed result. Programs incorporate iteration and selection constructs to represent repetition and make decisions to handle varied input values. LO AAP-2.A - Express an algorithm that uses sequencing without using a programming language. LO AAP-2.L - Compare multiple algorithms to determine if they yield the same side effect or result.
    [Show full text]
  • A Complete Bibliography of Publications in Cryptologia
    A Complete Bibliography of Publications in Cryptologia Nelson H. F. Beebe University of Utah Department of Mathematics, 110 LCB 155 S 1400 E RM 233 Salt Lake City, UT 84112-0090 USA Tel: +1 801 581 5254 FAX: +1 801 581 4148 E-mail: [email protected], [email protected], [email protected] (Internet) WWW URL: http://www.math.utah.edu/~beebe/ 04 September 2021 Version 3.64 Title word cross-reference 10016-8810 [?, ?]. 1221 [?]. 125 [?]. 15.00/$23.60.0 [?]. 15th [?, ?]. 16th [?]. 17-18 [?]. 18 [?]. 180-4 [?]. 1812 [?]. 18th (t; m)[?]. (t; n)[?, ?]. $10.00 [?]. $12.00 [?, ?, ?, ?, ?]. 18th-Century [?]. 1930s [?]. [?]. 128 [?]. $139.99 [?]. $15.00 [?]. $16.95 1939 [?]. 1940 [?, ?]. 1940s [?]. 1941 [?]. [?]. $16.96 [?]. $18.95 [?]. $24.00 [?]. 1942 [?]. 1943 [?]. 1945 [?, ?, ?, ?, ?]. $24.00/$34 [?]. $24.95 [?, ?]. $26.95 [?]. 1946 [?, ?]. 1950s [?]. 1970s [?]. 1980s [?]. $29.95 [?]. $30.95 [?]. $39 [?]. $43.39 [?]. 1989 [?]. 19th [?, ?]. $45.00 [?]. $5.95 [?]. $54.00 [?]. $54.95 [?]. $54.99 [?]. $6.50 [?]. $6.95 [?]. $69.00 2 [?, ?]. 200/220 [?]. 2000 [?]. 2004 [?, ?]. [?]. $69.95 [?]. $75.00 [?]. $89.95 [?]. th 2008 [?]. 2009 [?]. 2011 [?]. 2013 [?, ?]. [?]. A [?]. A3 [?, ?]. χ [?]. H [?]. k [?, ?]. M 2014 [?]. 2017 [?]. 2019 [?]. 20755-6886 [?, ?]. M 3 [?]. n [?, ?, ?]. [?]. 209 [?, ?, ?, ?, ?, ?]. 20th [?]. 21 [?]. 22 [?]. 220 [?]. 24-Hour [?, ?, ?]. 25 [?, ?]. -Bit [?]. -out-of- [?, ?]. -tests [?]. 25.00/$39.30 [?]. 25.00/839.30 [?]. 25A1 [?]. 25B [?]. 26 [?, ?]. 28147 [?]. 28147-89 000 [?]. 01Q [?, ?]. [?]. 285 [?]. 294 [?]. 2in [?, ?]. 2nd [?, ?, ?, ?]. 1 [?, ?, ?, ?]. 1-4398-1763-4 [?]. 1/2in [?, ?]. 10 [?]. 100 [?]. 10011-4211 [?]. 3 [?, ?, ?, ?]. 3/4in [?, ?]. 30 [?]. 310 1 2 [?, ?, ?, ?, ?, ?, ?]. 312 [?]. 325 [?]. 3336 [?, ?, ?, ?, ?, ?]. affine [?]. [?]. 35 [?]. 36 [?]. 3rd [?]. Afluisterstation [?, ?]. After [?]. Aftermath [?]. Again [?, ?]. Against 4 [?]. 40 [?]. 44 [?]. 45 [?]. 45th [?]. 47 [?]. [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?]. Age 4in [?, ?]. [?, ?]. Agencies [?]. Agency [?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?].
    [Show full text]
  • Substitution Cipher in Cryptography, a Substitution Cipher Is a Method Of
    Substitution cipher In cryptography, a substitution cipher is a method of encryption by which units of plaintext are replaced with ciphertext according to a regular system; the "units" may be single letters (the most common), pairs of letters, triplets of letters, mixtures of the above, and so forth. The receiver deciphers the text by performing an inverse substitution. Substitution ciphers can be compared with transposition ciphers. In a transposition cipher, the units of the plaintext are rearranged in a different and usually quite complex order, but the units themselves are left unchanged. By contrast, in a substitution cipher, the units of the plaintext are retained in the same sequence in the ciphertext, but the units themselves are altered. There are a number of different types of substitution cipher. If the cipher operates on single letters, it is termed a simple substitution cipher; a cipher that operates on larger groups of letters is termed polygraphic. A monoalphabetic cipher uses fixed substitution over the entire message, whereas a polyalphabetic cipher uses a number of substitutions at different times in the message, where a unit from the plaintext is mapped to one of several possibilities in the ciphertext and vice-versa. Contents • 1 Simple substitution o 1.1 Examples o 1.2 Security for simple substitution ciphers • 2 Homophonic substitution • 3 Polyalphabetic substitution • 4 Polygraphic substitution • 5 Mechanical substitution ciphers • 6 The one-time pad • 7 Substitution in modern cryptography • 8 Substitution ciphers in popular culture Simple substitution 1 ROT13 is a Caesar cipher, a type of substitution cipher. In ROT13, the alphabet is rotated 13 steps.
    [Show full text]
  • CLASSICAL CRYPTOGRAPHY COURSE by LANAKI February 22
    CLASSICAL CRYPTOGRAPHY COURSE BY LANAKI February 22, 1996 Revision 0 COPYRIGHT 1996 ALL RIGHTS RESERVED LECTURE 8 INTRODUCTION TO CRYPTARITHMS AND HILL CIPHER SUMMARY In Lecture 8, we depart from the schedule for a real treat. In the first part of this Lecture, we introduce Cryptarithms by our guest lecturer LEDGE (Dr. Gerhard D. Linz). LEDGE has already produced one of our better references on beginning cryptography [LEDG], and I appreciate his assistance in our course. The cryptarithms portion of this course will be presented in three lectures and for the final book labelled Lectures 20 - 23. Following the Cryptarithms section we introduce the Hill Cipher. Our second guest lecturer is NORTH DECODER. Dr. Jerry Metzger and his team are presenting you with the Crypto Drop Box and the ACA-L Listserver. The Hill cipher has six GIF files associated with it and can be found at the CDB. Waiting in wings patiently for my resource materials is TATTERS to present Cipher Exchange problems. INTRODUCTION TO CRYPTARITHMS (by LEDGE) Here's the first of the Cryptarithm lectures. It consists of a general introduction to the genre including how to read the problems. That's followed by an explanation of modulo arithmetic. Then we look at how to identify the letters that represent 0, 1 and 9, called digital characteristics. Then there are two sections on making inferences, each demonstrating a problem solution. Finally, there's a section on extracting square roots. Next lecture LEDGE will give some aids for solving multiplication problems and then go into base 11 and base 12 arithmetic.
    [Show full text]
  • Solving Cipher Secrets
    SOLVING CIPHER SECRETS Edited by M. E. Ohaver A PROFITABLE LESSON ON THE SOLUTION OF A CRYPTOGRAM IN AN UNKNOWN CIPHER SYSTEM-ALSO READER CIPHERS O solve a cryptogram in a cipher may be so unapparent as to require known cipher system, it is the application of delicate cryptographic only necessary to apply tests to discover their presence. methods peculiar to that If a comparison is again allowable, this cipher. But suppose the would be like identifying the man by his system is unknown. How, Bertillon measurements, or by his finger• then, would it be possible to determine the prints. method of solution? To demonstrate the practicability of these That the fans are much concerned with tesf s, we have applied some of them in this this question would seem to be indicated article to a cryptogram that was submitted by the volume of mail from readers who to this department without solution or ex• stale that they have successfully used the planation. different methods described in these columns This cryptogram was chosen from many for various ciphers, but who wonder if there similar ones for several reasons. In the first is any way of finding what method to use place, it illustrates all the points brought when the cipher is unknown. up by the various tests. Again, it happens Fortunately, in many cases a cipher will to be in a standard system that we wanted leave an indelible impress on a cryptogram, to present to our readers, anyway. And, allowing the system to be identified, or, at finally, the fact that the inditer was abso• any rate, to be recognized within limits, by lutely certain his specimen could not be de• certain more or less easily recognizable ciphered—an opinion he no longer holds—• characteristics.
    [Show full text]
  • Card-Present Processing for Cybersource Through Visanet Using the Simple Order API
    Title Page Card-Present Processing for Cybersource through VisaNet Using the Simple Order API Supplement to Credit Card Services for CyberSource through VisaNet Using the Simple Order API and PIN Debit Processing for CyberSource through VisaNet Using the Simple Order API Cybersource Contact Information For general information about our company, products, and services, go to http://www.cybersource.com. For sales questions about any CyberSource service, email [email protected] or call 650-432-7350 or 888-330-2300 (toll free in the United States). For support information about any CyberSource service, visit the Support Center: http://www.cybersource.com/support Copyright © 2020. CyberSource Corporation. All rights reserved. CyberSource Corporation ("CyberSource") furnishes this document and the software described in this document under the applicable agreement between the reader of this document ("You") and CyberSource ("Agreement"). You may use this document and/or software only in accordance with the terms of the Agreement. Except as expressly set forth in the Agreement, the information contained in this document is subject to change without notice and therefore should not be interpreted in any way as a guarantee or warranty by CyberSource. CyberSource assumes no responsibility or liability for any errors that may appear in this document. The copyrighted software that accompanies this document is licensed to You for use only in strict accordance with the Agreement. You should read the Agreement carefully before using the software. Except as permitted by the Agreement, You may not reproduce any part of this document, store this document in a retrieval system, or transmit this document, in any form or by any means, electronic, mechanical, recording, or otherwise, without the prior written consent of CyberSource.
    [Show full text]
  • Singular Value Analysis of Cryptograms Author(S): Cleve Moler and Donald Morrison Source: the American Mathematical Monthly, Vol
    Singular Value Analysis of Cryptograms Author(s): Cleve Moler and Donald Morrison Source: The American Mathematical Monthly, Vol. 90, No. 2 (Feb., 1983), pp. 78-87 Published by: Mathematical Association of America Stable URL: http://www.jstor.org/stable/2975804 . Accessed: 14/03/2011 13:52 Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at . http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use. Please contact the publisher regarding any further use of this work. Publisher contact information may be obtained at . http://www.jstor.org/action/showPublisher?publisherCode=maa. Each copy of any part of a JSTOR transmission must contain the same copyright notice that appears on the screen or printed page of such transmission. JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms of scholarship. For more information about JSTOR, please contact [email protected]. Mathematical Association of America is collaborating with JSTOR to digitize, preserve and extend access to The American Mathematical Monthly. http://www.jstor.org 78 CLEVEMOLER AND DONALD MORRISON [February newsletter culminated in the creation of our very successful, very well-received newsletter, FOCUS.
    [Show full text]
  • Cryptography: Symmetric Encryption Unit 3
    CS Matters in Maryland http://csmatters.org/curriculum/display/lesson/X... (http://csmatters.org) 3 - 11 0b11 - 0b1011 Cryptography: Symmetric Encryption Unit 3. Information and the Internet Revision Date: Jan 16, 2017 (Version 2.1) Duration: 1 50-minute session Lesson Summary Summary Students are introduced to the topic of cryptography and learn to perform two encryption techniques. The students will identify the role of the algorithm and key in the encryption process. Students will use abstraction to see the general process used in symmetric encryption. The students will consider the strength of ciphers and the importance of keeping the key a secret. Outcomes Students will understand how encryption is used to keep data secure. Students will learn how encrypting and decrypting data is accomplished using an algorithm and a key. Students will understand why the key must be kept a secret. Overview 1. Getting Started (5 min) - Journal 2. Introduction to Content (15 min) 1. Lesson Motivation [5 min] 2. Presenting the Key Concepts [10 min] 3. Guided Activities (25 min) 1. Practice [15 min] 2. Follow Up: Analyzing the Strength of Ciphers [5 min] 3. Follow Up: Defining Symmetric Encryption and Seeing the Abstraction in 1 of 7 2/7/20, 1:24 PM CS Matters in Maryland http://csmatters.org/curriculum/display/lesson/X... Symmetric Encryption Systems [5 min] 4. Wrap Up (5 min) - Journal Learning Objectives CSP Objectives Math Common Core Practice: MP1: Make sense of problems and persevere in solving them. MP2: Reason abstractly and quantitatively. MP8: Look for and express regularity in repeated reasoning.
    [Show full text]
  • A Closer View of Running-Key Cipher on Natural Languages and Its Extension for New Applications in Cryptography*
    THE PUBLISHING HOUSE PROCEEDINGS OF THE ROMANIAN ACADEMY, Series A, OF THE ROMANIAN ACADEMY Volume 13, Number 2/2012, pp. 157–166 A CLOSER VIEW OF RUNNING-KEY CIPHER ON NATURAL LANGUAGES AND ITS EXTENSION FOR NEW APPLICATIONS IN CRYPTOGRAPHY* Adriana VLAD1,2, Azeem ILYAS1, Adrian LUCA1 1“Politehnica” University of Bucharest, Faculty of Electronics, Telecommunications and Information Technology, 1-3, Iuliu Maniu Bvd. Bucharest 6, Romania 2The Research Institute for Artificial Intelligence, Romanian Academy, 13, Calea 13 Septembrie, Bucharest 5, Romania E-mail: [email protected], [email protected] The paper supports a debate concerning the meaning and the importance of redundancy and ergodicity in cryptography. The discussion is mainly organized around a very thought-provoking enciphering method, running-key cipher. The paper comes with a new view of running-key method which permits to resume and extend it for ergodic sources in order to provide good quality key generators for cryptography. We first apply the running-key method on natural language and then we extend it on logistic map. Finally some conclusions are drawn even for image enciphering. Key words: running-key cipher, noisy channel, redundancy, ergodic source, logistic map, image encryption. 1. INTRODUCTION In 1945, Claude Shannon wrote his results concerning what is so specific in a message source that makes possible to break a cipher in a classified paper, [1]. The content of the paper appeared in the open literature in 1949, [2] – a fundamental paper in the field; since then, cryptography turned from an art into science. The notions of entropy, redundancy, ergodicity and uncertainty channel that Shannon worked out for his evolving information theory [3] had found a perfect support in cryptography both for their perceiving and for their utility in practice.
    [Show full text]
  • A Systematic Study on Classical Cryptographic Cypher in Order to Design a Smallest Cipher
    International Journal of Scientific and Research Publications, Volume 9, Issue 12, December 2019 507 ISSN 2250-3153 A systematic study on classical cryptographic cypher in order to design a smallest cipher Md. Shamim Hossain Biswas*, Dr. Md. Asraf Ali, Dr. Mostafijur Rahman, Mr. Md. Khaled Sohel, Mr. Md. Maruf Hasan, Kausik Sarkar, Abu Shamim Aminur razzaque * Department of Software Engineering, Daffodil International University Bangladesh DOI: 10.29322/IJSRP.9.12.2019.p9662 http://dx.doi.org/10.29322/IJSRP.9.12.2019.p9662 Abstract- The cryptography is the branch of Cryptology. It is a 1.1 Classical Cypher combination of mathematics and computer Science. It is the study of obscuring information in cyberspace. Cipher is a set of XOR cipher, NULL Cipher, Baconian Cipher, Caesar algorithm which comprise of encryption and decryption. The Cipher, ROT13 Cipher, Affine Cipher, Atbash Cipher, cipher paly important role in modern technology. The keyword cipher, Auto-key Cipher, Bifid cipher, Trifid technologies involving communication including the Internet, cipher, Railfence Cipher, ADFGVX Cipher, ADFGX Mobile Phones, Digital Television, and ATM machine rely on Cipher, Straddling Checkerboard Cipher, Permutation cipher in order to maintain security and privacy. Thinking about Cipher, Running Key Cipher, Nomenclators Cipher, Four- aforesaid importance of cipher in cryptography, in this article, square cipher, Beaufort Cipher, Base64 Cipher, Lorenz we have designed a smallest cipher which may be efficient in Cipher, Enigma Machine Cipher, Polybius Square Cipher, RFID chips. The smallest cipher has been comprised of five Simple Polybius Cipher, Porta Cipher, Vigenere Cipher, mathematical operation: Exponentiation, Multiplication, Homophonic Substitution Cipher, Playfair Cipher, Hill Addition, Subtraction and Division based on systematic study of cipher, Fractionated Morse Cipher, Scytale Cipher, Grille classical cipher.
    [Show full text]