Recursive Random Number Generator Using Prime Reciprocals
A recursive random number generator using prime reciprocals is described.
cs.CR↗
arXiv subjects
Subhash Kak
Publications and source records attributed to Subhash Kak.
The Transactional Nature of Quantum Information
Information, in its communications sense, is a transactional property. If the received signals communicate choices made by the sender of the signals, then information has been transmitter by the sender to the receiver. Given this reality, the potential information in an unknown pure quantum state should be non-zero. We examine transactional quantum information, which unlike von Neumann entropy, depends on the mutuality of the relationship between the sender and the receiver, associating information with an unknown pure state. The information that can be obtained from a pure state in repeated experiments is potentially infinite.
quant-ph↗
Single Neuron Memories and the Network's Proximity Matrix
This paper extends the treatment of single-neuron memories obtained by the B-matrix approach. The spreading of the activity within the network is determined by the network's proximity matrix which represents the separations amongst the neurons through the neural pathways.
cs.NE↗
Memory Retrieved from Single Neurons
The paper examines the problem of accessing a vector memory from a single neuron in a Hebbian neural network. It begins with the review of the author's earlier method, which is different from the Hopfield model in that it recruits neighboring neurons by spreading activity, making it possible for single or group of neurons to become associated with vector memories. Some open issues associated with this approach are identified. It is suggested that fragments that generate stored memories could be associated with single neurons through local spreading activity.
cs.NE↗
Cryptography for Multi-Located Parties
This note describes some cryptographic issues related to multi-located parties. In general, multi-located parties make it difficult for the eavesdropper to mount the man-in-the-middle attack. Conversely, they make it easier to address problems such as joint encryption and error correction coding. It is easier to implement the three-stage quantum cryptography protocol.
cs.CR↗
Time, Space and Structure in Ancient India
Textual and archaeological sources are used to provide a synoptic vision of the universe in India. This vision was based on an assumed equivalence of the outer and the inner cosmoses and it is embodied in architecture, music, and art. It provides an archaeoastronomical window on Indian monumental architecture.
physics.hist-ph↗
Early Record of Divisibility and Primality
We provide textual evidence on divisibility and primality in the ancient Vedic texts of India. Concern with divisibility becomes clear from the listing of all the fifteen pairs of divisors of the number 720. The total number of pairs of divisors of 10,800 is also given. The motivation behind finding the divisors was the theory that the number of divisors of a certain periodic process is related to the count associated with some other periodic process. For example, 720 (days and nights of the year) has 15 pairs of divisors, and this was related to the 15 days of the waxing and waning of the moon. Numbers that have no divisors appeared to have been used to symbolize the "transcendent" that is beyond periodicity and change.
math.HO↗
Prime Reciprocal Digit Frequencies and the Euler Zeta Function
Some open questions related to prime reciprocal digit frequencies with potential applications to cryptography are presented.
math.GM↗
The Axis and the Perimeter of the Temple
This paper presents textual evidence for an astronomical basis of the dimensions of the axis and perimeter in the plan of the Indian temple.
physics.gen-ph↗
Prospects for Quantum Computing
This note reviews prospects for quantum computing. It argues that gates need to be tested for a wide range of probability amplitudes.
physics.gen-ph↗
Space Efficient Secret Sharing
This note proposes a method of space efficient secret sharing in which k secrets are mapped into n shares (n>=k) of the same size. Since, n can be chosen to be equal to k, the method is space efficient. This method may be compared with conventional secret sharing schemes that divide a single secret into n shares.
cs.CR↗
A Recursive Threshold Visual Cryptography Scheme
This paper presents a recursive hiding scheme for 2 out of 3 secret sharing. In recursive hiding of secrets, the user encodes additional information about smaller secrets in the shares of a larger secret without an expansion in the size of the latter, thereby increasing the efficiency of secret sharing. We present applications of our proposed protocol to images as well as text.
cs.CR↗
Space Efficient Secret Sharing: A Recursive Approach
This paper presents a recursive secret sharing technique that distributes k-1 secrets of length b each into n shares such that each share is effectively of length (n/(k-1))*b and any k pieces suffice for reconstructing all the k-1 secrets. Since n/(k-1) is near the optimal factor of n/k, and can be chosen to be close to 1, the proposed technique is space efficient. Furthermore, each share is information theoretically secure, i.e. it does not depend on any unproven assumption of computational intractability. Such a recursive technique has potential applications in secure and reliable storage of information on the Web and in sensor networks.
cs.CR↗
Hybrid Neural Network Architecture for On-Line Learning
Approaches to machine intelligence based on brain models have stressed the use of neural networks for generalization. Here we propose the use of a hybrid neural network architecture that uses two kind of neural networks simultaneously: (i) a surface learning agent that quickly adapt to new modes of operation; and, (ii) a deep learning agent that is very accurate within a specific regime of operation. The two networks of the hybrid architecture perform complementary functions that improve the overall performance. The performance of the hybrid architecture has been compared with that of back-propagation perceptrons and the CC and FC networks for chaotic time-series prediction, the CATS benchmark test, and smooth function approximation. It has been shown that the hybrid architecture provides a superior performance based on the RMS error criterion.
cs.NE↗
Stream Computing
Stream computing is the use of multiple autonomic and parallel modules together with integrative processors at a higher level of abstraction to embody "intelligent" processing. The biological basis of this computing is sketched and the matter of learning is examined.
cs.AI↗
The Cubic Public-Key Transformation
We propose the use of the cubic transformation for public-key applications and digital signatures. Transformations modulo a prime p or a composite n=pq, where p and q are primes, are used in such a fashion that each transformed value has only 3 roots that makes it a more efficient transformation than the squaring transformation of Rabin, which has 4 roots. Such a transformation, together with additional tag information, makes it possible to uniquely invert each transformed value. The method may be used for other exponents as well.
cs.CR↗
Moving Observers in an Isotropic Universe
We show how the anisotropy resulting from the motion of an observer in an isotropic universe may be determined by measurements. This provides a means to identify inertial frames, yielding a simple resolution to the twins paradox of relativity theory. We propose that isotropy is a requirement for a frame to be inertial; this makes it possible to relate motion to the large scale structure of the universe.
physics.gen-ph↗
Quantum Information and Entropy
Thermodynamic entropy is not an entirely satisfactory measure of information of a quantum state. This entropy for an unknown pure state is zero, although repeated measurements on copies of such a pure state do communicate information. In view of this, we propose a new measure for the informational entropy of a quantum state that includes information in the pure states and the thermodynamic entropy. The origin of information is explained in terms of an interplay between unitary and non-unitary evolution. Such complementarity is also at the basis of the so-called interaction-free measurement.
quant-ph↗