DOCSLIB.ORG

Primality Testing for Beginners

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker http://dx.doi.org/10.1090/stml/070 Primality Testing for Beginners STUDENT MATHEMATICAL LIBRARY Volume 70 Primality Testing for Beginners Lasse Rempe-Gillen Rebecca Waldecker American Mathematical Society Providence, Rhode Island Editorial Board Satyan L. Devadoss John Stillwell Gerald B. Folland (Chair) Serge Tabachnikov The cover illustration is a variant of the Sieve of Eratosthenes (Sec- tion 1.5), showing the integers from 1 to 2704 colored by the number of their prime factors, including repeats. The illustration was created us- ing MATLAB. The back cover shows a phase plot of the Riemann zeta function (see Appendix A), which appears courtesy of Elias Wegert (www.visual.wegert.com). 2010 Mathematics Subject Classification. Primary 11-01, 11-02, 11Axx, 11Y11, 11Y16. For additional information and updates on this book, visit www.ams.org/bookpages/stml-70 Library of Congress Cataloging-in-Publication Data Rempe-Gillen, Lasse, 1978– author. [Primzahltests f¨ur Einsteiger. English] Primality testing for beginners / Lasse Rempe-Gillen, Rebecca Waldecker. pages cm. — (Student mathematical library ; volume 70) Translation of: Primzahltests f¨ur Einsteiger : Zahlentheorie - Algorithmik - Kryptographie. Includes bibliographical references and index. ISBN 978-0-8218-9883-3 (alk. paper) 1. Number theory. I. Waldecker, Rebecca, 1979– author. II. Title. QA241.R45813 2014 512.72—dc23 2013032423 Copying and reprinting. Individual readers of this publication, and nonprofit libraries acting for them, are permitted to make fair use of the material, such as to copy a chapter for use in teaching or research. Permission is granted to quote brief passages from this publication in reviews, provided the customary acknowledgment of the source is given. Republication, systematic copying, or multiple reproduction of any material in this publication is permitted only under license from the American Mathematical Society. Requests for such permission should be addressed to the Acquisitions Department, American Mathematical Society, 201 Charles Street, Providence, Rhode Island 02904- 2294 USA. Requests can also be made by e-mail to [email protected]. c 2014 by the authors. Printed in the United States of America. ∞ The paper used in this book is acid-free and falls within the guidelines established to ensure permanence and durability. Visit the AMS home page at http://www.ams.org/ 10 9 8 7 6 5 4 3 2 1 18 17 16 15 14 For our spouses, Emma and Lars Contents Preface xi Introduction 1 Part 1. Foundations Chapter 1. Natural numbers and primes 13 §1.1. The natural numbers 13 §1.2. Divisibility and primes 26 §1.3. Prime factor decomposition 31 §1.4. The Euclidean algorithm 35 §1.5. The Sieve of Eratosthenes 39 §1.6. There are infinitely many primes 41 Further reading 42 Chapter 2. Algorithms and complexity 43 §2.1. Algorithms 43 §2.2. Decidable and undecidable problems 52 §2.3. Complexity of algorithms and the class P 57 §2.4. The class NP 68 vii viii Contents §2.5. Randomized algorithms 73 Further reading 81 Chapter 3. Foundations of number theory 83 §3.1. Modular arithmetic 84 §3.2. Fermat’s Little Theorem 94 §3.3. A first primality test 104 §3.4. Polynomials 107 §3.5. Polynomials and modular arithmetic 120 Further reading 127 Chapter 4. Prime numbers and cryptography 129 §4.1. Cryptography 129 §4.2. RSA 132 §4.3. Distribution of primes 136 §4.4. Proof of the weak prime number theorem 139 §4.5. Randomized primality tests 143 Further reading 150 Part 2. The AKS Algorithm Chapter 5. The starting point: Fermat for polynomials 153 §5.1. A generalization of Fermat’s Theorem 153 §5.2. The idea of the AKS algorithm 159 §5.3. The Agrawal-Biswas test 163 Chapter 6. The theorem of Agrawal, Kayal, and Saxena 169 §6.1. Statement of the theorem 170 §6.2. The idea of the proof 171 §6.3. The number of polynomials in P 173 §6.4. Cyclotomic polynomials 178 Contents ix Chapter 7. The algorithm 183 §7.1. How quickly does the order of n modulo r grow? 183 §7.2. The algorithm of Agrawal, Kayal, and Saxena 186 §7.3. Further comments 189 Further reading 192 Appendix A. Open questions 193 Further reading 205 Appendix B. Solutions and comments to important exercises 207 Bibliography 233 List of symbols 237 Index 239 Preface “How on earth can you do research in mathematics?”, we are of- ten asked. The idea of ongoing research in other sciences is deeply embedded in the public consciousness, not only in those fields that may lead to self-driving cars or new life-saving drugs, but also in the most theoretical areas such as particle physics, where scientists try to puzzle out the likely nature of matter on the smallest possible scales. In contrast, even among members of the public who profess their enjoyment of mathematics there is little awareness that many mathematical questions remain open and that these are the subject of intensive investigation. One of the difficulties in challenging this perception lies in the highly specialized nature of modern mathematics itself. Even profes- sional mathematicians are usually unable to fully appreciate research advances outside their own branches of mathematics. Of course there are exceptions to this rule, such as Fermat’s Last Theorem,which was proved by Andrew Wiles in the 1990s and could hardly be sim- pler to state: “If n>2, then there are no non-zero integers a, b,and c such that an + bn = cn.” Yet in this case the proof is particularly long and difficult, and only a small number of experts worldwide are able to fully comprehend it. xi xii Preface In the summer of 2002, the computer scientist Manindra Agrawal and his students Neeraj Kayal and Nitin Saxena achieved a remark- able feat: they discovered an efficient and deterministic test for the primality of a natural number. (To learn about the meaning of these notions, keep reading!) We were fascinated by this result not only be- cause it answers a long-standing open question, but because the math- ematics behind it is beautiful and, compared to other modern research advances, extremely accessible. We decided to use this opportunity to get young people in touch with actual mathematical research by offering a course on the subject at a German summer academy for secondary-school students in 2005. Inspired by the participants and their enthusiasm, we started to transform the course material into a book manuscript, the German version of which appeared in 2009. The book you hold in your hands is an English-language edition of this text. During the translation process, we have also corrected a few errors, changed some of the presentation for pedagogical reasons, and updated the content with new results, where appropriate. We thank the students from our original summer course for their motivation and dedication and all those who have since helped us for their comments and suggestions regarding both the German and English editions. We also thank you – our reader – for your interest in this little volume, and we hope that you will enjoy reading the book as much as we did writing it. Lasse Rempe-Gillen and Rebecca Waldecker August 2013 Bibliography [AB] Agrawal, M. and Biswas, S.: Primality and identity testing via Chinese remaindering. Journal of the ACM 50 (2003), no. 4, 429– 443. [AKS] Agrawal, M., Kayal, N., and Saxena, K.: PRIMES is in P. Annals of Math. 160 (2004), no. 2, 781–793. [AO]¨ A˘garg¨un, A. G¨oksel and Ozkan,¨ E. Mehmet: A historical survey of the fundamental theorem of arithmetic. Historia Math. 28 (2001), no. 3, 207–214. [Be] Beutelspacher, A.: Cryptology. Mathematical Association of America, 1994. [Bo] Bornemann, F.: Primes is in P: A breakthrough for “Everyman”. Notices of the AMS 50 (2003), no. 5, 545–552. [Br] Bryant, V.: Yet Another Introduction to Analysis, Cambridge Uni- versity Press, 1990. [Ch] Chen, J. R.: On the representation of a larger even integer as the sum of a prime and the product of at most two primes. Sci. Sinica 16 (1973), 157–176. [Co] Conrey, J. B.: The Riemann Hypothesis. Notices of the AMS 50 (2003), no. 3, 341–353. [CLR] Cormen, T. H., Leiserson, C. E., and Rivest, R. L.: Introduction to Algorithms. Third Edition, MIT Press, 2009. [CM] Coron, J.-S. and May, A.: Deterministic polynomial-time equiva- lence of computing the RSA secret key and factoring. J. Cryptology 20 (2007), 39–50. 233 234 Bibliography [CP] Crandall, R. and Pomerance, C.: Prime Numbers: A Computa- tional Perspective. Springer, 2005. [De] Derbyshire, J.: Prime Obsession: Bernhard Riemann and the Greatest Unsolved Problem in Mathematics. Penguin, 2004. [Dst] Diestel, R.: Graph Theory. Fourth edition, Springer, 2010. [Dtz] Dietzfelbinger, M.: Primality Testing in Polynomial Time: From Randomized Algorithms to “PRIMES Is in P”. Springer, 2004. [Do] Doxiadis, A.K.: Uncle Petros and Goldbach’s Conjecture: A Novel of Mathematical Obsession. Bloomsbury, 2001. [EFT] Ebbinghaus, H.-D., Flum, J., and Thomas, W.: Mathematical Logic. Second edition, Springer, 1994. [Eb] Ebbinghaus et al.: Numbers. Third printing, Springer, 1996. [Ec] Eccles, P.: An Introduction to Mathematical Reasoning: Numbers, Sets and Functions. Cambridge University Press, 1997. [Frl] Fraleigh, J. B.: A First Course in Abstract Algebra. Seventh edi- tion, Pearson, 2003. [Frz] Franz´en, T.: G¨odel’s Theorem: An Incomplete Guide to Its Use and Abuse. Peters, 2005. [F¨u] F¨urer, M.: Faster Integer Multiplication. Proceedings of the 39th Annual ACM Symposium on Theory of Computing (2007), 57–66. [G] Granville, A.: It is easy to determine whether a given integer is prime. Bull.Amer.Math.Soc.42 (2005), no.
Load more

Recommended publications
  • Lesson 19: the Euclidean Algorithm As an Application of the Long Division Algorithm
    NYS COMMON CORE MATHEMATICS CURRICULUM Lesson 19 6•2 Lesson 19: The Euclidean Algorithm as an Application of the Long Division Algorithm Student Outcomes . Students explore and discover that Euclid’s Algorithm is a more efficient means to finding the greatest common factor of larger numbers and determine that Euclid’s Algorithm is based on long division. Lesson Notes MP.7 Students look for and make use of structure, connecting long division to Euclid’s Algorithm. Students look for and express regularity in repeated calculations leading to finding the greatest common factor of a pair of numbers. These steps are contained in the Student Materials and should be reproduced, so they can be displayed throughout the lesson: Euclid’s Algorithm is used to find the greatest common factor (GCF) of two whole numbers. MP.8 1. Divide the larger of the two numbers by the smaller one. 2. If there is a remainder, divide it into the divisor. 3. Continue dividing the last divisor by the last remainder until the remainder is zero. 4. The final divisor is the GCF of the original pair of numbers. In application, the algorithm can be used to find the side length of the largest square that can be used to completely fill a rectangle so that there is no overlap or gaps. Classwork Opening (5 minutes) Lesson 18 Problem Set can be discussed before going on to this lesson. Lesson 19: The Euclidean Algorithm as an Application of the Long Division Algorithm 178 Date: 4/1/14 This work is licensed under a © 2013 Common Core, Inc.
    [Show full text]
  • Large but Finite
    Department of Mathematics MathClub@WMU Michigan Epsilon Chapter of Pi Mu Epsilon Large but Finite Drake Olejniczak Department of Mathematics, WMU What is the biggest number you can imagine? Did you think of a million? a billion? a septillion? Perhaps you remembered back to the time you heard the term googol or its show-off of an older brother googolplex. Or maybe you thought of infinity. No. Surely, `infinity' is cheating. Large, finite numbers, truly monstrous numbers, arise in several areas of mathematics as well as in astronomy and computer science. For instance, Euclid defined perfect numbers as positive integers that are equal to the sum of their proper divisors. He is also credited with the discovery of the first four perfect numbers: 6, 28, 496, 8128. It may be surprising to hear that the ninth perfect number already has 37 digits, or that the thirteenth perfect number vastly exceeds the number of particles in the observable universe. However, the sequence of perfect numbers pales in comparison to some other sequences in terms of growth rate. In this talk, we will explore examples of large numbers such as Graham's number, Rayo's number, and the limits of the universe. As well, we will encounter some fast-growing sequences and functions such as the TREE sequence, the busy beaver function, and the Ackermann function. Through this, we will uncover a structure on which to compare these concepts and, hopefully, gain a sense of what it means for a number to be truly large. 4 p.m. Friday October 12 6625 Everett Tower, WMU Main Campus All are welcome! http://www.wmich.edu/mathclub/ Questions? Contact Patrick Bennett ([email protected]) .
    [Show full text]
  • 81684-1B SP.Pdf
    INTERMEDIATE ALGEBRA The Why and the How First Edition Mathew Baxter Florida Gulf Coast University Bassim Hamadeh, CEO and Publisher Jess Estrella, Senior Graphic Designer Jennifer McCarthy, Acquisitions Editor Gem Rabanera, Project Editor Abbey Hastings, Associate Production Editor Chris Snipes, Interior Designer Natalie Piccotti, Senior Marketing Manager Kassie Graves, Director of Acquisitions Jamie Giganti, Senior Managing Editor Copyright © 2018 by Cognella, Inc. All rights reserved. No part of this publication may be reprinted, reproduced, transmitted, or utilized in any form or by any electronic, mechanical, or other means, now known or hereafter invented, including photocopying, microfilming, and recording, or in any information retrieval system without the written permission of Cognella, Inc. For inquiries regarding permissions, translations, foreign rights, audio rights, and any other forms of reproduction, please contact the Cognella Licensing Department at [email protected]. Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are used only for identification and explanation without intent to infringe. Cover image copyright © Depositphotos/agsandrew. Printed in the United States of America ISBN: 978-1-5165-0303-2 (pbk) / 978-1-5165-0304-9 (br) iii |  CONTENTS 1 The Real Number System 1 RealNumbersandTheirProperties 2:1.1 RealNumbers 2 PropertiesofRealNumbers 6 Section1.1Exercises 9 TheFourBasicOperations 11:1.2 AdditionandSubtraction 11 MultiplicationandDivision
    [Show full text]
  • The Unique Natural Number Set and Distributed Prime Numbers
    mp Co uta & tio d n e a li Jabur and Kushnaw, J Appl Computat Math 2017, 6:4 l p M p a Journal of A t h DOI: 10.4172/2168-9679.1000368 f e o m l a a n t r ISSN: 2168-9679i c u s o J Applied & Computational Mathematics Research Article Open Access The Unique Natural Number Set and Distributed Prime Numbers Alabed TH1* and Bashir MB2 1Computer Science, Shendi University, Shendi, Sudan 2Shendi University, Shendi, Sudan Abstract The Natural number set has a new number set behind three main subset: odd, even and prime which are unique number set. It comes from a mathematical relationship between the two main types even and odd number set. It consists of prime and T-semi-prime numbers set. However, finding ways to understand how prime number was distributed was ambiguity and it is impossible, this new natural set show how the prime number was distributed and highlight focusing on T-semi-prime number as a new sub natural set. Keywords: Prime number; T-semi-prime number; Unique number purely mathematical sciences and it has been used prime number set within theoretical physics to try and produce a theory that ties together prime numbers with quantum chaos theory [3]. However, researchers Introduction were made a big effort to find algorithm which can describe how prime The Unique natural number set is sub natural number set which number are distributed, still distribution of prime numbers throughout consist of prime and T-semi-prime numbers. T-semi-prime is natural a list of integers leads to the emergence of many unanswered and number divided by one or more prime numbers.
    [Show full text]
  • Primality Testing and Integer Factorisation
    Primality Testing and Integer Factorisation Richard P. Brent, FAA Computer Sciences Laboratory Australian National University Canberra, ACT 2601 Abstract The problem of finding the prime factors of large composite numbers has always been of mathematical interest. With the advent of public key cryptosystems it is also of practical importance, because the security of some of these cryptosystems, such as the Rivest-Shamir-Adelman (RSA) system, depends on the difficulty of factoring the public keys. In recent years the best known integer factorisation algorithms have improved greatly, to the point where it is now easy to factor a 60-decimal digit number, and possible to factor numbers larger than 120 decimal digits, given the availability of enough computing power. We describe several recent algorithms for primality testing and factorisation, give examples of their use and outline some applications. 1. Introduction It has been known since Euclid’s time (though first clearly stated and proved by Gauss in 1801) that any natural number N has a unique prime power decomposition α1 α2 αk N = p1 p2 ··· pk (1.1) αj (p1 < p2 < ··· < pk rational primes, αj > 0). The prime powers pj are called αj components of N, and we write pj kN. To compute the prime power decomposition we need – 1. An algorithm to test if an integer N is prime. 2. An algorithm to find a nontrivial factor f of a composite integer N. Given these there is a simple recursive algorithm to compute (1.1): if N is prime then stop, otherwise 1. find a nontrivial factor f of N; 2.
    [Show full text]
  • The Resultant of the Cyclotomic Polynomials Fm(Ax) and Fn{Bx)
    MATHEMATICS OF COMPUTATION, VOLUME 29, NUMBER 129 JANUARY 1975, PAGES 1-6 The Resultant of the Cyclotomic Polynomials Fm(ax) and Fn{bx) By Tom M. Apóstol Abstract. The resultant p(Fm(ax), Fn(bx)) is calculated for arbitrary positive integers m and n, and arbitrary nonzero complex numbers a and b. An addendum gives an extended bibliography of work on cyclotomic polynomials published since 1919. 1. Introduction. Let Fn(x) denote the cyclotomic polynomial of degree sp{ri) given by Fn{x)= f['{x - e2"ikl"), k=\ where the ' indicates that k runs through integers relatively prime to the upper index n, and <p{n) is Euler's totient. The resultant p{Fm, Fn) of any two cyclotomic poly- nomials was first calculated by Emma Lehmer [9] in 1930 and later by Diederichsen [21] and the author [64]. It is known that piFm, Fn) = 1 if (m, ri) = 1, m > n>l. This implies that for any integer q the integers Fmiq) and Fn{q) are rela- tively prime if im, ri) = 1. Divisibility properties of cyclotomic polynomials play a role in certain areas of the theory of numbers, such as the distribution of quadratic residues, difference sets, per- fect numbers, Mersenne-type numbers, and primes in residue classes. There has also been considerable interest lately in relations between the integers FJq) and F Jp), where p and q are distinct primes. In particular, Marshall Hall informs me that the Feit-Thompson proof [47] could be shortened by nearly 50 pages if it were known that F Jq) and F Jp) are relatively prime, or even if the smaller of these integers does not divide the larger.
    [Show full text]
  • An Analysis of Primality Testing and Its Use in Cryptographic Applications
    An Analysis of Primality Testing and Its Use in Cryptographic Applications Jake Massimo Thesis submitted to the University of London for the degree of Doctor of Philosophy Information Security Group Department of Information Security Royal Holloway, University of London 2020 Declaration These doctoral studies were conducted under the supervision of Prof. Kenneth G. Paterson. The work presented in this thesis is the result of original research carried out by myself, in collaboration with others, whilst enrolled in the Department of Mathe- matics as a candidate for the degree of Doctor of Philosophy. This work has not been submitted for any other degree or award in any other university or educational establishment. Jake Massimo April, 2020 2 Abstract Due to their fundamental utility within cryptography, prime numbers must be easy to both recognise and generate. For this, we depend upon primality testing. Both used as a tool to validate prime parameters, or as part of the algorithm used to generate random prime numbers, primality tests are found near universally within a cryptographer's tool-kit. In this thesis, we study in depth primality tests and their use in cryptographic applications. We first provide a systematic analysis of the implementation landscape of primality testing within cryptographic libraries and mathematical software. We then demon- strate how these tests perform under adversarial conditions, where the numbers being tested are not generated randomly, but instead by a possibly malicious party. We show that many of the libraries studied provide primality tests that are not pre- pared for testing on adversarial input, and therefore can declare composite numbers as being prime with a high probability.
    [Show full text]
  • 08 Cyclotomic Polynomials
    8. Cyclotomic polynomials 8.1 Multiple factors in polynomials 8.2 Cyclotomic polynomials 8.3 Examples 8.4 Finite subgroups of fields 8.5 Infinitude of primes p = 1 mod n 8.6 Worked examples 1. Multiple factors in polynomials There is a simple device to detect repeated occurrence of a factor in a polynomial with coefficients in a field. Let k be a field. For a polynomial n f(x) = cnx + ::: + c1x + c0 [1] with coefficients ci in k, define the (algebraic) derivative Df(x) of f(x) by n−1 n−2 2 Df(x) = ncnx + (n − 1)cn−1x + ::: + 3c3x + 2c2x + c1 Better said, D is by definition a k-linear map D : k[x] −! k[x] defined on the k-basis fxng by D(xn) = nxn−1 [1.0.1] Lemma: For f; g in k[x], D(fg) = Df · g + f · Dg [1] Just as in the calculus of polynomials and rational functions one is able to evaluate all limits algebraically, one can readily prove (without reference to any limit-taking processes) that the notion of derivative given by this formula has the usual properties. 115 116 Cyclotomic polynomials [1.0.2] Remark: Any k-linear map T of a k-algebra R to itself, with the property that T (rs) = T (r) · s + r · T (s) is a k-linear derivation on R. Proof: Granting the k-linearity of T , to prove the derivation property of D is suffices to consider basis elements xm, xn of k[x]. On one hand, D(xm · xn) = Dxm+n = (m + n)xm+n−1 On the other hand, Df · g + f · Dg = mxm−1 · xn + xm · nxn−1 = (m + n)xm+n−1 yielding the product rule for monomials.
    [Show full text]
  • 20. Cyclotomic III
    20. Cyclotomic III 20.1 Prime-power cyclotomic polynomials over Q 20.2 Irreducibility of cyclotomic polynomials over Q 20.3 Factoring Φn(x) in Fp[x] with pjn 20.4 Worked examples The main goal is to prove that all cyclotomic polynomials Φn(x) are irreducible in Q[x], and to see what happens to Φn(x) over Fp when pjn. The irreducibility over Q allows us to conclude that the automorphism group of Q(ζn) over Q (with ζn a primitive nth root of unity) is × Aut(Q(ζn)=Q) ≈ (Z=n) by the map a (ζn −! ζn) − a The case of prime-power cyclotomic polynomials in Q[x] needs only Eisenstein's criterion, but the case of general n seems to admit no comparably simple argument. The proof given here uses ideas already in hand, but also an unexpected trick. We will give a different, less elementary, but possibly more natural argument later using p-adic numbers and Dirichlet's theorem on primes in an arithmetic progression. 1. Prime-power cyclotomic polynomials over Q The proof of the following is just a slight generalization of the prime-order case. [1.0.1] Proposition: For p prime and for 1 ≤ e 2 Z the prime-power pe-th cyclotomic polynomial Φpe (x) is irreducible in Q[x]. Proof: Not unexpectedly, we use Eisenstein's criterion to prove that Φpe (x) is irreducible in Z[x], and the invoke Gauss' lemma to be sure that it is irreducible in Q[x]. Specifically, let f(x) = Φpe (x + 1) 269 270 Cyclotomic III p If e = 1, we are in the familiar prime-order case.
    [Show full text]
  • Radix-8 Design Alternatives of Fast Two Operands Interleaved
    International Journal of Advanced Network, Monitoring and Controls Volume 04, No.02, 2019 Radix-8 Design Alternatives of Fast Two Operands Interleaved Multiplication with Enhanced Architecture With FPGA implementation & synthesize of 64-bit Wallace Tree CSA based Radix-8 Booth Multiplier Mohammad M. Asad Qasem Abu Al-Haija King Faisal University, Department of Electrical Department of Computer Information and Systems Engineering, Ahsa 31982, Saudi Arabia Engineering e-mail: [email protected] Tennessee State University, Nashville, USA e-mail: [email protected] Ibrahim Marouf King Faisal University, Department of Electrical Engineering, Ahsa 31982, Saudi Arabia e-mail: [email protected] Abstract—In this paper, we proposed different comparable researches to propose different solutions to ensure the reconfigurable hardware implementations for the radix-8 fast safe access and store of private and sensitive data by two operands multiplier coprocessor using Karatsuba method employing different cryptographic algorithms and Booth recording method by employing carry save (CSA) and kogge stone adders (KSA) on Wallace tree organization. especially the public key algorithms [1] which proved The proposed designs utilized robust security resistance against most of the attacks family with target chip device along and security halls. Public key cryptography is with simulation package. Also, the proposed significantly based on the use of number theory and designs were synthesized and benchmarked in terms of the digital arithmetic algorithms. maximum operational frequency, the total path delay, the total design area and the total thermal power dissipation. The Indeed, wide range of public key cryptographic experimental results revealed that the best multiplication systems were developed and embedded using hardware architecture was belonging to Wallace Tree CSA based Radix- modules due to its better performance and security.
    [Show full text]
  • The Division Algorithm We All Learned Division with Remainder At
    The Division Algorithm We all learned division with remainder at elementary school. Like 14 divided by 3 has reainder 2:14 3 4 2. In general we have the following Division Algorithm. Let n be any integer and d 0 be a positive integer. Then you can divide n by d with remainder. That is n q d r,0 ≤ r d where q and r are uniquely determined. Given n we determine how often d goes evenly into n. Say, if n 16 and d 3 then 3 goes 5 times into 16 but there is a remainder 1 : 16 5 3 1. This works for non-negative numbers. If n −16 then in order to get a positive remainder, we have to go beyond −16 : −16 −63 2. Let a and b be integers. Then we say that b divides a if there is an integer c such that a b c. We write b|a for b divides a Examples: n|0 for every n :0 n 0; in particular 0|0. 1|n for every n : n 1 n Theorem. Let a,b,c be any integers. (a) If a|b, and a|cthena|b c (b) If a|b then a|b c for any c. (c) If a|b and b|c then a|c. (d) If a|b and a|c then a|m b n c for any integers m and n. Proof. For (a) we note that b a s and c a t therefore b c a s a t a s t.Thus a b c.
    [Show full text]
  • Parameter Free Induction and Provably Total Computable Functions
    Parameter free induction and provably total computable functions Lev D. Beklemishev∗ Steklov Mathematical Institute Gubkina 8, 117966 Moscow, Russia e-mail: [email protected] November 20, 1997 Abstract We give a precise characterization of parameter free Σn and Πn in- − − duction schemata, IΣn and IΠn , in terms of reflection principles. This I − I − allows us to show that Πn+1 is conservative over Σn w.r.t. boolean com- binations of Σn+1 sentences, for n ≥ 1. In particular, we give a positive I − answer to a question, whether the provably recursive functions of Π2 are exactly the primitive recursive ones. We also characterize the provably − recursive functions of theories of the form IΣn + IΠn+1 in terms of the fast growing hierarchy. For n = 1 the corresponding class coincides with the doubly-recursive functions of Peter. We also obtain sharp results on the strength of bounded number of instances of parameter free induction in terms of iterated reflection. Keywords: parameter free induction, provably recursive functions, re- flection principles, fast growing hierarchy Mathematics Subject Classification: 03F30, 03D20 1 Introduction In this paper we shall deal with the first order theories containing Kalmar ele- mentary arithmetic EA or, equivalently, I∆0 + Exp (cf. [11]). We are interested in the general question how various ways of formal reasoning correspond to models of computation. This kind of analysis is traditionally based on the con- cept of provably total recursive function (p.t.r.f.) of a theory. Given a theory T containing EA, a function f(~x) is called provably total recursive in T , iff there is a Σ1 formula φ(~x, y), sometimes called specification, that defines the graph of f in the standard model of arithmetic and such that T ⊢ ∀~x∃!y φ(~x, y).
    [Show full text]