IDEAS home Printed from https://ideas.repec.org/a/spr/eurphb/v79y2011i1p85-90.html
   My bibliography  Save this article

Computation using noise-based logic: efficient string verification over a slow communication channel

Author

Listed:
  • L. B. Kish
  • S. Khatri
  • T. Horvath

Abstract

Utilizing the hyperspace of noise-based logic, we show two string verification methods with low communication complexity. One of them is based on continuum noise-based logic. The other one utilizes noise-based logic with random telegraph signals where a mathematical analysis of the error probability is also given. The last operation can also be interpreted as computing universal hash functions with noise-based logic and using them for string comparison. To find out with 10 -25 error probability that two strings with arbitrary length are different (this value is similar to the error probability of an idealistic gate in today's computer) Alice and Bob need to compare only 83 bits of the noise-based hyperspace. Copyright EDP Sciences, SIF, Springer-Verlag Berlin Heidelberg 2011

Suggested Citation

  • L. B. Kish & S. Khatri & T. Horvath, 2011. "Computation using noise-based logic: efficient string verification over a slow communication channel," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 79(1), pages 85-90, January.
    • Handle: RePEc:spr:eurphb:v:79:y:2011:i:1:p:85-90
    DOI: 10.1140/epjb/e2010-10399-x
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1140/epjb/e2010-10399-x
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1140/epjb/e2010-10399-x?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    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:eurphb:v:79:y:2011:i:1:p:85-90. 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.