Frank Rubin

Bio: Frank Rubin is an academic researcher. The author has contributed to research in topics: Cipher & Stream cipher. The author has an hindex of 5, co-authored 15 publications receiving 89 citations.

One-time pad cryptography

Abstract: This paper shows how a moderate amount of random key stream can be used to generate a lifetime supply of keys for one-time pads It further shows how arbitrarily many parties can correspond using the same random key, without compromising one another's communications The net effect is to make the unbreakable one-time pad practical for widespread use

Cryptographic aspects of data compression codes

Abstract: (1979). CRYPTOGRAPHIC ASPECTS OF DATA COMPRESSION CODES. Cryptologia: Vol. 3, No. 4, pp. 202-205.

Message authentication using quadratic residues

Abstract: This paper shows a method for authenticating messages based on quadratic residues. The method will detect accidental or deliberate changes to a message, and will verify the sender of the message, both with near certainty. It does not require any preliminary exchange of messages, and does not require publishing any additional data besides each user's public key.

Computer methods for decrypting random stream ciphers

Abstract: (1978). COMPUTER METHODS FOR DECRYPTING RANDOM STREAM CIPHERS. Cryptologia: Vol. 2, No. 3, pp. 215-231.

Decrypting a stream cipher based on J-K flip-flops

Abstract: Pless has proposed a stream cipher based on J-K flip-flops that uses 8 linear shift registers with feedback, having a combined length of 97 bits, 4 J-K flip-flops, and a 4-stage cycling counter. The cipher has 2.54×1051 initial states (keys), and generates a presumably pseudorandom stream whose period is 1.52×1029 bits. Despite these impressive statistics, it is computationally feasible to solve such a cipher with a known-plaintext attack, using as few as 15 characters.

Handbook of Applied Cryptography

Abstract: From the Publisher: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols; more than 200 tables and figures; more than 1,000 numbered definitions, facts, examples, notes, and remarks; and over 1,250 significant references, including brief comments on each paper.

Decrypting a Class of Stream Ciphers Using Ciphertext Only

Abstract: Pseudonoise sequences generated by linear feedback shift registers [1] with some nonlinear combining function have been proposed [2]–[5] for cryptographic applications as running key generators in stream ciphers. In this correspondence it will be shown that the number of trials to break these ciphers can be significantly reduced by using correlation methods. By comparison of computer simulations and theoretical results based on a statistical model, the validity of this analysis is demonstrated. Rubin [6] has shown that it is computationally feasible to solve a cipher proposed by Pless [2] in a known plaintext attack, using as few as 15 characters. Here, the number of ciphertext symbols is determined to perform a ciphertext-only attack on the Pless cipher using the correlation attack. Our conclusion from the analysis is that the pseudonoise generator's output sequence and the sequences generated by the linear feedback shift registers should be uncorrelated. This leads to constraints for the nonlinear combining function to be used.

Data communication protocol

Abstract: Described is a data communication protocol, in which a client and server negotiate in a manner that does not require the client to retry negotiation when servers are not capable of the client-desired protocol. In one example implementation, the desired protocol is SMB 2.0 or greater. The protocol describes a create command with possibly additional context data attached for built-in extensibility, and a compound command comprising a plurality of related commands or unrelated commands. A multi-channel command requests data transfer on a separate data channel, a signed capability verification may be used to ensure that a secure connection is established, and the protocol provides the ability to transfer extended error data from the server in response to a request.

A proposed mode for triple-DES encryption

Abstract: We propose a new mode of multiple encryption—triple-DES external feedback cipher block chaining with output feedback masking. The aim is to provide increased protection against certain attacks (dictionary attacks and matching ciphertext attacks) which exploit the short message-block size of DES. The new mode obtains this protection through the introduction of secret masking values that are exclusive-ORed with the intermediate outputs of each triple-DES encryption operation. The secret mask value is derived from a fourth encryption operation per message block, in addition to the three used in previous modes. The new mode is part of a suite of encryption modes proposed in the ANSI X9.F.1 triple-DES draft standard (X9.52).