Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel

Details Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel

2010-05-10

arxiv.org/abs/1005.1560v3

Eur. Phys. J. B 79, 85-90 (2011)

Computer Science

Information Theory

Accepted for publication in European Journal of Physics B (November 10, 2010)

Scientific paper

10.1140/epjb/e2010-10399-x

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.

Affiliated with

Also associated with

No associations

Rating

Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-628190