English
Related papers

Related papers: One-Time Pads from the Digits of Pi

200 papers

A process for the secure transmission of data is presented that has to a certain degree the advantages of the one-time pad (OTP) cipher, that is, simplicity, speed, and information-theoretically security, but overcomes its fundamental…

Cryptography and Security · Computer Science 2016-08-22 Uwe Starossek

One-time pad encrypted files can be sent through Internet channels using current Internet protocols. However, the need for renewing shared secret keys make this method unpractical. This work shows how users can use a fast physical random…

Quantum Physics · Physics 2007-05-23 Geraldo A. Barbosa

This is a survey on the One Time Pad (OTP) and its derivatives, from its origins to modern times. OTP, if used correctly, is (the only) cryptographic code that no computing power, present or future, can break. Naturally, the discussion…

Cryptography and Security · Computer Science 2021-08-17 Umberto Cerruti

A while ago, I developed what I called an encryption method. The most favorable of reviews did not see a method but a collection of techniques. Be that as it may, the process used, is described in the paper, Windtalking Computers. This…

Cryptography and Security · Computer Science 2013-06-04 Givon Zirkind

Pi Fractions are used to create deterministic uniformly distributed pseudorandom decision space sample points for a global search and optimization algorithm. These fractions appear to be uniformly distributed on [0,1] and can be used in any…

Other Computer Science · Computer Science 2014-03-18 Richard A. Formato

A one-time pad (OTP) based cipher to insure both data protection and integrity when mobile code arrives to a remote host is presented. Data protection is required when a mobile agent could retrieve confidential information that would be…

Cryptography and Security · Computer Science 2007-05-23 Igor Sobrado

We present an algorithm for generating Poisson-disc patterns taking O(N) time to generate $N$ points. The method is based on a grid of regions which can contain no more than one point in the final pattern, and uses an explicit model of…

Graphics · Computer Science 2013-03-29 Thouis R. Jones , David R. Karger

When I was smaller, a five megabyte fixed disk cost $5,000, a 300 bps modem cost hundreds of dollars, and communication links were intercepted by attaching devices to the target subscriber's local loop. From then to now there have been…

Cryptography and Security · Computer Science 2012-12-21 Marc W. Abel

Unconditionally secure physical key distribution schemes are very slow, and it is practically impossible to use a one-time-pad based cipher to guarantee unconditional security for the encryption of data because using the key bits more than…

Cryptography and Security · Computer Science 2015-05-07 Laszlo B. Kish

The Vernam cipher (or one-time pad) has played an important rule in cryptography because it is a perfect secrecy system. For example, if an English text (presented in binary system) $X_1 X_2 ... $ is enciphered according to the formula $Z_i…

Cryptography and Security · Computer Science 2013-03-12 Boris Ryabko

Personal Identification Numbers (PIN) are widely used as authentication method for systems such as Automated Teller Machines (ATMs) and Point of Sale (PoS). Input devices (PIN pads) usually give the user a feedback sound when a key is…

Cryptography and Security · Computer Science 2019-05-22 Matteo Cardaioli , Mauro Conti , Kiran Balagani , Paolo Gasti

This paper proposes the first user-independent inter-keystroke timing attacks on PINs. Our attack method is based on an inter-keystroke timing dictionary built from a human cognitive model whose parameters can be determined by a small…

Cryptography and Security · Computer Science 2018-10-18 Ximing Liu , Yingjiu Li , Robert H. Deng , Bing Chang , Shujun Li

Based on the analysis of $6$-digit one-time passwords(OTP) generated by DIGIPASS GO3 we were able to reconstruct the synchronisation system of the token, the OTP generating algorithm and the verification protocol in details essential for an…

Cryptography and Security · Computer Science 2015-06-23 Igor Semaev

In this letter, we prove that the perfectly secure One-Time Pad (OTP) encryption can be seen as finding the initial condition on the binary map under a random switch based on the perfectly random pad. This turns out to be a special case of…

Chaotic Dynamics · Physics 2008-03-04 Nithin Nagaraj , Prabhakar G. Vaidya

A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of x= cot2(x). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract…

Discrete Mathematics · Computer Science 2013-01-23 Nabarun Mondal , Partha P. Ghosh

This work presents new techniques to produce true random bits by exploiting single photon time of arrival. Two FPGA-based QRNG devices are presented: Randy which uses one discrete SPAD and LinoSPAD which uses a CMOS SPAD array, along with a…

Personal Identification Numbers (PINs) are commonly used as an authentication mechanism. An important security requirement is that PINs should be hard to guess for an attacker. On the other hand, remembering several random PINs can be…

Cryptography and Security · Computer Science 2013-02-13 Lubica Staneková , Martin Stanek

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…

We describe an encrypted communication principle that can form a perfectly secure link between two parties without electronically saving either of their keys. Instead, cryptographic key bits are kept safe within the unique mesoscopic…

Text-based passwords continue to be the prime form of authentication to computer systems. Today, they are increasingly created and used with mobile text entry methods, such as touchscreens and mobile keyboards, in addition to traditional…

Cryptography and Security · Computer Science 2014-03-11 Yulong Yang , Janne Lindqvist , Antti Oulasvirta
‹ Prev 1 2 3 10 Next ›