DOCSLIB.ORG

Unsigned Integers (1)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Unsigned Integers (1) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science HISTORY OF EE 2310 • Initially planned by Prof. David Harper as a counterpart to courses on computer organization and design at Berkeley and Stanford D. Patterson (Berkeley) and J. Hennessy (Stanford) are the academic originators of RISC architecture • Required course, prerequisite to EE 4320 • Taught in 1994–95 as EE 2399 by lecturers Implementation did not meet the expectations of EE faculty • Taught 1996–present by Prof. Cantrell, D. Hollenbeck and Dr. Dodge • Background material added to make Patterson-Hennessy textbook ac- cessible to students with zero hardware or software experience: Digital kindergarten (gates, few-gate circuits, Boolean, Karnaugh) Basic CS (overview of processes, data structures) MANY comments on evaluation forms call for a laboratory ◦ EE 2V99 taught in Spring 1999 c C. D. Cantrell (08/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science EE2310 OVERVIEW • Course organization Professor Cantrell (email: [email protected]) ◦ Voice phone: (972) 883-2868 ◦ Office: EC 2.302 ◦ Office hours: Saturdays 10 AM – noon Dr. Dodge (email: [email protected]) ◦ Voice phone: (972) 883-2951 ◦ Office: EC 2.926 ◦ Office hours: 4–5 PM Tuesdays and Thursdays TAs:ArturoGarcia, Sabrina Zaman ◦ Office: EC 2.908 ◦Officehours:Monday through Thursday, 3:00–4:15PM Provisional grading algorithm (subject to change): course % grade = 0.10(homework %) + 0.225(midterm 1 %) +0.225(midterm 2 %) + 0.45(final exam %) c C. D. Cantrell (08/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science GOALS FOR WEEK 1 •GetaccesstotheWorldWideWeb Ways to get on the Web: ◦ PC or Mac via modem, cable modem or DSL ◦ PC or Mac in UTD Microcomputer Lab ◦ Internet-connected Unix machine from work or UTD EE 2310 Home Page: http://www.utdallas.edu/~cantrell/ee2310/ • Acquire books: Hennessy and Patterson, Computer Organization and Design, Second Edition, Morgan Kaufmann Publishers John Waldron, Introduction to RISC Assembly Language Program- ming, Addison-Wesley Capilano Computing Systems, LogicWorks 4, Addison-Wesley Roger Tokheim, Digital Principles, Third Edition, McGraw-Hill c C. D. Cantrell (08/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science WHAT DO EEs DO? DESIGN ² . Systems | Computers, wireless phones, ¯beroptic networks, ::: . Circuits | Logic circuits, transmission lines, ampli¯ers, ::: . Devices | Transistors, antennas, ::: . Software | Signal processing, navigation, simulation, ::: ANALYZE (one must understand in order to design) ² . Systems | Performance, signal-to-noise ratio, ::: . Devices | Semiconductors, antennas, waveguides, ::: TEACH ² . Courses . Individual instruction | M.S., Ph.D. dissertation research c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science COURSE GOALS Acquire the ability to use a hierarchical approach to understand a ² complex system . Basic Electrical Engineering approach . Valid for hardware and software . Facilitates troubleshooting . Essential on the job Become su±ciently well acquainted with the principles of computer ² architecture to be able to make intelligent use of computers for de- signing and simulating engineering systems, components, and devices Acquire a basic knowledge of assembly language ² . Helps one to accomplish the ¯rst two goals . Useful if one works with embedded systems c C. D. Cantrell (04/1999) VIEWS OF A 74135 DEVICE AT THREE DIFFERENT HIERARCHICAL LAYERS IC LEVEL GATE LEVEL PIN1 PIN1 1 135 1A 3 PIN1 2 1Y 1B PIN2 PIN2 PIN2 PIN6 4 PIN5 1C,2C PIN3 PIN3 5 2A 7 PIN3 PIN7 6 2Y 2B PIN4 PIN4 PIN4 PIN5 PIN5 PIN6 PIN6 PIN7 PIN7 GATE LEVEL TRANSISTOR LEVEL b b c a b aa b b THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science FALLACIES \I don't need to understand computers in order to use them." ² . Nothing works all the time. When it breaks, it's up to you: to diagnose the problem ± (probably) to ¯x it ± \I'm a CS major. I don't need to know about circuits." ² \I'm majoring in EE. I don't need to know about data structures." . The boundary between hardware and software is fuzzy Field-programmable gate arrays (FPGAs): ± Software-programmable computer architecture! Computational modeling: Choice of algorithm and ± program design depend on computer architecture Cache size/design a®ects loop order ¦ Parallelizability of algorithms/programs ¦ a®ects choice & design of hardware c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science WHAT IS \COMPUTER ARCHITECTURE"? Applications Compiler O/S Kernel Instruction Set Architecture Functional Memory I/O System Units Logic Gates (Digital Design) Devices (Circuit Design) c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science SHRINK-WRAPPED SOFTWARE • Shrink-wrapped software is a compiled program (or suite of pro- grams) packaged in a box that is sealed inside a plastic envelope that shrinks to fit the box when it is heated • Three things make shrink-wrapped software usable on computers that are manufactured by different vendors: Different vendors compile their software for the same instruction set architecture Different vendors compile their software for the same operating system Input/output hardware that conforms to a common set of standards is available on different systems c C. D. Cantrell (08/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science THE MAIN COMPONENTS OF A COMPUTER Computer Processor Memory Peripheral Devices Control Input Datapath Output c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science HIERARCHICAL APPROACH TO WRITING SOFTWARE Large program (100's or 1000's of lines) ² . Use top-down approach: Divide problem into tasks ± De¯ne a function (procedure, subroutine) to accomplish each task ± Code each function in its own module ± Specify interfaces (parameters to be passed, etc.) for each func- ± tion module . Essential concept for systems integration: The implementa- tion of a function is independent of its interface speci¯cation Implementation belongs to a di®erent level in the hierarchy ± Each module is a \black box" to higher-level modules ± Design is the most important step in creating a large program ² . Most hard-to-¯nd bugs originate in a faulty design c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science SIMULATORS • 1 SPIM (“25th the performance at none of the cost”) Simulates the RISC architecture (MIPS) most used in embedded systems (Nintendo 64, Sony PlayStation, ...) Available for architectures other than the native one The MIPS instruction set is simpler than most The SPIM interface is better than many real debuggers ◦ Registers, data segment, text segment, stack Documentation: Patterson & Hennessy, Appendix A; Waldron • XMPSIM Simulates one Cray X-MP processor Runs under DOS Gives good view of pipeline timing, stalls, etc. c C. D. Cantrell (01/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science TOPICAL OUTLINE What's inside the case? ² History | know it or repeat it ² Performance analysis ² Data representations ² Combinational logic circuits and Karnaugh maps ² MIPS and DEC Alpha assembly languages ² Sequential logic circuits ² Design of a simple arithmetic and logical unit (ALU) ² Design of the ALU control ² Designing a processor for speed: Pipelining ² Design of high-performance memory systems ² Input and output systems ² c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science HOW TO GET ONTO THE WEB FROM HOME (1) Basic requirements ² . PC (Windows 3.1, 95, 98 or NT, or linux) or Mac (System 7/8) . Modem (28.8 or 56k preferred) . Text-based communications program (not needed in Windows 95) Step 1: Find an Internet Services Provider (ISP) (UTD, for example) ² . PPP (point to point protocol) is used to communicate with the ISP . UTD free access: 60 hours of PPP time per month for every student . UTD RNA: unlimited use & no busy signal for $6.70/month . Commercial ISPs: $16{$25 per month for unlimited PPP time . AOL: $20/month for unlimited use c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science HOW TO GET ONTO THE WEB FROM HOME (2) Step 2: Get PPP software for your computer from your ISP, or by ² downloading from the Internet through Infoserv at UTD . PC (Windows 3.1): Trumpet Winsock PC (Windows 95/98/NT): Included with OS . Mac (System 7/8): Open Transport 1.x, FreePPP Step 3: Learn how to use PPP to communicate with your ISP ² . The PPP software can be used to issue text commands to the modem and to the UTD Annex system (for example) . Although it's possible to write a script for Trumpet or FreePPP, it's best to log in manually at ¯rst . Write a script later if you want to c C. D. Cantrell (04/1999) THE UNIVERSITY OF TEXAS AT DALLAS Erik Jonsson School of Engineering and Computer Science HOW TO GET ONTO THE WEB FROM HOME (3) Step 4: Get Web browser software for your computer from your ISP, ² with your operating system, or by downloading from the Internet through Infoserv at UTD . Netscape Navigator 4.5, or Netscape Communicator
Load more

Recommended publications
  • System Design for a Computational-RAM Logic-In-Memory Parailel-Processing Machine
    System Design for a Computational-RAM Logic-In-Memory ParaIlel-Processing Machine Peter M. Nyasulu, B .Sc., M.Eng. A thesis submitted to the Faculty of Graduate Studies and Research in partial fulfillment of the requirements for the degree of Doctor of Philosophy Ottaw a-Carleton Ins titute for Eleceical and Computer Engineering, Department of Electronics, Faculty of Engineering, Carleton University, Ottawa, Ontario, Canada May, 1999 O Peter M. Nyasulu, 1999 National Library Biôiiothkque nationale du Canada Acquisitions and Acquisitions et Bibliographie Services services bibliographiques 39S Weiiington Street 395. nie WeUingtm OnawaON KlAW Ottawa ON K1A ON4 Canada Canada The author has granted a non- L'auteur a accordé une licence non exclusive licence allowing the exclusive permettant à la National Library of Canada to Bibliothèque nationale du Canada de reproduce, ban, distribute or seU reproduire, prêter, distribuer ou copies of this thesis in microform, vendre des copies de cette thèse sous paper or electronic formats. la forme de microficbe/nlm, de reproduction sur papier ou sur format électronique. The author retains ownership of the L'auteur conserve la propriété du copyright in this thesis. Neither the droit d'auteur qui protège cette thèse. thesis nor substantial extracts fkom it Ni la thèse ni des extraits substantiels may be printed or otherwise de celle-ci ne doivent être imprimés reproduced without the author's ou autrement reproduits sans son permission. autorisation. Abstract Integrating several 1-bit processing elements at the sense amplifiers of a standard RAM improves the performance of massively-paralle1 applications because of the inherent parallelism and high data bandwidth inside the memory chip.
    [Show full text]
  • Block Ciphers: Fast Implementations on X86-64 Architecture
    Block Ciphers: Fast Implementations on x86-64 Architecture University of Oulu Department of Information Processing Science Master’s Thesis Jussi Kivilinna May 20, 2013 Abstract Encryption is being used more than ever before. It is used to prevent eavesdropping on our communications over cell phone calls and Internet, securing network connections, making e-commerce and e-banking possible and generally hiding information from unwanted eyes. The performance of encryption functions is therefore important as slow working implementation increases costs. At server side faster implementation can reduce the required capacity and on client side it can lower the power usage. Block ciphers are a class of encryption functions that are typically used to encrypt large bulk data, and thus make them a subject of many studies when endeavoring greater performance. The x86-64 architecture is the most dominant processor architecture in server and desktop computers; it has numerous different instruction set extensions, which make the architecture a target of constant new research on fast software implementations. The examined block ciphers – Blowfish, AES, Camellia, Serpent and Twofish – are widely used in various applications and their different designs make them interesting objects of investigation. Several optimization techniques to speed up implementations have been reported in previous research; such as the use of table look-ups, bit-slicing, byte-slicing and the utilization of “out-of-order” scheduling capabilities. We examine these different techniques and utilize them to construct new implementations of the selected block ciphers. Focus with these new implementations is in modes of operation which allow multiple blocks to be processed in parallel; such as the counter mode.
    [Show full text]
  • An FPGA-Accelerated Embedded Convolutional Neural Network
    Master Thesis Report ZynqNet: An FPGA-Accelerated Embedded Convolutional Neural Network (edit) (edit) 1000ch 1000ch FPGA 1000ch Network Analysis Network Analysis 2x512 > 1024 2x512 > 1024 David Gschwend [email protected] SqueezeNet v1.1 b2a ext7 conv10 2x416 > SqueezeNet SqueezeNet v1.1 b2a ext7 conv10 2x416 > SqueezeNet arXiv:2005.06892v1 [cs.CV] 14 May 2020 Supervisors: Emanuel Schmid Felix Eberli Professor: Prof. Dr. Anton Gunzinger August 2016, ETH Zürich, Department of Information Technology and Electrical Engineering Abstract Image Understanding is becoming a vital feature in ever more applications ranging from medical diagnostics to autonomous vehicles. Many applications demand for embedded solutions that integrate into existing systems with tight real-time and power constraints. Convolutional Neural Networks (CNNs) presently achieve record-breaking accuracies in all image understanding benchmarks, but have a very high computational complexity. Embedded CNNs thus call for small and efficient, yet very powerful computing platforms. This master thesis explores the potential of FPGA-based CNN acceleration and demonstrates a fully functional proof-of-concept CNN implementation on a Zynq System-on-Chip. The ZynqNet Embedded CNN is designed for image classification on ImageNet and consists of ZynqNet CNN, an optimized and customized CNN topology, and the ZynqNet FPGA Accelerator, an FPGA-based architecture for its evaluation. ZynqNet CNN is a highly efficient CNN topology. Detailed analysis and optimization of prior topologies using the custom-designed Netscope CNN Analyzer have enabled a CNN with 84.5 % top-5 accuracy at a computational complexity of only 530 million multiply- accumulate operations. The topology is highly regular and consists exclusively of convolu- tional layers, ReLU nonlinearities and one global pooling layer.
    [Show full text]
  • Advanced Synthesis Cookbook
    Advanced Synthesis Cookbook Advanced Synthesis Cookbook 101 Innovation Drive San Jose, CA 95134 www.altera.com MNL-01017-6.0 Document last updated for Altera Complete Design Suite version: 11.0 Document publication date: July 2011 © 2011 Altera Corporation. All rights reserved. ALTERA, ARRIA, CYCLONE, HARDCOPY, MAX, MEGACORE, NIOS, QUARTUS and STRATIX are Reg. U.S. Pat. & Tm. Off. and/or trademarks of Altera Corporation in the U.S. and other countries. All other trademarks and service marks are the property of their respective holders as described at www.altera.com/common/legal.html. Altera warrants performance of its semiconductor products to current specifications in accordance with Altera’s standard warranty, but reserves the right to make changes to any products and services at any time without notice. Altera assumes no responsibility or liability arising out of the application or use of any information, product, or service described herein except as expressly agreed to in writing by Altera. Altera customers are advised to obtain the latest version of device specifications before relying on any published information and before placing orders for products or services. Advanced Synthesis Cookbook July 2011 Altera Corporation Contents Chapter 1. Introduction Blocks and Techniques . 1–1 Simulating the Examples . 1–1 Using a C Compiler . 1–2 Chapter 2. Arithmetic Introduction . 2–1 Basic Addition . 2–2 Ternary Addition . 2–2 Grouping Ternary Adders . 2–3 Combinational Adders . 2–3 Double Addsub/ Basic Addsub . 2–3 Two’s Complement Arithmetic Review . 2–4 Traditional ADDSUB Unit . 2–4 Compressors (Carry Save Adders) . 2–5 Compressor Width 6:3 .
    [Show full text]
  • Usuba, Optimizing Bitslicing Compiler Darius Mercadier
    Usuba, Optimizing Bitslicing Compiler Darius Mercadier To cite this version: Darius Mercadier. Usuba, Optimizing Bitslicing Compiler. Programming Languages [cs.PL]. Sorbonne Université (France), 2020. English. tel-03133456 HAL Id: tel-03133456 https://tel.archives-ouvertes.fr/tel-03133456 Submitted on 6 Feb 2021 HAL is a multi-disciplinary open access L’archive ouverte pluridisciplinaire HAL, est archive for the deposit and dissemination of sci- destinée au dépôt et à la diffusion de documents entific research documents, whether they are pub- scientifiques de niveau recherche, publiés ou non, lished or not. The documents may come from émanant des établissements d’enseignement et de teaching and research institutions in France or recherche français ou étrangers, des laboratoires abroad, or from public or private research centers. publics ou privés. THESE` DE DOCTORAT DE SORBONNE UNIVERSITE´ Specialit´ e´ Informatique Ecole´ doctorale Informatique, Tel´ ecommunications´ et Electronique´ (Paris) Present´ ee´ par Darius MERCADIER Pour obtenir le grade de DOCTEUR de SORBONNE UNIVERSITE´ Sujet de la these` : Usuba, Optimizing Bitslicing Compiler soutenue le 20 novembre 2020 devant le jury compose´ de : M. Gilles MULLER Directeur de these` M. Pierre-Evariste´ DAGAND Encadrant de these` M. Karthik BHARGAVAN Rapporteur Mme. Sandrine BLAZY Rapporteur Mme. Caroline COLLANGE Examinateur M. Xavier LEROY Examinateur M. Thomas PORNIN Examinateur M. Damien VERGNAUD Examinateur Abstract Bitslicing is a technique commonly used in cryptography to implement high-throughput parallel and constant-time symmetric primitives. However, writing, optimizing and pro- tecting bitsliced implementations by hand are tedious tasks, requiring knowledge in cryptography, CPU microarchitectures and side-channel attacks. The resulting programs tend to be hard to maintain due to their high complexity.
    [Show full text]
  • Fpnew: an Open-Source Multi-Format Floating-Point Unit Architecture For
    1 FPnew: An Open-Source Multi-Format Floating-Point Unit Architecture for Energy-Proportional Transprecision Computing Stefan Mach, Fabian Schuiki, Florian Zaruba, Student Member, IEEE, and Luca Benini, Fellow, IEEE Abstract—The slowdown of Moore’s law and the power wall Internet of Things (IoT) domain. In this environment, achiev- necessitates a shift towards finely tunable precision (a.k.a. trans- ing high energy efficiency in numerical computations requires precision) computing to reduce energy footprint. Hence, we need architectures and circuits which are fine-tunable in terms of circuits capable of performing floating-point operations on a wide range of precisions with high energy-proportionality. We precision and performance. Such circuits can minimize the present FPnew, a highly configurable open-source transprecision energy cost per operation by adapting both performance and floating-point unit (TP-FPU) capable of supporting a wide precision to the application requirements in an agile way. The range of standard and custom FP formats. To demonstrate the paradigm of “transprecision computing” [1] aims at creating flexibility and efficiency of FPnew in general-purpose processor a holistic framework ranging from algorithms and software architectures, we extend the RISC-V ISA with operations on half-precision, bfloat16, and an 8bit FP format, as well as SIMD down to hardware and circuits which offer many knobs to vectors and multi-format operations. Integrated into a 32-bit fine-tune workloads. RISC-V core, our TP-FPU can speed up execution of mixed- The most flexible and dynamic way of performing nu- precision applications by 1.67x w.r.t.
    [Show full text]
  • Bit Slicing Repetitive Logic
    Bit Slicing Repetitive Logic Where logic blocks are duplicated within a system, there is much to gain from optimization. • Optimize single block for size. The effect is amplified by the number of identical blocks. • Optimize interconnect. With careful design, the requirement for routing channels between the blocks can be eliminated. Interconnection is by butting in 2 dimensions. 4001 Bit Slicing Instead of creating an ALU function by function, we create it slice by slice. A[7:0] B[7:0] A[7] B[7] A[0] B[0] Z[7] Z[7:0] Z[0] • Each bit slice is a full 1-bit ALU. • N are used to create an N–bit ALU. 4002 Bit Slicing FnAND FnOR FnXOR FnADD FnSHR FnSHL Cout SHRin A Z FA B A Cin A SHLin Z= A&B Z= A|B Z= A!=B Z= A+B Z= A>>1 Z= A<<1 • Simple 1–bit ALU. • The control lines select which function of A and B is fed to Z. • Some functions, e.g. Add, require extra data I/O. 4003 Bit Slicing FnAND FnAND Z Z Vdd GND B B A A • Data busses horizontal, control lines vertical. • Compact gate matrix implementation1. 1bit slice designs can also be built around standard cells although the full custom approach used here gives better results 4004 • Bit Sliced ALU (3-bits, scalable). CarryOut ShiftRightIn ShiftLeftOut FnAND FnOR FnXOR FnAdd FnSHR FnSHL Cout SHRin A Z[2] FA B[2] A[2] Cin A SHLin Cout SHRin A Z[1] FA B[1] A[1] Cin A SHLin Cout SHRin A Z[0] FA B[0] A[0] Cin A SHLin CarryIn ShiftRightOut ShiftLeftIn 4005 Bit Slicing We can extend this principle to the whole datapath.
    [Show full text]
  • Formally Verified Big Step Semantics out of X86-64 Binaries
    Formally Verified Big Step Semantics out of x86-64 Binaries Ian Roessle Freek Verbeek Binoy Ravindran Virginia Tech, USA Virginia Tech, USA Virginia Tech, USA [email protected] [email protected] [email protected] Abstract or systems where source code is unavailable due to propri- This paper presents a methodology for generating formally etary reasons. Various safety-critical systems in automotive, proven equivalence theorems between decompiled x86-64 aerospace, medical and military domains are built out of machine code and big step semantics. These proofs are built components where the source code is not available [38]. on top of two additional contributions. First, a robust and In such a context, certification plays a crucial role. Certi- tested formal x86-64 machine model containing small step fication can require a compliance proof based on formal semantics for 1625 instructions. Second, a decompilation- methods [32, 41]. Bottom-up formal verification can aid in into-logic methodology supporting both x86-64 assembly obtaining high levels of assurance for black-box components and machine code at large scale. This work enables black- running on commodity hardware, such as x86-64. box binary verification, i.e., formal verification of a binary A binary typically consists of blocks composed by control where source code is unavailable. As such, it can be applied flow. In this paper, a block is defined as a sequence of instruc- to safety-critical systems that consist of legacy components, tions that can be modeled with only if-then-else statements or components whose source code is unavailable due to (no loops).
    [Show full text]
  • Study of the Posit Number System: a Practical Approach
    STUDY OF THE POSIT NUMBER SYSTEM: A PRACTICAL APPROACH Raúl Murillo Montero DOBLE GRADO EN INGENIERÍA INFORMÁTICA – MATEMÁTICAS FACULTAD DE INFORMÁTICA UNIVERSIDAD COMPLUTENSE DE MADRID Trabajo Fin Grado en Ingeniería Informática – Matemáticas Curso 2018-2019 Directores: Alberto Antonio del Barrio García Guillermo Botella Juan Este documento está preparado para ser imprimido a doble cara. STUDY OF THE POSIT NUMBER SYSTEM: A PRACTICAL APPROACH Raúl Murillo Montero DOUBLE DEGREE IN COMPUTER SCIENCE – MATHEMATICS FACULTY OF COMPUTER SCIENCE COMPLUTENSE UNIVERSITY OF MADRID Bachelor’s Degree Final Project in Computer Science – Mathematics Academic year 2018-2019 Directors: Alberto Antonio del Barrio García Guillermo Botella Juan To me, mathematics, computer science, and the arts are insanely related. They’re all creative expressions. Sebastian Thrun Acknowledgements I have to start by thanking Alberto Antonio del Barrio García and Guillermo Botella Juan, the directors of this amazing project. Thank you for this opportunity, for your support, your help and for trusting me. Without you any of this would have ever been possible. Thanks to my family, who has always supported me and taught me that I am only limited by the limits I choose to put on myself. Finally, thanks to all of you who have accompanied me on this 5 year journey. Sharing classes, exams, comings and goings between the two faculties with you has been a wonderful experience I will always remember. vii Abstract The IEEE Standard for Floating-Point Arithmetic (IEEE 754) has been for decades the standard for floating-point arithmetic and is implemented in a vast majority of modern computer systems.
    [Show full text]
  • SSE Implementation of Multivariate Pkcs on Modern X86 Cpus
    SSE Implementation of Multivariate PKCs on Modern x86 CPUs Anna Inn-Tung Chen1, Ming-Shing Chen2, Tien-Ren Chen2, Chen-Mou Cheng1, Jintai Ding3, Eric Li-Hsiang Kuo2, Frost Yu-Shuang Lee1, and Bo-Yin Yang2 1 National Taiwan University, Taipei, Taiwan {anna1110,doug,frost}@crypto.tw 2 Academia Sinica, Taipei, Taiwan {mschen,trchen1103,lorderic,by}@crypto.tw 3 University of Cincinnati, Cincinnati, Ohio, USA [email protected] Abstract. Multivariate Public Key Cryptosystems (MPKCs) are often touted as future-proofing against Quantum Computers. It also has been known for efficiency compared to “traditional” alternatives. However, this advantage seems to erode with the increase of arithmetic resources in modern CPUs and improved algorithms, especially with respect to El- liptic Curve Cryptography (ECC). In this paper, we show that hard- ware advances do not just favor ECC. Modern commodity CPUs also have many small integer arithmetic/logic resources, embodied by SSE2 or other vector instruction sets, that are useful for MPKCs. In partic- ular, Intel’s SSSE3 instructions can speed up both public and private maps over prior software implementations of Rainbow-type systems up to 4×.Furthermore,MPKCs over fields of relatively small odd prime characteristics can exploit SSE2 instructions, supported by most mod- ern 64-bit Intel and AMD CPUs. For example, Rainbow over F31 can be up to 2× faster than prior implementations of similarly-sized systems over F16. Here a key advance is in using Wiedemann (as opposed to Gauss) solvers to invert the small linear systems in the central maps. We explain the techniques and design choices in implementing our chosen MPKC instances over fields such as F31, F16 and F256.
    [Show full text]
  • High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions
    High-Throughput Elliptic Curve Cryptography Using AVX2 Vector Instructions Hao Cheng, Johann Großsch¨adl,Jiaqi Tian, Peter B. Rønne, and Peter Y. A. Ryan DCS and SnT, University of Luxembourg 6, Avenue de la Fonte, L{4364 Esch-sur-Alzette, Luxembourg {hao.cheng,johann.groszschaedl,peter.roenne,peter.ryan}@uni.lu [email protected] Abstract. Single Instruction Multiple Data (SIMD) execution engines like Intel's Advanced Vector Extensions 2 (AVX2) offer a great potential to accelerate elliptic curve cryptography compared to implementations using only basic x64 instructions. All existing AVX2 implementations of scalar multiplication on e.g. Curve25519 (and alternative curves) are optimized for low latency. We argue in this paper that many real-world applications, such as server-side SSL/TLS handshake processing, would benefit more from throughput-optimized implementations than latency- optimized ones. To support this argument, we introduce a throughput- optimized AVX2 implementation of variable-base scalar multiplication on Curve25519 and fixed-base scalar multiplication on Ed25519. Both implementations perform four scalar multiplications in parallel, where each uses a 64-bit element of a 256-bit vector. The field arithmetic is based on a radix-229 representation of the field elements, which makes it possible to carry out four parallel multiplications modulo a multiple of p = 2255 − 19 in just 88 cycles on a Skylake CPU. Four variable-base scalar multiplications on Curve25519 require less than 250;000 Skylake cycles, which translates to a throughput of 32;318 scalar multiplications per second at a clock frequency of 2 GHz. For comparison, the to-date best latency-optimized AVX2 implementation has a throughput of some 21;000 scalar multiplications per second on the same Skylake CPU.
    [Show full text]
  • Floating-Point Formats.Pdf
    [Next] [Up/Previous] mrob Numbers Largenum Sequences Mandelbrot Men Core Values Search: • n particular: 0 00000000 00000000000000000000000 = 0 0 00000000 00000000000000000000001 = +1 * 2( -126) * 0.000000000000000000000012 = 2(-149) (Smallest positive value) ( -126) 0 00000000 10000000000000000000000 = +1 * 2 * 0.12 = 2**(-127) ( 1-127) 0 00000001 00000000000000000000000 = +1 * 2 * 1.02 = 2**(-126) (128-127) 0 10000000 00000000000000000000000 = +1 * 2 * 1.02 = 2 1 0 0 1 .5 .5 2^1 (129-127) 0 10000001 10100000000000000000000 = +1 * 2 * 1.1012 = 6.5 1.10 1 1 0 1 1 .5 .25 .125 1.624*2^2= 6.5 0 11111110 11111111111111111111111 = +1 * 2(254-127) * 1.111111111111111111111112 (Most positive finite value) 0 11111111 00000000000000000000000 = Infinity 0 11111111 00000100000000000000000 = NaN 1 00000000 00000000000000000000000 = -0 (128-127) 1 10000000 00000000000000000000000 = -1 * 2 * 1.02 = -2 (129-127) 1 10000001 10100000000000000000000 = -1 * 2 * 1.1012 = -6.5 1 11111110 11111111111111111111111 = -1 * 2(254-127) * 1.111111111111111111111112 (Most negative finite value) 1 11111111 00000000000000000000000 = -Infinity 1 11111111 00100010001001010101010 = NaNSearch • Site Map About PSC Contacts Employment RSS Feed PITTSBURGH SUPERCOMPUTING CENTER PSC Users Outreach & Training Services Research News Center Floating Point Introduction Int and unsigned int are approximations to the set of integers and the set of natural numbers. Unlike int and unsigned, the set of integers and the set of natural numbers is infinite. Because the set of int is finite, there is a maximum int and a minimum int. Ints are also contiguous. That is, between the minimum and maximum int, there are no missing values. To summarize: • The set of valid ints is finite.
    [Show full text]