IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-540-74238-8_18.html
   My bibliography  Save this book chapter

Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test

In: From Nano to Space

Author

Listed:
  • P. Lory

    (Universität Regensburg, Institut für Wirtschaftsinformatik)

Abstract

In the light of information security it is highly desirable to avoid a “single point of failure” because this would be an attractive target for attackers. Cryptographic protocols for distributed computations are important techniques in pursuing this goal. An essential module in this context is the secure multiparty multiplication of two polynomially shared values over ℤq with a public prime number q. The multiplication protocol of Gennaro, Rabin and Rabin (1998) is considered as the best protocol for this purpose. It requires a complexity of O(n 2 k log n+nk 2) bit operations per player, where k is the bit size of the prime q and n is the number of players. The present paper reduces this complexity to O(n 2 k +nk 2) with unaltered communication and round complexities. This improvement is possible by a loan from the field of numerical analysis, namely by the use of Newton’s classical interpolation formula. The distributed version of the famous probabilistic primality test of Miller and Rabin is built of several modules, which depend on distributed multiplications. Applications of the new method to these modules is studied and its importance for distributed signatures is outlined.

Suggested Citation

  • P. Lory, 2008. "Accelerating the Distributed Multiplication Protocol with Applications to the Distributed Miller-Rabin Primality Test," Springer Books, in: Michael H. Breitner & Georg Denk & Peter Rentrop (ed.), From Nano to Space, pages 245-257, Springer.
    • Handle: RePEc:spr:sprchp:978-3-540-74238-8_18
    DOI: 10.1007/978-3-540-74238-8_18
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-3-540-74238-8_18. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.