DOCSLIB.ORG

Dragon Crypto – an Innovative Cryptosystem

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Dragon Crypto – an Innovative Cryptosystem International Journal of Computer Applications (0975 – 8887) Volume 176 – No. 29, June 2020 Dragon Crypto – An Innovative Cryptosystem Awnon Bhowmik Unnikrishnan Menon Department of Mathematics and Computer Science Department of Electrical and Electronics Engineering CUNY York College Vellore Institute of Technology, Vellore 94 – 20 Guy R. Brewer Blvd Tamil Nadu 632014 Jamaica, NY 11451 ABSTRACT around with twin dragon, tetra dragon and septa dragon In recent years cyber-attacks are continuously developing. curves, which was generated as a fun part of this project and This means that hackers can find their way around the named the rainbow dragon (Bhowmik & Menon, Rainbow traditional cryptosystems. This calls for new and more secure Dragon, 2020) since each part was given a color of the cryptosystems to take their place. This paper outlines a new VIBGYOR. cryptosystem based on the dragon curve fractal. The security level of this scheme is based on multiple private keys, that are 2. THE DRAGON FRACTAL crucial for effective encryption and decryption of data. This A fractal is just a repetition of an initial geometric shape. This paper discusses, how core concepts emerging from fractal is generated by something known as the Iterative Function geometry can be used as a trapdoor function for this System (IFS). The dragon curve is one such fractal. There are cryptosystem. multiple ways to generate this fractal. General Terms 2.1 Generating the Dragon Fractal Data Security, Recreational Cryptography This dragon curve fractal, or its generation algorithm forms the basis of this cryptosystem, and hence the proposed name Keywords Dragon Crypto. Here, an arbitrary string of characters is Dragon curve, dragon fractal, dragon curve fractal, heighway passed through the Koblitz Encoder to obtain the starting dragon curve, heighway dragon fractal, cryptography, point for the IFS. cryptosystem, crypto system, secure encryption, Iterative The iterations of the dragon curve can easily be generated by Function System, IFS, iteration, iteration, precision, trapdoor folding a strip of paper 푛 number of times. A strip of paper is function. taken and folded in half, to the right. This process is repeated, folded in half again to the right. The process is continued as 1. INTRODUCTION many times as required, which is usually many times. It can Fractals are just a self-replication of a pattern. There are many be easily noticed that it will be hard to fold the strip after a fractals that are found in nature. One such fractal curve is certain point. Suppose the strip is folded twice. When known as Heighway Dragon, or simply the Dragon Curve. unfolded and relaxed, it is observed that every bend/corner of Because this is a fractal, hence it requires an IFS (Iterated the strip has a 90∘ turn. It is now the second iteration of the Function System). In simple words, an initial simple pattern is dragon curve. If it is folded again and opened, it would be the made and thrown into a recursive function, before running a third iteration and so on. Following is a visual of what is loop and calling the function repeatedly until the required described here… objective is accomplished. The idea of this cryptosystem came up due to the blog post (Bhowmik & Menon, 2018) about coding up a dragon curve fractal and recently while playing Figure 1. Paper folding method Now all that’s left to do is to visualize a turtle walking along If the 푛푡ℎ iteration is known, then the 푛 + 1 푡ℎ iteration can these lines and it should be able to predict how to move. Let F be predicted in the following way. Suppose the objective is to = forward, L = left, R = right. The following sequences are derive the third iteration from the second iteration associated with the respective iterations… The last element of the sequence if ignored for the 1st iteration – F L F L moment (F L F L F R F). In the remaining elements, nd the L’s and R’s are switched. The sequence now 2 iteration – F L F L F R F L becomes (F R F R F L F R) rd 3 iteration – F L F L F R F L F L F R F R F L Now the elements about the midpoint are flipped. 37 International Journal of Computer Applications (0975 – 8887) Volume 176 – No. 29, June 2020 The sequence turns into (R F L F R F R F) Appending the result of step 4 to the 1st iteration will generate the 3rd iteration. The last element which was ignored in the first step is appended to the sequence (R F L F R F R F L) Using the same logic, the next iterations can be predicted. A fractal curve generated with 15 iterations is as follows… Figure 2. Dragon Curve Fractal 3. KOBLITZ ENCODING AND Thus, the message 푀 is encoded as an element of the Abelian group 퐺 = 퐸 픽 . The following is performed for decryption. DECODING ALGORITHM 푝 The encoding algorithm (Brady, Davis, & Tracy, 2010) is as Considering each point 푥, 푦 and setting follows 푥 − 1 푚 = Given a message 푀, convert each character 푚푘 into 푘 16 a number 푎푘 using Unicode, where 푏 = 2 and 푚 16 Which is essentially means 푎 = 푚표푑 푏. Thus, 0 < 푎푘 < 2 푘 푏푘−1 each character is recovered and concatenated to produce Convert the message 푀 into an integer using the original message 푀. 푛 푘−1 4. EQUIVALENCE CLASS MODULO 4 푚 = 푎푘 푏 푘=1 Any number divided by 4 can result in remainders 0,1,2,3 . So, any number divided by 4 is one of 4푟, 4푟 + 1,4푟 + 2,4푟 + In practice an 푛 ≤ 160 is chosen such that 푚 3. However, if only odd numbers are considered, they are of satisfies the form 4푟 + 1 or 4푟 + 3. Numbers of these forms are useful 푚 ≤ 216⋅160 < 푝 in figuring out important information regarding the dragon curve and could be an element of penetration attempt by an 푝 A number 푑 is fixed such that 푑 ≤ . In practice the interceptor. This is described in detail at a later section. 푚 prime 푝 is chosen large enough so that 푑 = 100 can Theorem 1. Let 푅 ⊆ 푆 × 푆 be an equivalence class on a set 푆. be allowed. Then the set of ℛ-classes constitutes the whole of 푆. For integers 푗 = 0,1,2, … 푑 − 1, the following are Proof. performed ∀푥 ∈ 푆: 푥 ∈ 푥 ℛ Definition of equivalence class 푥 coordinate of a point on the elliptic curve is computed as ¬ ∃푥 ∈ 푆: 푥 ∉ 푥 ℛ Assertion of universality 푥푗 ¬ ∃푥 ∈ 푆: 푥 ∉∪ 푥 Definition of set union 푥 = 푑푚 + 푗 푚표푑 푝 where 푚 = ℛ 푗 푑 ∀푥 ∈ 푆: 푥 ∈∪ 푆/ℛ Assertion of universality 3 Compute 푠푗 = 푥푗 + 퐴푥 + 퐵 푚표푑 푝 푆 ⊆∪ 푆/ℛ Definition of a subset 푝+1 2 If 푠푗 ≡ 푠푗 푚표푑 푝, then 푦 coordinate of a point Also: on the elliptic curve is defined as 푦푗 = 푝+1 ∀푋 ∈ 푆/ℛ: 푋 ⊆ 푆 Definition of equivalence class 푠 4 푚표푑 푝. Return the point 푥 , 푦 . 푗 푗 푗 ∪ 푆/ℛ ⊆ 푆 Assertion of universality 38 International Journal of Computer Applications (0975 – 8887) Volume 176 – No. 29, June 2020 By definition of set equality 푥푗 , 푦푗 is stored into another list. ∪ 푆/ℛ ⊆ 푆 c. A special padding is applied on the list of end points And so, the set of all ℛ-classes constitutes the whole of 푆. as follows (Union of Equivalence Classes is Whole Set, n.d.) "푋푥1푋푥2 ⋯ 푋푥푛 푋푌푦1푌푦2 ⋯ 푦푛 푌" 5. TRAPDOOR FUNCTION This turns it into a string. This string is the A trapdoor function is a highly useful concept in modern encrypted cipher text. cryptography. These are functions that are easy to compute in 3. Decryption one direction but extremely hard to compute in reverse if a. Padding is removed and points are regenerated. The certain parameters or critical information for reversal is string is parsed through and split into two sequences lacked. The main novelty of this cryptosystem is the use of the about the "푋푌" mark. So now there are two strings Heighway Dragon Fractal as a trapdoor function. The algorithm starts off with a secret message that needs to be 푋푥1푋푥2 ⋯ 푋푥푛 푋 and 푌푦1푌푦2 ⋯ 푦푛 푌 encrypted (called the plainText). Next, the ordered set 푥 , 푦 of endpoints are recovered by The Koblitz Encoder accepts the plainText along with the 푗 푗 curve parameters (obtained from the private key). The Koblitz parsing through the two strings. Encoder spits out an encoded point in 2D Cartesian space for b. The list of end point coordinates is taken and based each character present in the plainText with the help of curve on the parameters present in the private key (size, parameters. These points are now the starting point of the iterations, angle), a dragon curve fractal is generated dragon curve fractals. For each character, a corresponding in reverse by initializing the turtle at an endpoint starting point and a dragon fractal are generated. facing the correct direction based on the angle. If Now the components of the private key (including size, the private key parameters are all correct, this iterations, angle) are used to generate the fractal for each reverse tracing means the fractal will end at the character from their corresponding starting points. initial starting point. This process is repeated for all characters. The points obtained are stored in a list. 5.1 Private key parameters The list of points obtained from previous step is The following are the private keys involved in the c.
Load more

Recommended publications
  • Image Encryption and Decryption Schemes Using Linear and Quadratic Fractal Algorithms and Their Systems
    Image Encryption and Decryption Schemes Using Linear and Quadratic Fractal Algorithms and Their Systems Anatoliy Kovalchuk 1 [0000-0001-5910-4734], Ivan Izonin 1 [0000-0002-9761-0096] Christine Strauss 2 [0000-0003-0276-3610], Mariia Podavalkina 1 [0000-0001-6544-0654], Natalia Lotoshynska 1 [0000-0002-6618-0070] and Nataliya Kustra 1 [0000-0002-3562-2032] 1 Department of Publishing Information Technologies, Lviv Polytechnic National University, Lviv, Ukraine [email protected], [email protected], [email protected], [email protected], [email protected] 2 Department of Electronic Business, University of Vienna, Vienna, Austria [email protected] Abstract. Image protection and organizing the associated processes is based on the assumption that an image is a stochastic signal. This results in the transition of the classic encryption methods into the image perspective. However the image is some specific signal that, in addition to the typical informativeness (informative data), also involves visual informativeness. The visual informativeness implies additional and new challenges for the issue of protection. As it involves the highly sophisticated modern image processing techniques, this informativeness enables unauthorized access. In fact, the organization of the attack on an encrypted image is possible in two ways: through the traditional hacking of encryption methods or through the methods of visual image processing (filtering methods, contour separation, etc.). Although the methods mentioned above do not fully reproduce the encrypted image, they can provide an opportunity to obtain some information from the image. In this regard, the encryption methods, when used in images, have another task - the complete noise of the encrypted image.
    [Show full text]
  • Comparison of 256-Bit Stream Ciphers at the Beginning of 2006
    Comparison of 256-bit stream ciphers at the beginning of 2006 Daniel J. Bernstein ? [email protected] Abstract. This paper evaluates and compares several stream ciphers that use 256-bit keys: counter-mode AES, CryptMT, DICING, Dragon, FUBUKI, HC-256, Phelix, Py, Py6, Salsa20, SOSEMANUK, VEST, and YAMB. 1 Introduction ECRYPT, a consortium of European research organizations, issued a Call for Stream Cipher Primitives in November 2004. A remarkable variety of ciphers were proposed in response by a total of 97 authors spread among Australia, Belgium, Canada, China, Denmark, England, France, Germany, Greece, Israel, Japan, Korea, Macedonia, Norway, Russia, Singapore, Sweden, Switzerland, and the United States. Evaluating a huge pool of stream ciphers, to understand the merits of each cipher, is not an easy task. This paper simplifies the task by focusing on the relatively small pool of ciphers that allow 256-bit keys. Ciphers limited to 128- bit keys (or 80-bit keys) are ignored. See Section 2 to understand my interest in 256-bit keys. The ciphers allowing 256-bit keys are CryptMT, DICING, Dragon, FUBUKI, HC-256, Phelix, Py, Py6, Salsa20, SOSEMANUK, VEST, and YAMB. I included 256-bit AES in counter mode as a basis for comparison. Beware that there are unresolved claims of attacks against Py (see [4] and [3]), SOSEMANUK (see [1]), and YAMB (see [5]). ECRYPT, using measurement tools written by Christophe De Canni`ere, has published timings for each cipher on several common general-purpose CPUs. The original tools and timings used reference implementations (from the cipher authors) but were subsequently updated for faster implementations (also from the cipher authors).
    [Show full text]
  • CHUCK CHONSON: AMERICAN CIPHER by ERIC NOLAN A
    CHUCK CHONSON: AMERICAN CIPHER By ERIC NOLAN A THESIS PRESENTED TO THE GRADUATE SCHOOL OF THE UNIVERSITY OF FLORIDA IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF MASTER OF FINE ARTS UNIVERSITY OF FLORIDA 2003 Copyright 2003 by Eric Nolan To my parents, and to Nicky ACKNOWLEDGMENTS I thank my parents, my teachers, and my colleagues. Special thanks go to Dominique Wilkins and Don Mattingly. iv TABLE OF CONTENTS ACKNOWLEDGMENTS..................................................................................................iv ABSTRACT......................................................................................................................vii CHAPTER 1 LIVE-IN GIRLFRIEND, SHERRY CRAVENS ...................................................... 1 2 DEPARTMENT CHAIR, FURRY LUISSON..........................................................8 3 TRAIN CONDUCTOR, BISHOP PROBERT........................................................ 12 4 TWIN BROTHER, MARTY CHONSON .............................................................. 15 5 DEALER, WILLIE BARTON ................................................................................ 23 6 LADY ON BUS, MARIA WOESSNER................................................................. 33 7 CHILDHOOD PLAYMATE, WHELPS REMIEN ................................................ 36 8 GUY IN TRUCK, JOE MURHPY .........................................................................46 9 EX-WIFE, NORLITTA FUEGOS...........................................................................49 10
    [Show full text]
  • Classical Math Fractals in Postscript Fractal Geometry I
    Kees van der Laan VOORJAAR 2013 49 Classical Math Fractals in PostScript Fractal Geometry I Abstract Classical mathematical fractals in BASIC are explained and converted into mean-and-lean EPSF defs, of which the .eps pictures are delivered in .pdf format and cropped to the prescribed BoundingBox when processed by Acrobat Pro, to be included easily in pdf(La)TEX, Word, … documents. The EPSF fractals are transcriptions of the Turtle Graphics BASIC codes or pro- grammed anew, recursively, based on the production rules of oriented objects. The Linden- mayer production rules are enriched by PostScript concepts. Experience gained in converting a TEX script into WYSIWYG Word is communicated. Keywords Acrobat Pro, Adobe, art, attractor, backtracking, BASIC, Cantor Dust, C curve, dragon curve, EPSF, FIFO, fractal, fractal dimension, fractal geometry, Game of Life, Hilbert curve, IDE (In- tegrated development Environment), IFS (Iterated Function System), infinity, kronkel (twist), Lauwerier, Lévy, LIFO, Lindenmayer, minimal encapsulated PostScript, minimal plain TeX, Minkowski, Monte Carlo, Photoshop, production rule, PSlib, self-similarity, Sierpiński (island, carpet), Star fractals, TACP,TEXworks, Turtle Graphics, (adaptable) user space, von Koch (island), Word Contents - Introduction - Lévy (Properties, PostScript program, Run the program, Turtle Graphics) Cantor - Lindenmayer enriched by PostScript concepts for the Lévy fractal 0 - von Koch (Properties, PostScript def, Turtle Graphics, von Koch island) Cantor1 - Lindenmayer enriched by PostScript concepts for the von Koch fractal Cantor2 - Kronkel Cantor - Minkowski 3 - Dragon figures - Stars - Game of Life - Annotated References - Conclusions (TEX mark up, Conversion into Word) - Acknowledgements (IDE) - Appendix: Fractal Dimension - Appendix: Cantor Dust Peano curves: order 1, 2, 3 - Appendix: Hilbert Curve - Appendix: Sierpiński islands Introduction My late professor Hans Lauwerier published nice, inspiring booklets about fractals with programs in BASIC.
    [Show full text]
  • Applications of Search Techniques to Cryptanalysis and the Construction of Cipher Components. James David Mclaughlin Submitted F
    Applications of search techniques to cryptanalysis and the construction of cipher components. James David McLaughlin Submitted for the degree of Doctor of Philosophy (PhD) University of York Department of Computer Science September 2012 2 Abstract In this dissertation, we investigate the ways in which search techniques, and in particular metaheuristic search techniques, can be used in cryptology. We address the design of simple cryptographic components (Boolean functions), before moving on to more complex entities (S-boxes). The emphasis then shifts from the construction of cryptographic arte- facts to the related area of cryptanalysis, in which we first derive non-linear approximations to S-boxes more powerful than the existing linear approximations, and then exploit these in cryptanalytic attacks against the ciphers DES and Serpent. Contents 1 Introduction. 11 1.1 The Structure of this Thesis . 12 2 A brief history of cryptography and cryptanalysis. 14 3 Literature review 20 3.1 Information on various types of block cipher, and a brief description of the Data Encryption Standard. 20 3.1.1 Feistel ciphers . 21 3.1.2 Other types of block cipher . 23 3.1.3 Confusion and diffusion . 24 3.2 Linear cryptanalysis. 26 3.2.1 The attack. 27 3.3 Differential cryptanalysis. 35 3.3.1 The attack. 39 3.3.2 Variants of the differential cryptanalytic attack . 44 3.4 Stream ciphers based on linear feedback shift registers . 48 3.5 A brief introduction to metaheuristics . 52 3.5.1 Hill-climbing . 55 3.5.2 Simulated annealing . 57 3.5.3 Memetic algorithms . 58 3.5.4 Ant algorithms .
    [Show full text]
  • Fractals a Fractal Is a Shape That Seem to Have the Same Structure No Matter How Far You Zoom In, Like the figure Below
    Fractals A fractal is a shape that seem to have the same structure no matter how far you zoom in, like the figure below. Sometimes it's only part of the shape that repeats. In the figure below, called an Apollonian Gasket, no part looks like the whole shape, but the parts near the edges still repeat when you zoom in. Today you'll learn how to construct a few fractals: • The Snowflake • The Sierpinski Carpet • The Sierpinski Triangle • The Pythagoras Tree • The Dragon Curve After you make a few of those, try constructing some fractals of your own design! There's more on the back. ! Challenge Problems In order to solve some of the more difficult problems today, you'll need to know about the geometric series. In a geometric series, we add up a sequence of terms, 1 each of which is a fixed multiple of the previous one. For example, if the ratio is 2 , then a geometric series looks like 1 1 1 1 1 1 1 + + · + · · + ::: 2 2 2 2 2 2 1 12 13 = 1 + + + + ::: 2 2 2 The geometric series has the incredibly useful property that we have a good way of 1 figuring out what the sum equals. Let's let r equal the common ratio (like 2 above) and n be the number of terms we're adding up. Our series looks like 1 + r + r2 + ::: + rn−2 + rn−1 If we multiply this by 1 − r we get something rather simple. (1 − r)(1 + r + r2 + ::: + rn−2 + rn−1) = 1 + r + r2 + ::: + rn−2 + rn−1 − ( r + r2 + ::: + rn−2 + rn−1 + rn ) = 1 − rn Thus 1 − rn 1 + r + r2 + ::: + rn−2 + rn−1 = : 1 − r If we're clever, we can use this formula to compute the areas and perimeters of some of the shapes we create.
    [Show full text]
  • Math Morphing Proximate and Evolutionary Mechanisms
    Curriculum Units by Fellows of the Yale-New Haven Teachers Institute 2009 Volume V: Evolutionary Medicine Math Morphing Proximate and Evolutionary Mechanisms Curriculum Unit 09.05.09 by Kenneth William Spinka Introduction Background Essential Questions Lesson Plans Website Student Resources Glossary Of Terms Bibliography Appendix Introduction An important theoretical development was Nikolaas Tinbergen's distinction made originally in ethology between evolutionary and proximate mechanisms; Randolph M. Nesse and George C. Williams summarize its relevance to medicine: All biological traits need two kinds of explanation: proximate and evolutionary. The proximate explanation for a disease describes what is wrong in the bodily mechanism of individuals affected Curriculum Unit 09.05.09 1 of 27 by it. An evolutionary explanation is completely different. Instead of explaining why people are different, it explains why we are all the same in ways that leave us vulnerable to disease. Why do we all have wisdom teeth, an appendix, and cells that if triggered can rampantly multiply out of control? [1] A fractal is generally "a rough or fragmented geometric shape that can be split into parts, each of which is (at least approximately) a reduced-size copy of the whole," a property called self-similarity. The term was coined by Beno?t Mandelbrot in 1975 and was derived from the Latin fractus meaning "broken" or "fractured." A mathematical fractal is based on an equation that undergoes iteration, a form of feedback based on recursion. http://www.kwsi.com/ynhti2009/image01.html A fractal often has the following features: 1. It has a fine structure at arbitrarily small scales.
    [Show full text]
  • Understanding the Mandelbrot and Julia Set
    Understanding the Mandelbrot and Julia Set Jake Zyons Wood August 31, 2015 Introduction Fractals infiltrate the disciplinary spectra of set theory, complex algebra, generative art, computer science, chaos theory, and more. Fractals visually embody recursive structures endowing them with the ability of nigh infinite complexity. The Sierpinski Triangle, Koch Snowflake, and Dragon Curve comprise a few of the more widely recognized iterated function fractals. These recursive structures possess an intuitive geometric simplicity which makes their creation, at least at a shallow recursive depth, easy to do by hand with pencil and paper. The Mandelbrot and Julia set, on the other hand, allow no such convenience. These fractals are part of the class: escape-time fractals, and have only really entered mathematicians’ consciousness in the late 1970’s[1]. The purpose of this paper is to clearly explain the logical procedures of creating escape-time fractals. This will include reviewing the necessary math for this type of fractal, then specifically explaining the algorithms commonly used in the Mandelbrot Set as well as its variations. By the end, the careful reader should, without too much effort, feel totally at ease with the underlying principles of these fractals. What Makes The Mandelbrot Set a set? 1 Figure 1: Black and white Mandelbrot visualization The Mandelbrot Set truly is a set in the mathematica sense of the word. A set is a collection of anything with a specific property, the Mandelbrot Set, for instance, is a collection of complex numbers which all share a common property (explained in Part II). All complex numbers can in fact be labeled as either a member of the Mandelbrot set, or not.
    [Show full text]
  • Exploring the Effect of Direction on Vector-Based Fractals
    Exploring the Effect of Direction on Vector-Based Fractals Magdy Ibrahim and Robert J. Krawczyk College of Architecture Illinois Institute of Technology 3360 S. State St. Chicago, IL, 60616, USA Email: [email protected], [email protected] Abstract This paper investigates an approach to begin the study of fractals in architectural design. Vector-based fractals are studied to determine if the modification of vector direction in either the generator or the initiator will develop alternate fractal forms. The Koch Snowflake is used as the demonstrating fractal. Introduction A fractal is an object or quantity that displays self-similarity on all scales. The object need not exhibit exactly the same structure at all scales, but the same “type” of structures must appear on all scales [7]. Fractals were first discussed by Mandelbrot in the 1970s [4], but the idea was identified as early as 1925. Fractals have been investigated for their visual qualities as art, their relationship to explain natural processes, music, medicine, and in mathematics [5]. Javier Barrallo classified fractals [2] into six main groups depending on their type: 1. Fractals derived from standard geometry by using iterative transformations on an initial common figure. 2. IFS (Iterated Function Systems), this is a type of fractal introduced by Michael Barnsley. 3. Strange attractors. 4. Plasma fractals. Created with techniques like fractional Brownian motion. 5. L-Systems, also called Lindenmayer systems, were not invented to create fractals but to model cellular growth and interactions. 6. Fractals created by the iteration of complex polynomials. From the mathematical point of view, we can classify fractals into three major categories.
    [Show full text]
  • Cryptology: an Historical Introduction DRAFT
    Cryptology: An Historical Introduction DRAFT Jim Sauerberg February 5, 2013 2 Copyright 2013 All rights reserved Jim Sauerberg Saint Mary's College Contents List of Figures 8 1 Caesar Ciphers 9 1.1 Saint Cyr Slide . 12 1.2 Running Down the Alphabet . 14 1.3 Frequency Analysis . 15 1.4 Linquist's Method . 20 1.5 Summary . 22 1.6 Topics and Techniques . 22 1.7 Exercises . 23 2 Cryptologic Terms 29 3 The Introduction of Numbers 31 3.1 The Remainder Operator . 33 3.2 Modular Arithmetic . 38 3.3 Decimation Ciphers . 40 3.4 Deciphering Decimation Ciphers . 42 3.5 Multiplication vs. Addition . 44 3.6 Koblitz's Kid-RSA and Public Key Codes . 44 3.7 Summary . 48 3.8 Topics and Techniques . 48 3.9 Exercises . 49 4 The Euclidean Algorithm 55 4.1 Linear Ciphers . 55 4.2 GCD's and the Euclidean Algorithm . 56 4.3 Multiplicative Inverses . 59 4.4 Deciphering Decimation and Linear Ciphers . 63 4.5 Breaking Decimation and Linear Ciphers . 65 4.6 Summary . 67 4.7 Topics and Techniques . 67 4.8 Exercises . 68 3 4 CONTENTS 5 Monoalphabetic Ciphers 71 5.1 Keyword Ciphers . 72 5.2 Keyword Mixed Ciphers . 73 5.3 Keyword Transposed Ciphers . 74 5.4 Interrupted Keyword Ciphers . 75 5.5 Frequency Counts and Exhaustion . 76 5.6 Basic Letter Characteristics . 77 5.7 Aristocrats . 78 5.8 Summary . 80 5.9 Topics and Techniques . 81 5.10 Exercises . 81 6 Decrypting Monoalphabetic Ciphers 89 6.1 Letter Interactions . 90 6.2 Decrypting Monoalphabetic Ciphers .
    [Show full text]
  • Furniture Design Inspired from Fractals
    169 Rania Mosaad Saad Furniture design inspired from fractals. Dr. Rania Mosaad Saad Assistant Professor, Interior Design and Furniture Department, Faculty of Applied Arts, Helwan University, Cairo, Egypt Abstract: Keywords: Fractals are a new branch of mathematics and art. But what are they really?, How Fractals can they affect on Furniture design?, How to benefit from the formation values and Mandelbrot Set properties of fractals in Furniture Design?, these were the research problem . Julia Sets This research consists of two axis .The first axe describes the most famous fractals IFS fractals were created, studies the Fractals structure, explains the most important fractal L-system fractals properties and their reflections on furniture design. The second axe applying Fractal flame functional and aesthetic values of deferent Fractals formations in furniture design Newton fractals inspired from them to achieve the research objectives. Furniture Design The research follows the descriptive methodology to describe the fractals kinds and properties, and applied methodology in furniture design inspired from fractals. Paper received 12th July 2016, Accepted 22th September 2016 , Published 15st of October 2016 nearly identical starting positions, and have real Introduction: world applications in nature and human creations. Nature is the artist's inspiring since the beginning Some architectures and interior designers turn to of creation. Despite the different artistic trends draw inspiration from the decorative formations, across different eras- ancient and modern- and the geometric and dynamic properties of fractals in artists perception of reality, but that all of these their designs which enriched the field of trends were united in the basic inspiration (the architecture and interior design, and benefited nature).
    [Show full text]
  • Voice Encryption Using Twin Stream Cipher Algorithm تشفير الصوت باستخدام خوارزمية التوأم
    Voice Encryption Using Twin Stream Cipher Algorithm تشفير الصوت باستخدام خوارزمية التوأم اﻻنسيابية Prepared by Omar Mejbel Hammad Aljouani ((401320142)) Supervisor Dr. Hebah H. O. Nasereddin Dr. Abdulkareem O. Ibadi Master Thesis Submitted in Partial Fulfillment of the Requirements of the Master Degree in Computer Science Department of Computer Science Faculty of Information Technology Middle East University Amman - Jordan January - 2016 II ((بسم هللا الرحمن الرحيم(( ّ يَ ْر ف عَََللاَهَا ّل ذي نََآ مَ هنواَ م ْن هك ْمََ وَا ّلَ ذي نََ} ه ه ْ ْ {أَوتواَال عل مََ دَ ر جات ))صدق هللا العظيم(( II III IV Acknowledgment I utilize this opportunity to thank everyone helped me reach this stage and everyone who encourage me during performing this thesis. I want to thank Dr. Hebah H. O. Nasereddin for her guidance and supervision during writing this thesis. Extended thanks are also for my family and friends who encourage me during writing this thesis. I also want to thank everyone who believes that the knowledge is right for everyone. The greatest thank ever to assistant prof. Abdulkareem O. Ibadi, the head of software engineering department at Baghdad College for economic sciences. V Dedication اهدي خﻻصة جهدي العلمي المتواضع الى : قرة عيني الرسول محمد عليه افضل الصﻻة واتم التسليم ...... وطني العراق الجريح .................................... اخي الشهيد الحاضر الغائب صهيب ................... والدي ووالدتي واختي رفاق دربي ومسيرتي ............... كل من كان له بصمة بجهدي العلمي هذا............. كل الشهداء الذين استشهدوا برصاص الغدر والخيانة ...... كل من كان يدعي لي ويوجهني ويتمنى لي الخير ......... جامعة بغداد أخص بها كلية التربية ابن الهيثم ....... اﻻعدادية المركزية للبنين .................. VI Table of Contents AUTHORIZATION STATEMENT ..........................................................
    [Show full text]