DOCSLIB.ORG

The Design and Testing of a Superconducting Programmable Gate Array

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
The Design and Testing of a Superconducting Programmable Gate Array The Design and Testing of a Superconducting Programmable Gate Array by Hein van Heerden Thesis presented at the University of Stellenbosch in partial fulfilment of the requirements for the degree of Master of Science in Electronic Engineering Department of Electrical and Electronic Engineering University of Stellenbosch Private Bag X1, 7602 Matieland, South Africa Study leader: Dr. C.J. Fourie December 2005 Copyright © 2005 University of Stellenbosch All rights reserved. Declaration I, the undersigned, hereby declare that the work contained in this thesis is my own original work and that I have not previously in its entirety or in part submitted it at any university for a degree. Signature: . H. van Heerden Date: . ii Abstract This thesis investigates to the design, analysis and testing of a Superconducting Programmable Gate Array (SPGA). The objective was to apply existing programmable logic concepts to RSFQ circuits and in the process develop a working prototype of a superconducting pro- grammable logic device. Various programmable logic technologies and architectures were examined and compared to find the best solution. Using Rapid Single Flux Quantum (RSFQ) circuits as building blocks, a complete functional design was assembled incorporating a rout- ing architecture and logic blocks. The Large-Scale Integrated circuit (LSI) layout of the final chip is presented and discussed followed by a discussion on testing. This thesis demon- strates the successful implementation of a fully functional reprogrammable logic device us- ing RSFQ circuitry. iii Opsomming Hierdie tesis handel oor die ontwerp, analise en toets van 'n SPGA (Superconducting Pro- grammable Gate Array). Die doel is om huidige programeerbare logika konsepte aan te pas en in die proses 'n werkende prototipe te ontwikkel wat beskryf kan word as 'n supergeleier programeerbare logiese toestel wat se werking soortgelyk is aan dié van FPGAs. 'n Verskei- denheid van programeerbare logika tegnologieë en argitekture is ondersoek en met mekaar vergelyk om die beste oplossing te vind. Met RSFQ (Rapid Single Flux Quantum) stroom- bane as boublokke is 'n hele funksionele ontwerp aanmekaar gesit wat beide 'n verspreid- ingsargitektuur en logieseblokke inkorporeer. Die grootskaalse geïntegreerde stroombaan uitleg van die finale vlokkie word bespreek en voorgelê. Daarna volg 'n bespeking oor toetsing van die ontwerp. Hierdie tesis demonstreer die suksesvolle implementering van 'n werkende herprogrameerbare logika toestel bestaande uit RSFQ stroombane. iv Acknowledgements I would like to express my sincere gratitude to the following people and organisations who have contributed to making this work possible: • Steve R. Whiteley for his invaluable simulation tools, which made this project feasible. • Hypres Inc. for providing the fabrication platform on which the physical implementa- tion of this project is based. Especially Dr. S. Tolpygo, head of fabrication, for his help and direction. • The National Research Foundation of South Africa (and Prof. D.B. Davidson as grantholder) for providing some financial assistance during my research. • My fellow students and good friends, Hennie de Villiers and Wynand van Staden for providing inspiration and support during difficult times. • Prof. Willem J. Perold for giving me the inspiration and opportunity to pursue my quest for further enrichment in the field of engineering. Also, for his eternal optimism and enthusiasm. • Lastly, but most of all, Dr. Coenrad J. Fourie as my study leader for the countless hours of advice and guidance and also for providing me with a good background and basis on which to build this project. v Dedications This thesis is dedicated to my mother for her support, encouragement and eternal love. Sadly, she passed away before the completion of this project. She will be missed. vi Contents Declaration ii Abstract iii Opsomming iv Acknowledgements v Dedications vi Contents vii List of Figures xi List of Tables xiv Nomenclature xv 1 Introduction 1 1.1 Semiconductor programmable logic . 1 1.2 Superconducting logic . 1 1.3 SPGA . 2 1.4 Summary of thesis . 2 2 SPGA background and RSFQ basics 3 2.1 SPGA background . 3 2.2 RSFQ basics . 4 3 Programmable logic 7 3.1 Field-programmable gate array . 7 3.1.1 Architectures . 7 3.1.2 Programming technologies . 9 3.1.3 Implementation . 11 vii CONTENTS viii 3.2 Technology mapping . 16 3.2.1 Lookup table mapping . 16 3.2.2 Multiplexer mapping . 17 3.2.3 Examples . 17 3.3 Area vs Functionality . 24 3.3.1 Model . 24 3.3.2 Logic block area and routing model . 24 3.3.3 Area vs. functionality experiment . 25 3.4 SPGA . 28 3.5 Chapter summary . 29 4 SPGA design 30 4.1 Basic gates . 30 4.1.1 DCRL . 30 4.1.2 HUFFLE . 32 4.1.3 I-Switch . 34 4.1.4 I2-Switch . 35 4.1.5 MSL Driver and Receiver pair . 36 4.1.6 RSFQ-to-COSL Converter . 38 4.2 Monte Carlo analysis and simulations . 39 4.3 Inductance restrictions between gates . 39 4.4 Composite blocks . 40 4.4.1 Inline Switch . 40 4.4.2 Junction Switch . 40 4.4.3 Crossbar Switch . 42 4.4.4 Logic Block . 43 4.4.5 Programming Frame . 47 4.5 SPGA . 50 4.6 Functional Verilog simulation of the SPGA . 51 4.6.1 Functional models . 51 4.6.2 Programming and simulation . 56 4.7 Chapter summary . 62 5 Physical layout 63 5.1 Hierarchical layout design approach . 65 5.2 Basic gates . 65 5.2.1 AND gate . 66 5.2.2 DCRL . 66 5.2.3 I2-Switch . 67 CONTENTS ix 5.3 Microstrip transmission lines . 70 5.4 Composite blocks . 71 5.4.1 Logic Block . 72 5.4.2 Programming Logic Column driver . 73 5.4.3 Programming Logic Row driver . 74 5.4.4 Full chip layout . 75 5.5 Error checking and verification . 76 5.5.1 Gate verification . 76 5.5.2 Signal route checking . 76 5.5.3 Connection checking . 81 5.5.4 Design rule checking . 82 5.5.5 Full-chip scan . 83 5.6 Parameter extraction . 83 5.6.1 SLine . 83 5.6.2 FastHenry and InductEx . 83 5.6.3 Example: I2-Switch . 84 5.7 Input and output impedance matching . 85 5.8 Signal-to-Pad assignments . 85 5.9 Moats . 89 5.10 Chapter summary and conclusions . 89 6 Testing 91 6.1 Testbed . 91 6.1.1 Cryocooler . 92 6.1.2 Room temperature electronics . 95 6.2 Test cases . 96 6.2.1 Example 1: Direct input to output . 98 6.2.2 Example 2: One logic block . 98 6.2.3 Example 3: Comprehensive logic function . 100 6.3 Test results . 102 7 Conclusions and recommendations 105 List of References 107 Appendices 112 A Verilog modules 113 A.1 SM1 . 113 A.2 SM_STOP . 113 CONTENTS x A.3 LUT_IN . 114 A.4 LUT_OUT . 115 A.5 LB . 115 A.6 SPGA . 116 B Spice code 119 B.1.
Load more

Recommended publications
  • Transistor Circuit Guidebook Byron Wels TAB BOOKSBLUE RIDGE SUMMIT, PA
    TAB BOOKS No. 470 34.95 By Byron Wels TransistorCircuit GuidebookByronWels TABBLUE RIDGE BOOKS SUMMIT,PA. 17214 Preface beforemeIa supposepioneer (along the my withintransistor firstthe many field.experiencewith wasother Weknown. World were using WarUnlike solid-stateIIsolid-state GIs) today's asdevices somewhat experimen- receivers marks of FIRST EDITION devicester,ownFirst, withsemiconductors! youwith a choice swipedwhichor tank. ofto a sealed,Here'sexperiment, pairThen ofhow encapsulated, you earphones we carefullywe did had it: from totookand construct the veryonenearest exoticof our the THIRDSECONDFIRST PRINTING-SEPTEMBER PRINTING-AUGUST PRINTING-JANUARY 1972 1970 1968 plane,wasyouAnphonesantenna. emptywound strung jeep,apart After toiletfull outand ofclippingas paper wire,unwoundhigh closelyrollandthe servedascatchthe far spaced.wire offas as itfrom a thewouldsafetyThe thecoil remaining-pin,magnetreach-for form, you inside.which stuckwire the Copyright © 1968by TAB BOOKS coatedNext,it into youneeded,a hunkribbons of -ofwooda razor -steel, soblade.the but point Oh,aItblued was noneprojected placedblade of the -quenchat so fancy right the pointplastic-bluedangles.of -, Reproduction or publicationPrinted inof the ofAmerica the United content States in any manner, with- themindfoundphoneground pin you,the was couldserved right not wired contact lacquerspotas toa onground blade, it. theblued.blade'sAconnector, pin,bayonet bluing,and stuck antennaand you hilt thecould coil.-deep other actuallyIfin ear- youthe isoutherein. assumed express
    [Show full text]
  • A Fast and Verified Software Stackfor Secure Function Evaluation
    Session I4: Verifying Crypto CCS’17, October 30-November 3, 2017, Dallas, TX, USA A Fast and Verified Software Stack for Secure Function Evaluation José Bacelar Almeida Manuel Barbosa Gilles Barthe INESC TEC and INESC TEC and FCUP IMDEA Software Institute, Spain Universidade do Minho, Portugal Universidade do Porto, Portugal François Dupressoir Benjamin Grégoire Vincent Laporte University of Surrey, UK Inria Sophia-Antipolis, France IMDEA Software Institute, Spain Vitor Pereira INESC TEC and FCUP Universidade do Porto, Portugal ABSTRACT as OpenSSL,1 s2n2 and Bouncy Castle,3 as well as prototyping We present a high-assurance software stack for secure function frameworks such as CHARM [1] and SCAPI [31]. More recently, a evaluation (SFE). Our stack consists of three components: i. a veri- series of groundbreaking cryptographic engineering projects have fied compiler (CircGen) that translates C programs into Boolean emerged, that aim to bring a new generation of cryptographic proto- circuits; ii. a verified implementation of Yao’s SFE protocol based on cols to real-world applications. In this new generation of protocols, garbled circuits and oblivious transfer; and iii. transparent applica- which has matured in the last two decades, secure computation tion integration and communications via FRESCO, an open-source over encrypted data stands out as one of the technologies with the framework for secure multiparty computation (MPC). CircGen is a highest potential to change the landscape of secure ITC, namely general purpose tool that builds on CompCert, a verified optimizing by improving cloud reliability and thus opening the way for new compiler for C. It can be used in arbitrary Boolean circuit-based secure cloud-based applications.
    [Show full text]
  • Week 1: an Overview of Circuit Complexity 1 Welcome 2
    Topics in Circuit Complexity (CS354, Fall’11) Week 1: An Overview of Circuit Complexity Lecture Notes for 9/27 and 9/29 Ryan Williams 1 Welcome The area of circuit complexity has a long history, starting in the 1940’s. It is full of open problems and frontiers that seem insurmountable, yet the literature on circuit complexity is fairly large. There is much that we do know, although it is scattered across several textbooks and academic papers. I think now is a good time to look again at circuit complexity with fresh eyes, and try to see what can be done. 2 Preliminaries An n-bit Boolean function has domain f0; 1gn and co-domain f0; 1g. At a high level, the basic question asked in circuit complexity is: given a collection of “simple functions” and a target Boolean function f, how efficiently can f be computed (on all inputs) using the simple functions? Of course, efficiency can be measured in many ways. The most natural measure is that of the “size” of computation: how many copies of these simple functions are necessary to compute f? Let B be a set of Boolean functions, which we call a basis set. The fan-in of a function g 2 B is the number of inputs that g takes. (Typical choices are fan-in 2, or unbounded fan-in, meaning that g can take any number of inputs.) We define a circuit C with n inputs and size s over a basis B, as follows. C consists of a directed acyclic graph (DAG) of s + n + 2 nodes, with n sources and one sink (the sth node in some fixed topological order on the nodes).
    [Show full text]
  • Rigorous Cache Side Channel Mitigation Via Selective Circuit Compilation
    RiCaSi: Rigorous Cache Side Channel Mitigation via Selective Circuit Compilation B Heiko Mantel, Lukas Scheidel, Thomas Schneider, Alexandra Weber( ), Christian Weinert, and Tim Weißmantel Technical University of Darmstadt, Darmstadt, Germany {mantel,weber,weissmantel}@mais.informatik.tu-darmstadt.de, {scheidel,schneider,weinert}@encrypto.cs.tu-darmstadt.de Abstract. Cache side channels constitute a persistent threat to crypto implementations. In particular, block ciphers are prone to attacks when implemented with a simple lookup-table approach. Implementing crypto as software evaluations of circuits avoids this threat but is very costly. We propose an approach that combines program analysis and circuit compilation to support the selective hardening of regular C implemen- tations against cache side channels. We implement this approach in our toolchain RiCaSi. RiCaSi avoids unnecessary complexity and overhead if it can derive sufficiently strong security guarantees for the original implementation. If necessary, RiCaSi produces a circuit-based, hardened implementation. For this, it leverages established circuit-compilation technology from the area of secure computation. A final program analysis step ensures that the hardening is, indeed, effective. 1 Introduction Cache side channels are unintended communication channels of programs. Cache- side-channel leakage might occur if a program accesses memory addresses that depend on secret information like cryptographic keys. When these secret-depen- dent memory addresses are loaded into a shared cache, an attacker might deduce the secret information based on observing the cache. Such cache side channels are particularly dangerous for implementations of block ciphers, as shown, e.g., by attacks on implementations of DES [58,67], AES [2,11,57], and Camellia [59,67,73].
    [Show full text]
  • Probabilistic Boolean Logic, Arithmetic and Architectures
    PROBABILISTIC BOOLEAN LOGIC, ARITHMETIC AND ARCHITECTURES A Thesis Presented to The Academic Faculty by Lakshmi Narasimhan Barath Chakrapani In Partial Fulfillment of the Requirements for the Degree Doctor of Philosophy in the School of Computer Science, College of Computing Georgia Institute of Technology December 2008 PROBABILISTIC BOOLEAN LOGIC, ARITHMETIC AND ARCHITECTURES Approved by: Professor Krishna V. Palem, Advisor Professor Trevor Mudge School of Computer Science, College Department of Electrical Engineering of Computing and Computer Science Georgia Institute of Technology University of Michigan, Ann Arbor Professor Sung Kyu Lim Professor Sudhakar Yalamanchili School of Electrical and Computer School of Electrical and Computer Engineering Engineering Georgia Institute of Technology Georgia Institute of Technology Professor Gabriel H. Loh Date Approved: 24 March 2008 College of Computing Georgia Institute of Technology To my parents The source of my existence, inspiration and strength. iii ACKNOWLEDGEMENTS आचायातर् ्पादमादे पादं िशंयः ःवमेधया। पादं सॄचारयः पादं कालबमेणच॥ “One fourth (of knowledge) from the teacher, one fourth from self study, one fourth from fellow students and one fourth in due time” 1 Many people have played a profound role in the successful completion of this disser- tation and I first apologize to those whose help I might have failed to acknowledge. I express my sincere gratitude for everything you have done for me. I express my gratitude to Professor Krisha V. Palem, for his energy, support and guidance throughout the course of my graduate studies. Several key results per- taining to the semantic model and the properties of probabilistic Boolean logic were due to his brilliant insights.
    [Show full text]
  • Privacy Preserving Computations Accelerated Using FPGA Overlays
    Privacy Preserving Computations Accelerated using FPGA Overlays A Dissertation Presented by Xin Fang to The Department of Electrical and Computer Engineering in partial fulfillment of the requirements for the degree of Doctor of Philosophy in Computer Engineering Northeastern University Boston, Massachusetts August 2017 To my family. i Contents List of Figures v List of Tables vi Acknowledgments vii Abstract of the Dissertation ix 1 Introduction 1 1.1 Garbled Circuits . 1 1.1.1 An Example: Computing Average Blood Pressure . 2 1.2 Heterogeneous Reconfigurable Computing . 3 1.3 Contributions . 3 1.4 Remainder of the Dissertation . 5 2 Background 6 2.1 Garbled Circuits . 6 2.1.1 Garbled Circuits Overview . 7 2.1.2 Garbling Phase . 8 2.1.3 Evaluation Phase . 10 2.1.4 Optimization . 11 2.2 SHA-1 Algorithm . 12 2.3 Field-Programmable Gate Array . 13 2.3.1 FPGA Architecture . 13 2.3.2 FPGA Overlays . 14 2.3.3 Heterogeneous Computing Platform using FPGAs . 16 2.3.4 ProceV Board . 17 2.4 Related Work . 17 2.4.1 Garbled Circuit Algorithm Research . 17 2.4.2 Garbled Circuit Implementation . 19 2.4.3 Garbled Circuit Acceleration . 20 ii 3 System Design Methodology 23 3.1 Garbled Circuit Generation System . 24 3.2 Software Structure . 26 3.2.1 Problem Generation . 26 3.2.2 Layer Extractor . 30 3.2.3 Problem Parser . 31 3.2.4 Host Code Generation . 32 3.3 Simulation of Garbled Circuit Generation . 33 3.3.1 FPGA Overlay Architecture . 33 3.3.2 Garbled Circuit AND Overlay Cell .
    [Show full text]
  • Reaction Systems and Synchronous Digital Circuits
    molecules Article Reaction Systems and Synchronous Digital Circuits Zeyi Shang 1,2,† , Sergey Verlan 2,† , Ion Petre 3,4 and Gexiang Zhang 1,∗ 1 School of Electrical Engineering, Southwest Jiaotong University, Chengdu 611756, Sichuan, China; [email protected] 2 Laboratoire d’Algorithmique, Complexité et Logique, Université Paris Est Créteil, 94010 Créteil, France; [email protected] 3 Department of Mathematics and Statistics, University of Turku, FI-20014, Turku, Finland; ion.petre@utu.fi 4 National Institute for Research and Development in Biological Sciences, 060031 Bucharest, Romania * Correspondence: [email protected] † These authors contributed equally to this work. Received: 25 March 2019; Accepted: 28 April 2019 ; Published: 21 May 2019 Abstract: A reaction system is a modeling framework for investigating the functioning of the living cell, focused on capturing cause–effect relationships in biochemical environments. Biochemical processes in this framework are seen to interact with each other by producing the ingredients enabling and/or inhibiting other reactions. They can also be influenced by the environment seen as a systematic driver of the processes through the ingredients brought into the cellular environment. In this paper, the first attempt is made to implement reaction systems in the hardware. We first show a tight relation between reaction systems and synchronous digital circuits, generally used for digital electronics design. We describe the algorithms allowing us to translate one model to the other one, while keeping the same behavior and similar size. We also develop a compiler translating a reaction systems description into hardware circuit description using field-programming gate arrays (FPGA) technology, leading to high performance, hardware-based simulations of reaction systems.
    [Show full text]
  • SOTERIA: in Search of Efficient Neural Networks for Private Inference
    SOTERIA: In Search of Efficient Neural Networks for Private Inference Anshul Aggarwal, Trevor E. Carlson, Reza Shokri, Shruti Tople National University of Singapore (NUS), Microsoft Research {anshul, trevor, reza}@comp.nus.edu.sg, [email protected] Abstract paper, we focus on private computation of inference over deep neural networks, which is the setting of machine learning-as- ML-as-a-service is gaining popularity where a cloud server a-service. Consider a server that provides a machine learning hosts a trained model and offers prediction (inference) ser- service (e.g., classification), and a client who needs to use vice to users. In this setting, our objective is to protect the the service for an inference on her data record. The server is confidentiality of both the users’ input queries as well as the not willing to share the proprietary machine learning model, model parameters at the server, with modest computation and underpinning her service, with any client. The clients are also communication overhead. Prior solutions primarily propose unwilling to share their sensitive private data with the server. fine-tuning cryptographic methods to make them efficient We consider an honest-but-curious threat model. In addition, for known fixed model architectures. The drawback with this we assume the two parties do not trust, nor include, any third line of approach is that the model itself is never designed to entity in the protocol. In this setting, our first objective is to operate with existing efficient cryptographic computations. design a secure protocol that protects the confidentiality of We observe that the network architecture, internal functions, client data as well as the prediction results against the server and parameters of a model, which are all chosen during train- who runs the computation.
    [Show full text]
  • 50 Simple L.E.D. Circuits
    50 Simple L.E.D. Circuits R.N. SOAR r de Historie v/d Radi OTH'IEK 50 SIMPLE L.E.D. CIRCUITS by R. N. SOAR BABANI PRESS The Publishing Division of Babani Trading and Finance Co. Ltd. The Grampians Shepherds Bush Road London W6 7NI- England Although every care is taken with the preparation of this book, the publishers or author will not be responsible in any way for any errors that might occur. © 1977 BA BAN I PRESS I.S.B.N. 0 85934 043 4 First Published December 1977 Printed and Manufactured in Great Britain by C. Nicholls & Co. Ltd. f t* -i. • v /“ ..... tr> CONTENTS U.V.H.R* Circuit Page No. 1 LED Pilot Light......................................... 7 2 LED Stereo Beacon.................................... 8 3 Stereo Decoder Mono/Sterco Indicator . 9 4 Subminiature LED Torch........................... 10 5 Low Voltage Low Current Supply............ 11 6 Microlight Indicator .................................. 12 7 Ultra Low Current LED Switching Indicator 13 8 LED Stroboscope....................................... 14 9 12 Volt Car Circuit Tester........................... 15 10 Two Colour LED......................................... 16 11 12 Volt Car “Fuse Blown” Indicator.......... 17 12 LED Continuity Tester............................... 17 13 LED Current Overload Indicator.............. 18 14 LED Current Range Indicator................... 20 15 1.5 Volt LED “Zener”................. '............ 22 16 Extending Zener Voltage........................... 22 17 Four Voltage Regulated Supply................. 23 18 PsychaLEDic Display.................................. 24 .19 Dual Colour Display.................................... 25 20 Dual Signal Device....................................... 26 21 LED Triple Signalling.................................. 27 22 Sub-Miniature Light Source for Model Railways . 28 23 Portable Television Protection Circuit . 29 24 Improved Portable TV Protection Circuit 30 25 LED Battery Tester..............................
    [Show full text]
  • 621 212 Electronics and Communication Engineering Ec6304/Linear Integrated Circuits
    DSEC/ECE/EC6304-LIC/QB 1 DHANALAKSHMI SRINIVASAN ENGINEERING COLLEGE -621 212 ELECTRONICS AND COMMUNICATION ENGINEERING EC6304/LINEAR INTEGRATED CIRCUITS QUESTION BANK UNIT 1(2 MARKS) 1. What is an integrated circuit? APRIL/MAY 2010 An integrated circuit (IC) is a miniature, low cost electronic circuit consisting of active and Passive components fabricated together on a single crystal of silicon. The active components are Transistors and diodes and passive components are resistors and capacitors. 2. What is current mirror? APRIL/MAY 2010 A constant current source (current mirror) makes use of the fact that for a transistor in the active mode of operation, the collector current is relatively independent of the collector voltage 3. What are two requirements to be met for a good current source? MAY/JUNE 2012 a. Superior insensitivity of circuit performance to power supply variations and temperature. b. More economical than resistors in terms of die area required providing bias currents of small value. c. When used as load element, the high incremental resistance of current source results in high voltage gains at low supply voltages. 4. What are all the important characteristics of ideal op-amp? APRIL/MAY 2015 Ideal characteristics of OPAMP 1. Open loop gain infinite 2. Input impedance infinite 3. Output impedance low 4. Bandwidth infinite 5. Zero offset, ie, Vo=0 when V1=V2=0 5. Define CMRR of OP-AMP APRIL/MAY 2011 The relative sensitivity of an op-amp to a difference signal as compared to a common - mode signal is called the common -mode rejection ratio. It is expressed in decibels.
    [Show full text]
  • The Size and Depth of Layered Boolean Circuits
    The Size and Depth of Layered Boolean Circuits Anna G´al? and Jing-Tang Jang?? Dept. of Computer Science, University of Texas at Austin, Austin, TX 78712-1188, USA fpanni, [email protected] Abstract. We consider the relationship between size and depth for layered Boolean circuits, synchronous circuits and planar circuits as well as classes of circuits with small separators. In particular, we show that every layered Boolean circuitp of size s can be simulated by a lay- ered Boolean circuit of depth O( s log s). For planar circuits and syn- p chronous circuits of size s, we obtain simulations of depth O( s). The best known result so far was by Paterson and Valiant [16], and Dymond and Tompa [6], which holds for general Boolean circuits and states that D(f) = O(C(f)= log C(f)), where C(f) and D(f) are the minimum size and depth, respectively, of Boolean circuits computing f. The proof of our main result uses an adaptive strategy based on the two-person peb- ble game introduced by Dymond and Tompa [6]. Improving any of our results by polylog factors would immediately improve the bounds for general circuits. Key words: Boolean circuits, circuit size, circuit depth, pebble games 1 Introduction In this paper, we study the relationship between the size and depth of fan-in 2 Boolean circuits over the basis f_; ^; :g. Given a Boolean circuit C, the size of C is the number of gates in C, and the depth of C is the length of the longest path from any input to the output.
    [Show full text]
  • Accelerating Large Garbled Circuits on an FPGA-Enabled Cloud
    Accelerating Large Garbled Circuits on an FPGA-enabled Cloud Miriam Leeser Mehmet Gungor Kai Huang Stratis Ioannidis Dept of ECE Dept of ECE Dept of ECE Dept of ECE Northeastern University Northeastern University Northeastern University Northeastern University Boston, MA Boston, MA Boston, MA Boston, MA [email protected] [email protected] [email protected] [email protected] Abstract—Garbled Circuits (GC) is a technique for ensuring management technique presented is also applicable to other the privacy of inputs from users and is particularly well suited big data problems that make use of FPGAs. for FPGA implementations in the cloud where data analytics is In this paper we describe approaches and experiments to im- frequently run. Secure Function Evaluation, such as that enabled by GC, is orders of magnitude slower than processing in the prove on previous implementations in order to obtain improved clear. We present our best implementation of GC on Amazon speedup as well as support larger examples. Specifically, the Web Services (AWS) that implements garbling on Amazon’s main contribution of this paper is to use the memory available FPGA enabled F1 instances. In this paper we present the largest on an FPGA more efficiently in order to support large data problems garbled to date on FPGA instances, which includes sets on FPGA instances and improve the speed up obtained problems that are represented by over four million gates. Our implementation speeds up garbling 20 times over software over from running applications on FPGAs in the cloud. a range of different circuit sizes.
    [Show full text]