Layout of an Arbitrary Permutation in a Minimal Right Triangle Area (2008)
Maria Artishchev-zapolotsky, Shimon Even, Vladimir Yanovsky
Abstract In VLSI layout of interconnection networks,routing two-point nets in some restricted area is one of the central operations. It aims usu-ally to minimize the layout area, while reducing the...
Abstract Layout of an Arbitrary Permutation in a Minimal Right Triangle Area (2008)
Maria Artishchev-zapolotsky, Shimon Even, Vladimir Yanovsky
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. It aims usually to minimize the layout area, while reducing the number of...
Shimon Even, Ami Litman, Peter Winkler
We consider directed, strongly connected networks of identical finite-state automata, of bounded in- and out-degree but unknown topology and unbounded size n. Protocols which are quadratic or linear...
A Randomized Protocol for Signing Contracts (2008)
Ellis Horowitz, Shimon Even, Oded Goldreich, Abraham Lempel
ABSTRACT: Randomized protocols for signing contracts, certified mail, and flipping a coin are presented. The protocols use a Z-out-of-2 oblivious transfer subprotocol which is axiomatically defined....
Fundamentals of Programming Languages (2008)
Wayne Amsbury, Jean-loup Baer, Randal Bryant, Peter Calingaert, M. Carberry, H. Khalil, ...
Layout of the Batcher Bitonic Sorter (2007)
Extend Ed, Shimon Even, S. Muthukrishnan, Michael S. Paterson, Suleyman Cenk S
) Shimon Even S. Muthukrishnan y Michael S. Paterson z Suleyman Cenk S . ahinalp x Abstract The grid-area required by a sorting net for input vectors of length N is shown to be at least (N \Gamma 1)...
Layout of the Batcher Bitonic Sorter (Extended Abstract) (2007)
Shimon Even, S. Muthukrishnan, Michael S. Paterson, Süleyman Cenk Sahinalp, Suleyman Cenk S
The grid-area required by a sorting net for input vectors of length N is shown to be at least (N \Gamma 1) 2 =2. Of all sorting nets which use o(N 2 ) comparators, the bitonic sorting net of Batcher...
CRYPTANALYSIS OF THE PORTZ INTERCONNECTION-NETWORK BLOCK-CIPHER (2007)
A probabilistic polynomial complexity cryptanalysis of the Portz cipher is presented. The analysis applies to a class of similar systems as well, and relies on the symmetry of the interconnection...
SEQUENTIAL BOOLEAN EQUATIONS. (2005)
Even, Shimon, Meyer, Albert R.
The problem of solving sequential Boolean equations is shown to be equivalent to the problem of finding whether there exists a path on a labeled graph for every sequence of labels. Algorithms are...
SEQUENTIAL BOOLEAN EQUATIONS, (2005)
The problem of solving sequential Boolean equations is shown to be equivalent to the problem of finding whether there exists a path on a labeled graph for every sequence of labels. Algorithms are...
Maria Artishchev-zapolotsky, Shimon Even, Vladimir Yanovsky, M. Artishchev-zapolotsky, Y. Dinitz, S. Even, ...
In VLSI layout of interconnection networks, routing two-point nets in some restricted area is one of the central operations. The main aim is usually minimization of the layout area, while reducing...
Layout area of the hypercube (2003)
In this paper we study the square grid area required for laying out H l, the Boolean hypercube of N = 2 l vertices. It is shown that this area is 4
ON MINIMAL MODULO 2 SUMS OF PRODUCTS FOR SWITCHING FUNCTIONS. (1998)
Even,Shimon, Kohavi,Igal, Paz,Azaria
The minimal number of terms required for representing any switching function as a modulo-2 sums of products is investigated, and algorithm for obtaining economical ralizations is described. The main...
MINIMIZING THE NUMBER OF OPERATIONS IN CERTAIN DISCRETE VARIABLE OPTIMIZATION PROBLEMS. (1998)
Brioschi,Francesco, Even,Shimon
The paper deals with the solution by decomposition to a discrete optimization problem. A criterion for ranking the decomposition procedures is developed and properties of the optimal decompositions...
AMBIGUITY IN GRAPHS AND EXPRESSIONS, (1998)
Book,Ronald, Even,Shimon, Greibach,Sheila, Ott,Gene
A regular expression is called unambiguous if every tape in the event can be generated from the expression in one way only. The flow-graph-technique for constructing an expression is shown to...
A construction of a cipher from a single pseudorandom permutation (1997)
We suggest a scheme for a block cipher which uses only one randomly chosen permutation, F. The key, consisting of two blocks, K 1 and K 2 is used in the following way: The message block is XORed with...
Monochromatic Paths and Triangulated Graphs (1995)
Shimon Even, Ami Litman, Arnold L. Rosenberg
This paper considers two properties of graphs, one geometrical and one topological, and shows that they are strongly related. Let G be a graph with four distinguished and distinct vertices, w 1 ; w 2...
On-Line/Off-Line Digital Signatures (1994)
Shimon Even, Oded Goldreich, Silvio Micali
A new type of signature scheme is proposed. It consists of two phases. The first phase is performed off-line, before the message to be signed is even known. The second on-line phase is performed once...
Shimon Even, Oded Goldreich, Silvio Micali
Abstract. A new type of signature scheme is proposed. It consists of two phases. The first phase is performed off-line, before the message to be signed is even known. The second phase is performed...
A Construction of a Cipher From a Single Pseudorandom Permutation (1991)
We suggest a scheme for a block cipher which uses only one randomly chosen permutation, F . The key, consisting of two blocks, K 1 and K 2 is used in the following way: The message block is XORed...
Computing with Snakes in Directed Networks of Automata (1990)
Shimon Even, Ami Litman, Peter Winkler
We consider unidirectional, strongly connected networks of identical finite-state automata, of bounded in- and out-degree but unknown topology and unbounded size n. Protocols which are quadratic or...
On the Security of Multi-Party Ping-Pong Protocols (1985)
This paper is concerned with the model for security of cryptographic protocols suggested by Dolev and Yao. The Dolev and Yao model deals with a restricted class of protocols, known as Two-Party...
Cost Tradeoffs in Graph Embeddings, with Applications (Preliminary Version) (1981)
Hong, Jia-Wei, Mehlhorn, Kurt, Rosenberg, Arnold L., Even, Shimon, Kariv, Oded
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k (1973)
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n$ vertices is at least $k$. First the case of undirected graphs is discussed, and then it is shown...
An Algorithm for Determining Whether the Connectivity of a Graph is at Least k (1973)
The algorithm presented in this paper is for testing whether the connectivity of a large graph of $n$ vertices is at least $k$. First the case of undirected graphs is discussed, and then it is shown...
An analysis of logical design using the field of integers modulo 2 /--by Shimon Even. (1960)
Thesis (M.A.)--University of North Carolina at Chapel Hill, 1960.