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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
L.B. Kish, Phys. Lett. A 373, 911 (2009), http://arxiv.org/abs/0808.3162
L.B. Kish, S. Khatri, S. Sethuraman, Phys. Lett. A 373, 1928 (2009), http://arxiv.org/abs/0901.3947
S.M. Bezrukov, L.B. Kish, Phys. Lett. A 37, 2338 (2009), http://arxiv.org/abs/0902.2033
Z. Gingl, S. Khatri, L.B. Kish, submitted for publication (2010), http://arxiv.org/abs/1003.3932
L.B. Kish, S. Khatri, F. Peper, submitted for publication (2010), http://arxiv.org/abs/1004.2652
N. Jayakumar, S.P. Khatri, in Proc. 42th Design Automation Conference, Anaheim, Califomia, USA, June 13-17, 2005, http://www.dac.com/events/Archivesearch.aspx
L.B. Kish, Phys. Lett. A 305, 144 (2002)
L.B. Kish, IEE Proc. – Circ. Dev. Syst. 151, 190 (2004)
J. Gea-Banacloche, L.B. Kish, Proc. IEEE 93, 1858 (2005)
N. Jayakumar, S. Paul, R. Garg, K. Gulati, S.P. Khatri, Minimizing and Exploiting Leakage in VLSI Design (Springer, US, 2010)
J. Kim, L.B. Kish, Phys. Lett. A 323, 16 (2004)
K. Bollapalli, S. Khatri, L.B. Kish, in Design Automation and Test in Europe Conference (Dresden, Germany, 2010)
J. von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components, The Collected Works of John von Neumann (Macmillan, 1963)
J. Lee, F. Peper, in Proc. of the 4th International Workshop on Natural Computing (Springer Himeji, Japan, 2009, 2010), DOI: 10.1007/978-4-431-53868-4
C.H. Bennett, Int. J. Theor. Phys. 21, 905 (1982)
S. Dasmahapatra, J. Werner, K.-P. Zauner, Int. J. Unconventional Computing 2, 305 (2006)
R. Motwani, P. Raghavan, Randomized Algorithms (Cambridge University Press, New York, NY, 1995)
P. Korkmaz, B.E.S. Akgul, K.V. Palem, L.N. Chakrapani, Jpn J. Appl. Phys. 45, 3307 (2006)
E. Kushilevitz, N. Nisan, Communication complexity (Cambridge University Press, 1997)
A.C. Yao, in Proc. of 11th ACM Symposium on the Theory of Computing (STOC) (ACM Press, 1979), pp. 209–213
J.L. Carter, M.N. Wegman, J. Comp. Sys. Sci. 18, 143 (1977)
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Kish, L., Khatri, S. & Horvath, T. Computation using noise-based logic: efficient string verification over a slow communication channel. Eur. Phys. J. B 79, 85–90 (2011). https://doi.org/10.1140/epjb/e2010-10399-x
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1140/epjb/e2010-10399-x