scispace - formally typeset
Search or ask a question
Topic

Handshake

About: Handshake is a research topic. Over the lifetime, 1105 publications have been published within this topic receiving 15166 citations. The topic is also known as: 🤝.


Papers
More filters
Book
Kees van Berkel1
01 Jan 1993
TL;DR: The Tangram and handshake circuits introduced here are examples of VLSI programs that can be run in either a discrete-time or a continuous-time fashion.
Abstract: 'Design by programming' has proved very successful in the development of complex software systems. This book describes the construction of programs for VLSI digital circuit design, using the language Tangram, and shows how they can be compiled automatically in fully asynchronous circuits. Handshake circuits were invented by the author to separate questions involving the efficient implementation of the VLSI circuits from issues arising in their design. Dr van Berkel presents a mathematical theory of handshake circuits and a silicon compiler supported by a correctness proof. The treatment of VLSI realizations of handshake circuits includes various forms of optimization, handshake refinement, message encoding, circuit initialization, and testing. The approach is illustrated with a host of examples drawn from a wide range of application areas. The book will be of use to electrical engineers and computer scientists involved in VLSI design.

270 citations

01 Jun 2003
TL;DR: This document provides both generic extension mechanisms for the TLS handshake client and server hellos, and specific extensions using these generic mechanisms.
Abstract: This document describes extensions that may be used to add functionality to Transport Layer Security (TLS). It provides both generic extension mechanisms for the TLS handshake client and server hellos, and specific extensions using these generic mechanisms.

267 citations

Proceedings ArticleDOI
25 Feb 1991
TL;DR: A silicon compiler is constructed that automates the translation of Tangram programs into handshake circuits and converts these handshake circuits into asynchronous circuits and subsequently into VLSI layouts.
Abstract: In this paper we view VLSI design as a programming activity. VLSI designs are described in the algorithmic programming language Tangram. The paper gives an overview of Tangram, providing sufficient detail to invite the reader to try a small VLSI program himself. Tangram programs can be translated into handshake circuits, networks of elementary components that interact by handshake signaling. We have constructed a silicon compiler that automates this translation and converts these handshake circuits into asynchronous circuits and subsequently into VLSI layouts.

219 citations

Proceedings ArticleDOI
30 May 1995
TL;DR: Single-rail handshake circuits are introduced as a cost effective implementation of asynchronous circuits that can be implemented in any (generic) standard-cell library and makes asynchronous circuits a potential technology of choice for low-power applications.
Abstract: Single-rail handshake circuits are introduced as a cost effective implementation of asynchronous circuits. Compared to double-rail implementations, the circuits are smaller, faster, and more energy-efficient. Furthermore, in contrast to common belief, all four phases of the four-phase handshake protocol can be productive. An important selling point for single-rail circuits is that they can be implemented in any (generic) standard-cell library. This facilitates technology migration and makes asynchronous circuits a potential technology of choice for low-power applications.

213 citations

Proceedings ArticleDOI
07 Aug 2002
TL;DR: This work evaluates the proposed algorithmic optimization techniques by obtaining processing times for the SSL handshake protocol on a state-of-the-art embedded processor by using the optimal algorithm configuration and a popular conventional algorithm configuration.
Abstract: Providing acceptable levels of security imposes significant computational requirements on wireless clients, servers, and network elements. These requirements are often beyond the modest processing capabilities and energy (battery) resources available on wireless clients. The relatively small sizes of wireless data transactions imply that public-key encryption algorithms dominate the security processing requirements. We propose techniques to improve the computational efficiency of public-key encryption algorithms. We focus on the modular exponentiation based encryption/decryption employed in many popular public-key algorithms. We study an extensive suite of algorithmic optimizations to the basic modular exponentiation algorithm and new advanced techniques. The proposed algorithmic optimizations lead to an "algorithm design space", across which performance varies significantly (over an order-of-magnitude). We evaluated the proposed algorithmic optimization techniques by obtaining processing times for the SSL (secure sockets layer) handshake protocol on a state-of-the-art embedded processor by using the optimal algorithm configuration and a popular conventional algorithm configuration. The results demonstrate that the optimum algorithm configuration leads to a 5.7/spl times/ improvement in SSL handshake protocol processing times. The proposed techniques are complementary to, and can be applied in conjunction with, improvements in security mechanisms and protocols, new hardware architectures, and improvements in silicon technologies.

208 citations


Network Information
Related Topics (5)
The Internet
213.2K papers, 3.8M citations
79% related
Social network
42.9K papers, 1.5M citations
74% related
Wireless
133.4K papers, 1.9M citations
74% related
Encryption
98.3K papers, 1.4M citations
73% related
Wireless network
122.5K papers, 2.1M citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202358
2022140
202137
202065
201991
201877