Related papers: Alan M. Turing: The Applications of Probability to…
The goal of this chapter is to present a survey of homomorphic encryption techniques and their applications. After a detailed discussion on the introduction and motivation of the chapter, we present some basic concepts of cryptography. The…
Preprints play an increasingly critical role in academic communities. There are many reasons driving researchers to post their manuscripts to preprint servers before formal submission to journals or conferences, but the use of preprints has…
This paper covers two topics: first an introduction to Algorithmic Complexity Theory: how it defines probability, some of its characteristic properties and past successful applications. Second, we apply it to problems in A.I. - where it…
Computational tools for data analysis are being released daily on repositories such as the Comprehensive R Archive Network. How we integrate these tools to solve a problem in research is increasingly complex and requiring frequent updates.…
We give an idiosyncratic overview of applications of topology to cyber research, spanning the analysis of variables/assignments and control flow in computer programs, a brief sketch of topological data analysis in one dimension, and the use…
This is the chapter \emph{Topological Codes} of the book \emph{Quantum Error Correction}, edited by Daniel A. Lidar and Todd A. Brun, Cambridge University Press, New York, 2013.…
Quantum cryptography is the art and science of exploiting quantum mechanical effects in order to perform cryptographic tasks. While the most well-known example of this discipline is quantum key distribution (QKD), there exist many other…
Grammar-based compression is a popular and powerful approach to compressing repetitive texts but until recently its relatively poor time-space trade-offs during real-life construction made it impractical for truly massive datasets such as…
The present preprint completes the arXiv preprint #2202.11652, entitled "Pseudodifferential arithmetic and the Riemann hypothesis", devoted to a proof of the conjecture. The first 4 pages of that preprint were devoted to a set of necessary…
The paper develops a new technique to extract a characteristic subset from a random source that repeatedly samples from a set of elements. Here a characteristic subset is a set that when containing an element contains all elements that have…
The history of computability theory and and the history of analysis are surprisingly intertwined since the beginning of the twentieth century. For one, \'Emil Borel discussed his ideas on computable real number functions in his introduction…
Cryptography is an art and science of secure communication. Here the sender and receiver are guaranteed the security through encryption of their data, with the help of a common key. Both the parties should agree on this key prior to…
This paper studies leakage of user passwords and PINs based on observations of typing feedback on screens or from projectors in the form of masked characters that indicate keystrokes. To this end, we developed an attack called Password and…
This paper explores articles hosted on the arXiv preprint server with the aim to uncover valuable insights hidden in this vast collection of research. Employing text mining techniques and through the application of natural language…
Plagiarism is a pressing concern, even more so with the availability of large language models. Existing plagiarism detection systems reliably find copied and moderately reworded text but fail for idea plagiarism, especially in mathematical…
This paper discloses a simple algorithm for encrypting text messages, based on the NP-completeness of the subset sum problem, such that the similarity between encryptions is roughly proportional to the semantic similarity between their…
This paper presents new properties of Primitive Pythagorean Triples (PPT) that have relevance in applications where events of different probability need to be generated and in cryptography.
This paper presents applications of the trope of the locked and sealed piggy-bank into which the secret can be easily inserted but from which it cannot be withdrawn without opening the box. We present a basic two-pass cryptographic scheme…
Rejoinder of "Estimating the historical and future probabilities of large terrorist events" by Aaron Clauset and Ryan Woodard [arXiv:1209.0089].
Neural cryptography is based on synchronization of tree parity machines by mutual learning. We extend previous key-exchange protocols by replacing random inputs with queries depending on the current state of the neural networks. The…