Searcharxiv⌕ Search

arXiv subjects

Subhash Kak

Publications and source records attributed to Subhash Kak.

At least 73 records · Page 4Linked to original sources
arXiv2012

Goldbach Triples and Key Distribution

This paper investigates the use of the number of Goldbach triples, or the number of three prime partitions of an odd number, for use in the generation and distribution of cryptographic keys. In addition to presenting randomness properties of these triples, which turn out to be similar to that of prime partitions of even numbers, we explore the question of restricted partition sets. We propose a protocol for key distribution that is based on these numbers. Two of the three partitions of the randomly chosen number serve as cover to send the third number to the two parties that wish to communicate with each other. This third number can serve as session key and the original number of which it is a partition can be used for audit purposes.

cs.CR↗
arXiv2012

Implementation of Secure Quantum Protocol using Multiple Photons for Communication

The paper presents the implementation of a quantum cryptography protocol for secure communication between servers in the cloud. As computing power increases, classical cryptography and key management schemes based on computational complexity become increasingly susceptible to brute force and cryptanalytic attacks. Current implementations of quantum cryptography are based on the BB84 protocol, which is susceptible to siphoning attacks on the multiple photons emitted by practical laser sources. The three-stage protocol, whose implementation is described in this paper, is a departure from conventional practice and it obviates some of the known vulnerabilities of the current implementations of quantum cryptography. This paper presents an implementation of the three-stage quantum communication protocol in free-space. To the best of the authors' knowledge, this is the first implementation of a quantum protocol where multiple photons can be used for secure communication.

cs.CR↗
arXiv2012

Goldbach Ellipse Sequences for Cryptographic Applications

The paper studies cryptographically useful properties of the sequence of the sizes of Goldbach ellipses. We show that binary subsequences based on this sequence have useful properties. They can be used to generate keys and to provide an index-based mapping to numbers. The paper also presents a protocol for secure session keys that is based on Goldbach partitions.

cs.CR↗
arXiv2012

On Randomness of Goldbach Sequences

We consider the use of Goldbach numbers as random sequences. The randomness is analyzed in terms of the autocorrelation function of the sequence of number of partitions. The distinct representations of an even number n as the sum of two primes is a local maximum for multiples of the product of the consecutive smallest primes less than the number. Specific partitions, which we call Goldbach ellipses, are examined. It is shown that such ellipse sequences also have excellent randomness property.

cs.CR↗
arXiv2012

Observability and Computability in Physical Systems

This paper considers the relevance of the concepts of observability and computability in physical theory. Observability is related to verifiability which is essential for effective computing and as physical systems are computational systems it is important even where explicit computation is not the goal. Specifically, we examine two problems: observability and computability for quantum computing, and remote measurement of time and frequency.

physics.gen-ph↗
arXiv2012

A Survey of Prediction Using Social Media

Social media comprises interactive applications and platforms for creating, sharing and exchange of user-generated contents. The past ten years have brought huge growth in social media, especially online social networking services, and it is changing our ways to organize and communicate. It aggregates opinions and feelings of diverse groups of people at low cost. Mining the attributes and contents of social media gives us an opportunity to discover social structure characteristics, analyze action patterns qualitatively and quantitatively, and sometimes the ability to predict future human related events. In this paper, we firstly discuss the realms which can be predicted with current social media, then overview available predictors and techniques of prediction, and finally discuss challenges and possible future directions.

cs.SI↗
arXiv2012

Inertial Frames and Clock Rates

This article revisits the historiography of the problem of inertial frames. Specifically, the case of the twins in the clock paradox is considered to see that some resolutions implicitly assume inertiality for the non-accelerating twin. If inertial frames are explicitly identified by motion with respect to the large scale structure of the universe, it makes it possible to consider the relative inertiality of different frames.

physics.gen-ph↗
arXiv2012

Increasing Randomness Using Permutations on Blocks

This paper investigates the effect of permutations on blocks of a prime reciprocal sequence on its randomness. A relationship between the number of permutations used and the improvement of performance is presented. This can be used as a method for increasing the cryptographic strength of pseudorandom sequences.

cs.CR↗
arXiv2011

The Algebra of Two Dimensional Patterns

The article presents an algebra to represent two dimensional patterns using reciprocals of polynomials. Such a representation will be useful in neural network training and it provides a method of training patterns that is much more efficient than a pixel-wise representation.

cs.IT↗
arXiv2010

The Use of Rapid Digital Game Creation to Learn Computational Thinking

Computational Thinking (CT) has been described as a universally applicable ability such as reading and writing. In this paper, we describe an innovative pedagogy using Rapid Digital Game Creation (RDGC) for learning CT skills. RDGC involves the rapid building of digital games with high-level software that requires little or no programming knowledge. We analyze how RDGC supports various CT concepts and how it may be mapped to equivalent Java concepts by building the same game using both RDGC and Java. We discuss the potential benefits of this approach for attracting computing majors, as a precursor to learning formal programming languages, for learning domain knowledge, and for bridging the digital divide. We present the implications of this work for teachers and researchers.

cs.OH↗
arXiv2010

On the Mesh Array for Matrix Multiplication

This article presents new properties of the mesh array for matrix multiplication. In contrast to the standard array that requires 3n-2 steps to complete its computation, the mesh array requires only 2n-1 steps. Symmetries of the mesh array computed values are presented which enhance the efficiency of the array for specific applications. In multiplying symmetric matrices, the results are obtained in 3n/2+1 steps. The mesh array is examined for its application as a scrambling system.

cs.DC↗
arXiv2010

Pythagorean Triples and Cryptographic Coding

This paper summarizes basic properties of PPTs and shows that each PPT belongs to one of six different classes. Mapping an ordered sequence of PPTs into a corresponding sequence of these six classes makes it possible to use them in cryptography. We pose problems whose solution would facilitate such cryptographic application.

cs.CR↗
arXiv2010

Aryabhata's Mathematics

This paper presents certains aspects of the mathematics of Aryabhata that are of interest to the cryptography community.

cs.CR↗
arXiv2010

Recursive Secret Sharing for Distributed Storage and Information Hiding

This paper presents a recursive computational multi-secret sharing technique that hides k-2 secrets of size b each into n shares of a single secret S of size b, such that any k of the n shares suffice to recreate the secret S as well as all the hidden secrets. This may act as a steganographic channel to transmit hidden information or used for authentication and verification of shares and the secret itself. Further, such a recursive technique may be used as a computational secret sharing technique that has potential applications in secure and reliable storage of information on the Web, in sensor networks and information dispersal schemes. The presented technique, unlike previous computational techniques, does not require the use of any encryption key or storage of public information.

cs.CR↗
arXiv2010

A Distributed Data Storage Scheme for Sensor Networks

We present a data storage scheme for sensor networks that achieves the targets of encryption and distributed storage simultaneously. We partition the data to be stored into numerous pieces such that at least a specific number of them have to be brought together to recreate the data. The procedure for creation of partitions does not use any encryption key and the pieces are implicitly secure. These pieces are then distributed over random sensors for storage. Capture or malfunction of one or more (less than a threshold number of sensors) does not compromise the data. The scheme provides protection against compromise of data in specific sensors due to physical capture or malfunction.

cs.CR↗
arXiv2010

A Key Distribution Scheme for Sensor Networks Using Structured Graphs

This paper presents a new key predistribution scheme for sensor networks based on structured graphs. Structured graphs are advantageous in that they can be optimized to minimize the parameter of interest. The proposed approach achieves a balance between the number of keys per node, path lengths, network diameter and the complexity of routing algorithm.

cs.CR↗
arXiv2010

Internet voting protocol based on implicit data security

This paper presents a new protocol for Internet voting based on implicit data security. This protocol allows recasting of votes, which permits a change of mind by voters either during the time window over which polling is open or during a shorter period over which recasting is permitted. The security of votes depends on multiple servers such that each vote is divided into partitions and these partitions are distributed among the servers, all of which need to be brought together to reconstruct the votes. Such a protocol has potential applications in bargaining and electronic commerce.

cs.CR↗