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

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.Comment: Accepted for publication in European Journal of Physics B (November 10, 2010

Resource requirements and speed versus geometry of unconditionally secure physical key exchanges

The imperative need for unconditional secure key exchange is expounded by the increasing connectivity of networks and by the increasing number and level of sophistication of cyberattacks. Two concepts that are information theoretically secure are quantum key distribution (QKD) and Kirchoff-law-Johnson-noise (KLJN). However, these concepts require a dedicated connection between hosts in peer-to-peer (P2P) networks which can be impractical and or cost prohibitive. A practical and cost effective method is to have each host share their respective cable(s) with other hosts such that two remote hosts can realize a secure key exchange without the need of an additional cable or key exchanger. In this article we analyze the cost complexities of cable, key exchangers, and time required in the star network. We mentioned the reliability of the star network and compare it with other network geometries. We also conceived a protocol and equation for the number of secure bit exchange periods needed in a star network. We then outline other network geometries and trade-off possibilities that seem interesting to explore.Comment: 13 pages, 7 figures, MDPI Entrop

Vibration-Induced Conductivity Fluctuation (VICOF) Testing of Soils

In this Letter, we propose and experimentally demonstrate a simple method to provide additional in-formation by conductivity measurements of soils. The AC electrical conductance of the soil is measured while it is exposed to a periodic vibration. The vibration-induced density fluctuation implies a corresponding conductivity fluctuation that can be seen as combination frequency components, the sum and the difference of the mean AC frequency and the double of vibration frequency, in the current response. The method is demonstrated by measurements on clayey and sandy soils

Information theoretic security by the laws of classical physics

It has been shown recently that the use of two pairs of resistors with enhanced Johnson-noise and a Kirchhoff-loop-i.e., a Kirchhoff-Law-Johnson-Noise (KLJN) protocol-for secure key distribution leads to information theoretic security levels superior to those of a quantum key distribution, including a natural immunity against a man-in-the-middle attack. This issue is becoming particularly timely because of the recent full cracks of practical quantum communicators, as shown in numerous peer-reviewed publications. This presentation first briefly surveys the KLJN system and then discusses related, essential questions such as: what are perfect and imperfect security characteristics of key distribution, and how can these two types of securities be unconditional (or information theoretical)? Finally the presentation contains a live demonstration.Comment: Featured in MIT Technology Review http://www.technologyreview.com/view/428202/quantum-cryptography-outperformed-by-classical/ ; Plenary talk at the 5th IEEE Workshop on Soft Computing Applications, August 22-24, 2012, (SOFA 2012). Typos correcte

Critical analysis of the Bennett-Riedel attack on secure cryptographic key distributions via the Kirchhoff-law-Johnson-noise scheme

Recently, Bennett and Riedel (BR) (http://arxiv.org/abs/1303.7435v1) argued that thermodynamics is not essential in the Kirchhoff-law–Johnson-noise (KLJN) classical physical cryptographic exchange method in an effort to disprove the security of the KLJN scheme. They attempted to demonstrate this by introducing a dissipation-free deterministic key exchange method with two batteries and two switches. In the present paper, we first show that BR's scheme is unphysical and that some elements of its assumptions violate basic protocols of secure communication. All our analyses are based on a technically unlimited Eve with infinitely accurate and fast measurements limited only by the laws of physics and statistics. For non-ideal situations and at active (invasive) attacks, the uncertainly principle between measurement duration and statistical errors makes it impossible for Eve to extract the key regardless of the accuracy or speed of her measurements. To show that thermodynamics and noise are essential for the security, we crack the BR system with 100% success via passive attacks, in ten different ways, and demonstrate that the same cracking methods do not function for the KLJN scheme that employs Johnson noise to provide security underpinned by the Second Law of Thermodynamics. We also present a critical analysis of some other claims by BR; for example, we prove that their equations for describing zero security do not apply to the KLJN scheme. Finally we give mathematical security proofs for each BR-attack against the KLJN scheme and conclude that the information theoretic (unconditional) security of the KLJN method has not been successfully challenged.Laszlo B. Kish, Derek Abbott, Claes G. Granqvis

Energy Requirement of Control: Comments on Szilard's Engine and Maxwell's Demon

In mathematical physical analyses of Szilard's engine and Maxwell's demon, a general assumption (explicit or implicit) is that one can neglect the energy needed for relocating the piston in Szilard's engine and for driving the trap door in Maxwell's demon. If this basic assumption is wrong, then the conclusions of a vast literature on the implications of the Second Law of Thermodynamics and of Landauer's erasure theorem are incorrect too. Our analyses of the fundamental information physical aspects of various type of control within Szilard's engine and Maxwell's demon indicate that the entropy production due to the necessary generation of information yield much greater energy dissipation than the energy Szilard's engine is able to produce even if all sources of dissipation in the rest of these demons (due to measurement, decision, memory, etc) are neglected.Comment: New, simpler and more fundamental approach utilizing the physical meaning of control-information and the related entropy production. Criticism of recent experiments adde

Why We Read Wikipedia

Wikipedia is one of the most popular sites on the Web, with millions of users relying on it to satisfy a broad range of information needs every day. Although it is crucial to understand what exactly these needs are in order to be able to meet them, little is currently known about why users visit Wikipedia. The goal of this paper is to fill this gap by combining a survey of Wikipedia readers with a log-based analysis of user activity. Based on an initial series of user surveys, we build a taxonomy of Wikipedia use cases along several dimensions, capturing users' motivations to visit Wikipedia, the depth of knowledge they are seeking, and their knowledge of the topic of interest prior to visiting Wikipedia. Then, we quantify the prevalence of these use cases via a large-scale user survey conducted on live Wikipedia with almost 30,000 responses. Our analyses highlight the variety of factors driving users to Wikipedia, such as current events, media coverage of a topic, personal curiosity, work or school assignments, or boredom. Finally, we match survey responses to the respondents' digital traces in Wikipedia's server logs, enabling the discovery of behavioral patterns associated with specific use cases. For instance, we observe long and fast-paced page sequences across topics for users who are bored or exploring randomly, whereas those using Wikipedia for work or school spend more time on individual articles focused on topics such as science. Our findings advance our understanding of reader motivations and behavior on Wikipedia and can have implications for developers aiming to improve Wikipedia's user experience, editors striving to cater to their readers' needs, third-party services (such as search engines) providing access to Wikipedia content, and researchers aiming to build tools such as recommendation engines.Comment: Published in WWW'17; v2 fixes caption of Table

Characteristics and Motivational Factors of Effective Extension Advisory Leaders: Implications for Building Strong Extension Advisory Councils

The purpose of this study was to determine the characteristics and motivational factors of effective Extension advisory leaders. This Delphi study was conducted with a selected group of County Extension Directors and a group of Extension State Advisory Leaders. The study identified 10 characteristics that distinguish an effective Extension advisory leader. Some of these characteristics are explicit and easy to observe, while others are implicit and difficult to directly observe. Therefore, it is practical to use directly observable characteristics of effective advisory leaders when selecting volunteers. Once potential volunteers are spotted in the community, implicit characteristics of effective advisory leaders should be used to further screen them before they are selected. The study also identified the eight most important factors motivating individuals to volunteer as effective advisory leaders. Understanding these motivational factors is helpful for creating an environment for attracting and retaining effective volunteers. Understanding their motivation for volunteer work and creating an environment for them to meet the motivating factors for volunteering will lead to volunteer satisfaction and retention. The findings of this study can be used to build strong Extension advisory councils