K. Vijay Kumar, Justin S. Bois, Frank Jülicher, and Stephan W. Grill Max Planck Institute for the Physics of Complex Systems, Nöthnitzerstraße 38, 01187 Dresden, Germany Max Planck Institute of Molecular Cell Biology and Genetics, Pfotenhauerstraße 108, 01307 Dresden, Germany BIOTEC, Technische Universität Dresden, Tatzberg 47/49, 01307 Dresden, Germany California Institute of Technology Divisi...

The Enigma is probably the most well known wired wheel cipher machine. The NEMA is a cipher machine developed during World War II by the Swiss Army. It is designed on the same principle as the Enigma but with particular emphasis on overcoming some of its weak features. It was declassified by the Swiss Authorities in 1992. This paper describes its mechanism and the way in which it operates, so t...

We show that interactive and noninteractive zero-knowledge are equivalent in the ‘help model’ of Ben-Or and Gutfreund (J. Cryptology, 2003). In this model, the shared reference string is generated by a probabilistic polynomial-time dealer who is given access to the statement to be proven. Our results do not rely on any unproven complexity assumptions and hold for statistical zero knowledge, for...

1Department of Computer Science Electrical Engineering, University of Missouri-Kansas City, Kansas City, MO 64110, USA 2Department of Computer Science and Information Engineering, National Chung Cheng University, Chiayi 62102, Taiwan 3Key Laboratory of Network Security and Cryptology, Fujian Normal University, Fujian 350007, P. R. China 4Department of Information Engineering and Computer Scienc...

Basing on some cryptographic primitives widely recognized to be de facto standards in modern cryptology, we build a security server that provides data encryption services, authentication and digital signature schemes for users of a local area network. We exploit the well-established mathematical methods for building primitives, but our detail implementation is independent of others systems of s...

In the areas of algorithmic number theory and cryptology, algorithms are usually described and analyzed in some randomized random access machine model. In this work the complexity of various computational problems is studied in the multitape Turing model of computation. It is shown that “up to logarithmic factors” key results also hold in the multitape Turing model. Specific problems which are ...

A pseudorandom number generator plays an important role in practice in computer science. For example: computer simulations, cryptology, and so on. A pseudorandom number generator is an algorithm to generate a sequence of numbers that is indistinguishable from the true random number sequence. In this article, we shall formalize the “Uniform Distribution” that is the idealized set of true random ...

We analyze the handshake protocol of TLS 1.3 draft-ietf-tls-tls13-10 (published October 2015). This continues and extends our previous analysis (CCS 2015, Cryptology ePrint Archive 2015) of former TLS 1.3 drafts (draft-ietf-tls-tls13-05 and draft-ietf-tls-tls13-dh-based). Here we show that the full (EC)DHE Diffie–Hellman-based handshake of draft-10 is also secure in the multi-stage key exchange...

Cascaded GMW sequences have two-level autocorrelation functions, which have important applications in communications and cryptology. In this paper, we consider the cascaded GMW sequences corresponding to a xed nite chain of nite elds, and study the problem of how to determine all these diierent cascaded GMW sequences without repetition, and the problem of whether the diierent cascaded GMW seque...

Introduction Pseudo-random sequence have been widely used in communication and cryptology. Any (pseudo-) random sequence used in practical system is generated by a machine, a computer or a device, those devices are called (pseudo-) random sequence generator, or PRSG PRSG may be linear feedback shift register, finite automata or some feedback mode using block cipher. Content of this slide what i...