Frank Rubin - RankMe

27 papers A* 3Journal 24

Year	Rank	Type	Title / Venue / Authors
2007	J	`jnl`	An Improved Method for Finding Knight Covers. Ars Comb. Frank Rubin
2003	J	`jnl`	Improved Knight Coverings. Ars Comb. Frank Rubin
1996	J	`jnl`	Designing a High-Security Cipher. Cryptologia Frank Rubin
1996	J	`jnl`	One-Time Pad Cryptography. Cryptologia Frank Rubin
1995	J	`jnl`	Message Authentication Using Quadratic residues. Cryptologia Frank Rubin
1995	J	`jnl`	The Quadratic and Double Quadratic Residue Ciphers. Cryptologia Frank Rubin
1994	J	`jnl`	Comments on "Cryptanalysis of Knapsack Ciphers Using Genetic Algorithms". Cryptologia Frank Rubin
1988	J	`jnl`	The Cryptographic Uses of Post Tag Systems. Cryptologia Frank Rubin
1987	J	`jnl`	Foiling an Exhaustive Key-Search Attack. Cryptologia Frank Rubin
1986	J	`jnl`	Foiling the Known-Plaintext Attack. Cryptologia Frank Rubin
1983	A*	`conf`	A logic design front-end for improved engineering productivity. DAC Frank Rubin, Paul W. Horstmann
1981	J	`jnl`	Decrypting a Stream Cipher Based on j-k Flip-Flops. Cryptologia Frank Rubin
1981	J	`jnl`	Further Comments on "An Optimal Solution for the Channel-Assignment Problem". IEEE Trans. Computers Frank Rubin
1979	J	`jnl`	Arithmetic stream coding using fixed precision registers. IEEE Trans. Inf. Theory Frank Rubin
1979	J	`jnl`	Cryptographic Aspects of Data Compression Codes. Cryptologia Frank Rubin
1979	J	`jnl`	Decrypting a Stream Cipher Based on IEEE Trans. Computers Frank Rubin
1979	J	`jnl`	Solving a Cipher Based on Multiple Random Number Streams. Cryptologia Frank Rubin
1978	J	`jnl`	Computer Methods for Decrypting Multiplex Ciphers. Cryptologia Frank Rubin
1978	J	`jnl`	Computer Methods for Decrypting Random Stream Ciphers. Cryptologia Frank Rubin
1976	J	`jnl`	Experiments in Text File Compression. Commun. ACM Frank Rubin
1976	J	`jnl`	Generation of Nonparametric Curves. IEEE Trans. Computers Frank Rubin
1976	J	`jnl`	Partition of Integers. ACM Trans. Math. Softw. Frank Rubin
1975	J	`jnl`	An Improved Algorithm for Testing the Planarity of a Graph. IEEE Trans. Computers Frank Rubin
1975	J	`jnl`	Worst Case Bounds for Maximal Compatible Subsets. IEEE Trans. Computers Frank Rubin
1974	J	`jnl`	A Search Procedure for Hamilton Paths and Circuits. J. ACM Frank Rubin
1974	A*	`conf`	An iterative technique for printed wire routing. DAC Frank Rubin
1973	A*	`conf`	Assigning wires to layers of a printed circuit board. DAC Frank Rubin