DOCSLIB.ORG

Authentication and Key Agreement Via Memorable Password

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Authentication and Key Agreement Via Memorable Password Authentication and Key Agreement via Memorable Password Taekyoung Kwon University of California, Berkeley [email protected] or [email protected] Up dated on August 20, 2000 Preliminary Version 2.51 since May 1, 2000 Abstract This pap er presents a new password authentication and key agreement proto col, AMP, based on the ampli ed password idea. The intrinsic problems with password authentica- tion are the password itself has lowentropy and the password le is very hard to protect. Wepresent the ampli ed password pro of and the ampli ed password le for solving these problems. A party commits the high entropy information and ampli es her password with that information in the amplifed password pro of. She never shows any informa- tion except that she knows it. Our ampli ed password pro of idea is very similar to the zero-knowledge pro of in that sense. We adds one more idea; the ampli ed password le for password le protection. Aserver stores the ampli ed veri ers in the ampli ed password le that is secure against a server le compromise and a dictionary attack. AMP mainly provides the password-veri er based authentication and the Die-Hellman based key agreement, securely and eciently. AMP is easy to generalize in any other cyclic groups. In spite of those plentiful prop erties, AMP is actually the most ecient proto col among the related proto cols due to the simultaneous multiple exp onentiation i n n+ + ++ c metho d. Several variants such as AMP ,AMP ,AMP , AMP ,AMP , and AMP n are also prop osed. Among them, AMP is actually the basic proto col of this pap er that describ es the ampli ed password pro of idea while AMP is the most complete proto col i that adds the ampli ed password le. AMP simply removes the ampli ed password le from AMP.Intheend,we give a comparison to the related proto cols in terms of eciency. This manuscript is a preliminary version of our pap er available from the IACR eprint archive, http://eprint.iacr.org/2000/026. The proto cols describ ed in this pap er were submitted as a contribution to the IEEE P1363 study group for future PKC standards, Ultimate Solution to Authentication via Memorable Password[23 ]. It is available from the website, http://grouper.ieee.org/groups/1363/StudyGroup/Passwd.html#amp. Keywords: Authentication, key agreement, password guessing, password veri er, public- key cryptography, discrete logarithm problem, Die-Hellman problem, ampli ed pass- word pro of, ampli ed password le. 1 1 Intro duction Entity authentication is one of the most imp ortant security functions. It is necessary for verifying the identities of the communicating parties when they initiate their connection. This function is usually provided in combination with a key establishment scheme such as key transp ort or key agreement between the parties. For user authentication, three kinds of approaches exist; knowledge-based authentication, token-based authentication,andbiometric authentication. Among them, the knowledge-based scheme is for human memory ( mind). Actually, it is the most widely-used metho d due to such advantages as simplicity,convenience, adaptability, mobility, and less hardware requirement. It requires users only to remember and typ e in their knowledge such as a password or PIN(p ersonal identi cation number). Therefore, users are allowed to move conveniently without carrying hardware tokens. How- ever, a complex problem with this password-only authentication is that a human-memorable password has lowentropy so that it could b e vulnerable to malicious guessing attacks. The problem b ecomes much more critical in an op en distributed environment. Moreover, pass- word le protection is another problem that makes password authentication more unreliable. If a password le is compromised, at least it is vulnerable to dictionary attacks. A cryp- tographic proto col based on public-key cryptography is the most promising solution to this problem. 1 Password Protocols. Since the rst scheme, LGSN[25 ], was intro duced in 1989, many proto cols have followed it. Among them, EKE[7] was a great landmark of certi cate-free proto cols. One variant of EKE, DH-EKE[7 ], intro duced the password authentication and key agreement, and was \enhanced" to A-EKE[8 ] that was the rst veri er-based proto col to resist a password- le compromise and to accommo date salt while there was an earlier work describing the use of salt[38 ]. GLNS[15 ] was enhanced from LGSN. Due to the ineciency and constraints of older schemes, various mo di cations and improvements have followed. They include TH[37 ], AL[1 ], M-EKE[36 ], Gong[16 ], KS[21], SPEKE[18, 19 ], S3P[34 ], SRP[39 ], HK[17 ], and GXY[22 ]. However, some of them have been broken and some are still b eing cryptanalyzed[2 , 13 , 31 , 9 ]; most were inadequate for the security pro of due to ad-ho c meth- o ds of protecting the password. In the mean time, OKE[26 ] intro duced a provable approach and was followed by several great work such as SNAPI[27 ], EKE2[5], AuthA[6], and PAK[10 ]. They show the provable approach in this area is getting matured. Among the password proto cols, A-EKE, B-SPEKE, SRP, GXY, SNAPI-X, AuthA, and PAK-X are classi ed as password-veri er based proto cols[8 , 19 , 39 , 22 , 27 , 6, 10 ]. They allow the asymmetric mo del in which a client p ossesses a password, while a server stores its veri er rather than the password. Following A-EKE[8 ], B-SPEKE was augmented from SPEKE[18, 1 Readers are referred to Figure 8 attached in App endix of this do cument. Jablon's work[18 ] is recommended as the b est tutorial for the password proto col study while Wu's work[39 ] is the b est for the veri er proto col study. Bellare and Rogaway's work[3 ] is the fundamental of the provable approach. 2 19 ]. SRP showed ecientwork on a veri er and GXY was derived from SRP[39, 22]. SNAPI- X was augmented from SNAPI while PAK-X was enhanced from PAK[27 , 10 ]. AuthA was derived from several previous proto cols but strongly studies a provable approach[6 ]. How- ever, even the veri er-based proto cols still allow dictionary attacks and server imp ersonation attacks if a server le is compromised. Currently, standardization work on this eld is b eing considered in IEEE P1363 group. Contribution. Our goal is to design a new proto col in a provable manner, which com- bines the following functions securely and eciently. Password(-veri er) based authentication[8 ] Die-Hellman based key agreement[12 ] Easy generalization[28 ] Password le protection For achieving the goal, we prop ose two simple ideas called the ampli ed password pro of that makes a user amplify her password and prove to know the ampli ed password, and the ampli ed password le that makes a server store the ampli ed veri er for resisting a server le compromise and a dictionary attack. From the p ointofview,we name our proto col AMP that stands for Authentication and key agreement via Memorable Password. Regarding several i n functional issues, we also present ma jor variants of AMP. They are called AMP , AMP , n+ + ++ c n AMP , AMP , AMP , and AMP . Among them, AMP is actually the basic proto col of this pap er that describ es the ampli ed password pro of idea though it is designed for a symmetric setup. Several minor variants also can be considered but they are explained implicitly. We compare the eciency of all veri er-based proto cols. Actually, AMP is the most ecient proto cols among the existing veri er-based proto cols. Note that AMP will b e designed to avoid explicit encryption/decryption at least for authentication and veri cation though it will provide a key agreement function. 2 AMP Proto col Design 2.1 Preliminaries AMP is typically the twoparty case so that we use Al ice and Bob for describing a clientand a server, resp ectively. Eve indicates an adversary whether she is passive or active. and : denotes password and salt, resp ectively. = means a comparison of two terms, for example, : 1 = . Let f0; 1g denote the set of nite binary strings and f0; 1g the set of in nite ones. implies the empty string. k is our securityparameter long enough to prevent brute-forcing 2 1 l (k ) while l (k ) 2k , ! (k ) k , and t(k ) k . h() : f0; 1g !f0; 1g means a collision-free 3 3 3 one-way hash function. All hash functions are assumed to behave like random oracles for security pro of[3]. Note we abbreviate a mo dular notation, mo d p, for convenience hereafter. l (k ) Random Oracle. We assume random oracles h () : f0; 1g ! f0; 1g for i 2 [1; 5]. i If Eve sends queries Q ; Q ; Q ; ::: to the random oracle h , she can receive answers h (Q ), 1 2 3 i i j all indep endently random values, from the oracle. Let h() denote a real world hash function. For practical recoveries of random oracles in the real world, we de ne; h (x) = h(00jxj00), 1 h (x)=h(01jxj01), h (x)=h(01jxj10), h (x)=h(10jxj10) and h (x)=h(11jxj11) by follow- 2 3 4 5 ing the constructions given in the Bellare and Rogaway's work[3 ]. j denotes the concatenation. Numerical Assumption. Security of AMP is based on two familiar hard problems which are b elieved infeasible to solve in p olynomial time.
Load more

Recommended publications
  • Efficient Implementation of Elliptic Curve Cryptography in Reconfigurable Hardware
    EFFICIENT IMPLEMENTATION OF ELLIPTIC CURVE CRYPTOGRAPHY IN RECONFIGURABLE HARDWARE by E-JEN LIEN Submitted in partial fulfillment of the requirements for the degree of Master of Science Thesis Advisor: Dr. Swarup Bhunia Department of Electrical Engineering and Computer Science CASE WESTERN RESERVE UNIVERSITY May, 2012 CASE WESTERN RESERVE UNIVERSITY SCHOOL OF GRADUATE STUDIES We hereby approve the thesis/dissertation of _____________________________________________________E-Jen Lien candidate for the ______________________degreeMaster of Science *. Swarup Bhunia (signed)_______________________________________________ (chair of the committee) Christos Papachristou ________________________________________________ Frank Merat ________________________________________________ ________________________________________________ ________________________________________________ ________________________________________________ (date) _______________________03/19/2012 *We also certify that written approval has been obtained for any proprietary material contained therein. To my family ⋯ Contents List of Tables iii List of Figures v Acknowledgements vi List of Abbreviations vii Abstract viii 1 Introduction 1 1.1 Research objectives . .1 1.2 Thesis Outline . .3 1.3 Contributions . .4 2 Background and Motivation 6 2.1 MBC Architecture . .6 2.2 Application Mapping to MBC . .7 2.3 FPGA . .9 2.4 Mathematical Preliminary . 10 2.5 Elliptic Curve Cryptography . 10 2.6 Motivation . 16 i 3 Design Principles and Methodology 18 3.1 Curves over Prime Field . 18 3.2 Curves over Binary Field . 25 3.3 Software Code for ECC . 31 3.4 RTL code for FPGA design . 31 3.5 Input Data Flow Graph (DFG) for MBC . 31 4 Implementation of ECC 32 4.1 Software Implementation . 32 4.1.1 Prime Field . 33 4.1.2 Binary Field . 34 4.2 Implementation in FPGA . 35 4.2.1 Prime Field . 36 4.2.2 Binary Field .
    [Show full text]
  • A High-Speed Constant-Time Hardware Implementation of Ntruencrypt SVES
    A High-Speed Constant-Time Hardware Implementation of NTRUEncrypt SVES Farnoud Farahmand, Malik Umar Sharif, Kevin Briggs, Kris Gaj Department of Electrical and Computer Engineering, George Mason University, Fairfax, VA, U.S.A. fffarahma, msharif2, kbriggs2, [email protected] process a year later. Among the candidates, there are new, Abstract—In this paper, we present a high-speed constant- substantially modified versions of NTRUEncrypt. However, in time hardware implementation of NTRUEncrypt Short Vector an attempt to characterize an already standardized algorithm, Encryption Scheme (SVES), fully compliant with the IEEE 1363.1 Standard Specification for Public Key Cryptographic Techniques in this paper, we focus on the still unbroken version of the Based on Hard Problems over Lattices. Our implementation algorithm published in 2008. We are not aware of any previous follows an earlier proposed Post-Quantum Cryptography (PQC) high-speed hardware implementation of the entire NTRUEn- Hardware Application Programming Interface (API), which crypt SVES scheme reported in the scientific literature or facilitates its fair comparison with implementations of other available commercially. Our implementation is also unique in PQC schemes. The paper contains the detailed flow and block diagrams, timing analysis, as well as results in terms of latency (in that it is the first implementation of any PQC scheme following clock cycles), maximum clock frequency, and resource utilization our newly proposed PQC Hardware API [3]. As such, it in modern high-performance Field Programmable Gate Arrays provides a valuable reference for any future implementers of (FPGAs). Our design takes full advantage of the ability to paral- PQC schemes, which is very important in the context of the lelize the major operation of NTRU, polynomial multiplication, in ongoing NIST standard candidate evaluation process.
    [Show full text]
  • FIDO Technical Glossary
    Client to Authenticator Protocol (CTAP) Implementation Draft, February 27, 2018 This version: https://fidoalliance.org/specs/fido-v2.0-id-20180227/fido-client-to-authenticator-protocol-v2.0-id- 20180227.html Previous Versions: https://fidoalliance.org/specs/fido-v2.0-ps-20170927/ Issue Tracking: GitHub Editors: Christiaan Brand (Google) Alexei Czeskis (Google) Jakob Ehrensvärd (Yubico) Michael B. Jones (Microsoft) Akshay Kumar (Microsoft) Rolf Lindemann (Nok Nok Labs) Adam Powers (FIDO Alliance) Johan Verrept (VASCO Data Security) Former Editors: Matthieu Antoine (Gemalto) Vijay Bharadwaj (Microsoft) Mirko J. Ploch (SurePassID) Contributors: Jeff Hodges (PayPal) Copyright © 2018 FIDO Alliance. All Rights Reserved. Abstract This specification describes an application layer protocol for communication between a roaming authenticator and another client/platform, as well as bindings of this application protocol to a variety of transport protocols using different physical media. The application layer protocol defines requirements for such transport protocols. Each transport binding defines the details of how such transport layer connections should be set up, in a manner that meets the requirements of the application layer protocol. Table of Contents 1 Introduction 1.1 Relationship to Other Specifications 2 Conformance 3 Protocol Structure 4 Protocol Overview 5 Authenticator API 5.1 authenticatorMakeCredential (0x01) 5.2 authenticatorGetAssertion (0x02) 5.3 authenticatorGetNextAssertion (0x08) 5.3.1 Client Logic 5.4 authenticatorGetInfo (0x04)
    [Show full text]
  • White-Box Implementation of the Identity-Based Signature Scheme in the IEEE P1363 Standard for Public Key Cryptography
    IEICE TRANS. INF. & SYST., VOL.E103–D, NO.2 FEBRUARY 2020 188 INVITED PAPER Special Section on Security, Privacy, Anonymity and Trust in Cyberspace Computing and Communications White-Box Implementation of the Identity-Based Signature Scheme in the IEEE P1363 Standard for Public Key Cryptography Yudi ZHANG†,††, Debiao HE†,††a), Xinyi HUANG†††,††††, Ding WANG††,†††††, Kim-Kwang Raymond CHOO††††††, Nonmembers, and Jing WANG†,††, Student Member SUMMARY Unlike black-box cryptography, an adversary in a white- box security model has full access to the implementation of the crypto- graphic algorithm. Thus, white-box implementation of cryptographic algo- rithms is more practical. Nevertheless, in recent years, there is no white- box implementation for public key cryptography. In this paper, we propose Fig. 1 A typical DRM architecture the first white-box implementation of the identity-based signature scheme in the IEEE P1363 standard. Our main idea is to hide the private key to multiple lookup tables, so that the private key cannot be leaked during the algorithm executed in the untrusted environment. We prove its security in both black-box and white-box models. We also evaluate the performance gram. However, the adversary does not have the permis- of our white-box implementations, in order to demonstrate utility for real- sion to access the internal process of the program’s execu- world applications. tion. In practice, an adversary can also observe and mod- key words: white-box implementation, white-box security, IEEE P1363, ify the algorithm’s implementation to obtain the internal de- identity-based signature, key extraction tails, such as the secret key.
    [Show full text]
  • IEEE P1363.3 Standard Specifications for Public Key Cryptography
    IEEE P1363.3 D1 IBKAS January 29, 2008 IEEE P1363.3 Standard Specifications for Public Key Cryptography: Identity Based Key Agreement Scheme (IBKAS) Abstract. This document specifies pairing based, identity based, and authenticated key agreement techniques. One of the advantages of Identity Based key agreement techniques is that there is no public key transmission and verification needed. Contents 1. DEFINITIONS ......................................................................................................................................... 2 2. TYPES OF CRYPTOGRAPHIC TECHNIQUES ................................................................................ 2 2.1 GENERAL MODEL .................................................................................................................................. 2 2.2 PRIMITIVES............................................................................................................................................ 2 2.3 SCHEMES ............................................................................................................................................... 3 2.4 ADDITIONAL METHODS ......................................................................................................................... 3 2.5 TABLE SUMMARY.................................................................................................................................. 3 3. PRIMITIVES FOR IDENTITY BASED KEY AGREEMENT PROBLEM...................................... 4 3.1 PRIMITIVES BORROWED FROM
    [Show full text]
  • IEEE P1363.2: Password-Based Cryptography
    IEEE P1363.2: Password-based Cryptography David Jablon CTO, Phoenix Technologies NIST PKI TWG - July 30, 2003 What is IEEE P1363.2? • “Standard Specification for Password-Based Public-Key Cryptographic Techniques” • Proposed standard • Companion to IEEE Std 1363-2000 • Product of P1363 Working Group • Open standards process PKI TWG July 2003 IEEE P1363.2: Password-based Cryptography 2 One of several IEEE 1363 standards • Std 1363-2000 • Sign, Encrypt, Key agreem’t, using IF, DL, & EC families • P1363a • Same goals & families as 1363-2000 • P1363.1: Lattice family • Same goals as 1363-2000, Different family • P1363.2: Password-based • Same families • More ambitious goals PKI TWG July 2003 IEEE P1363.2: Password-based Cryptography 3 Scope of P1363.2 • Modern “zero knowledge” password methods • Uses public key techniques • Uses two or more parties • Needs no other infrastructure • Authenticated key establishment • Resists attack on low-grade secrets • passwords, password-derived keys, PINs, ... PKI TWG July 2003 IEEE P1363.2: Password-based Cryptography 4 Rationale (1) • Why low-grade secrets? • People have trouble with high-grade keys • storage -- memorizing • input -- attention to detail • output -- typing • Passwords are ubiquitous • Easy for people to memorize, recognize, and type. • Reduce security/convenience tradeoffs. PKI TWG July 2003 IEEE P1363.2: Password-based Cryptography 5 Rationale (2) • Why use public-key techniques? • Symmetric methods can’t do it. • Why new methods? • Different than symmetric, hash, or other PK crypto. • AES, SHA-1, DH, and RSA can’t do it alone. PKI TWG July 2003 IEEE P1363.2: Password-based Cryptography 6 Chosen Password Quality Summarized from Distribution Morris & Thompson ‘79, Klein ‘90, Spafford ‘92 0 30 or so 60 or so Password Entropy (bits) History of protocols that fail to dictionary attack (or worse) • Clear text password π • Password as a key Eπ (verifiable text) • (e.g.
    [Show full text]
  • The Martini Synch
    The Martini Synch Darko Kirovski, Michael Sinclair, and David Wilson Microsoft Research Contact: {darkok,sinclair,dbwilson}@microsoft.com Technical Report MSR-TR-2007-123 September 2007 Microsoft Research One Microsoft Way Redmond, WA 98052, USA http://research.microsoft.com The Martini Synch Darko Kirovski, Michael Sinclair, and David Wilson Microsoft Research Abstract. Device pairing is a significant problem for a large class of increasingly popular resource-constrained wireless protocols such as BlueTooth. The objective of pairing is to establish a secure wireless communication channel between two specific devices without a public-key infrastructure, a secure near-field communi- cation channel, or electrical contact. We use a surprising user-device interaction as a solution to this problem. By adding an accelerometer, a device can sense its motion in a Cartesian space relative to the inertial space. The idea is to have two devices in a fixed, relative position to each other. Then, the joint object is moved randomly in 3D for several seconds. The unique motion generates approximately the same distinct signal at the accelerometers. The difference between the signals in the two inertially conjoined sensors should be relatively small under normal motion induced manually. The objective is to derive a deterministic key at both sides with maximized entropy that will be used as a private key for symmetric encryption. Currently, our prototype produces between 10–15 bits of entropy per second of usual manual motion using off-the-shelf components. Keywords: device pairing, key exchange, fuzzy hashing, error correction. 1 INTRODUCTION Establishing a secure session is one of the least efficiently resolved problems with mod- ern low-cost wireless protocols such as BlueTooth [1].
    [Show full text]
  • A Low-Power Design for an Elliptic Curve Digital Signature Chip
    A Low-Power Design for an Elliptic Curve Digital Signature Chip Richard Schroeppel, Cheryl Beaver, Rita Gonzales, Russell Miller, and Timothy Draelos Sandia National Laboratories Albuquerque, NM 87185-0785 {rschroe, cbeaver, ragonza, rdmille, tjdrael}@sandia.gov Abstract. We present a VHDL design that incorporates optimizations intended to provide digital signature generation with as little power, space, and time as possible. These three primary objectives of power, size, and speed must be balanced along with other important goals, including flexibility of the hardware and ease of use. The highest-level function offered by our hardware design is Elliptic Curve Optimal El Gamal digital signature generation. Our parameters are defined over the finite field GF (2178), which gives security that is roughly equivalent to that provided by 1500-bit RSA signatures. Our optimizations include using the point-halving algorithm for elliptic curves, field towers to speed up the finite field arithmetic in general, and further enhancements of basic finite field arithmetic operations. The result is a synthesized VHDL digital signature design (using a CMOS 0.5µm,5V ,25◦C library) of 191,000 gates that generates a signature in 4.4 ms at 20 MHz. Keywords: Digital Signature, Elliptic Curve, ECDSA, Optimal El Gamal, Characteristic 2, Field Towers, Trinomial Basis, Quadratic Equa- tion, Qsolve, Almost-Inverse Algorithm, Point Halving, Signed Sliding Window, GF(289), GF(2178), Hardware, VHDL, Low Power 1 Introduction While the value of elliptic curve arithmetic in enabling public-key cryptography to serve in resource-constrained environments is well accepted, efforts in cre- ative implementations continue to bear fruit.
    [Show full text]
  • FPGA Implementation of Post-Quantum Cryptography Recommended by NIST
    University of Windsor Scholarship at UWindsor Electronic Theses and Dissertations Theses, Dissertations, and Major Papers 3-10-2021 FPGA Implementation of Post-Quantum Cryptography Recommended by NIST Xi Gao University of Windsor Follow this and additional works at: https://scholar.uwindsor.ca/etd Recommended Citation Gao, Xi, "FPGA Implementation of Post-Quantum Cryptography Recommended by NIST" (2021). Electronic Theses and Dissertations. 8556. https://scholar.uwindsor.ca/etd/8556 This online database contains the full-text of PhD dissertations and Masters’ theses of University of Windsor students from 1954 forward. These documents are made available for personal study and research purposes only, in accordance with the Canadian Copyright Act and the Creative Commons license—CC BY-NC-ND (Attribution, Non-Commercial, No Derivative Works). Under this license, works must always be attributed to the copyright holder (original author), cannot be used for any commercial purposes, and may not be altered. Any other use would require the permission of the copyright holder. Students may inquire about withdrawing their dissertation and/or thesis from this database. For additional inquiries, please contact the repository administrator via email ([email protected]) or by telephone at 519-253-3000ext. 3208. FPGA Implementation of Post-Quantum Cryptography Recommended by NIST by Xi Gao A Thesis Submitted to the Faculty of Graduate Studies through Electrical and Computer Engineering in Partial Fulfilment of the Requirements for the Degree of Master of Applied Science at the University of Windsor Windsor, Ontario, Canada 2021 © 2021, Xi Gao FPGA Implementation of Post-Quantum Cryptography Recommended by NIST by Xi Gao APPROVED BY: X.
    [Show full text]
  • Hardware Architectures of Elliptic Curve Based Cryptosystems Over Binary Fields
    Hardware Architectures of Elliptic Curve Based Cryptosystems over Binary Fields Chang Shu Doctoral Dissertation Defense Feb. 8, 2007 Advisor: Dr. Kris Gaj Dept. of Electrical & Computer Engineering George Mason University 1 Acknowledgements Dr. Kris Gaj (Dissertation Director) Dr. Soonhak Kwon (Dept. of Mathematics, Sungkyunkwan University, Korea) Dr. Shih-Chun Chang (Committee Member) Dr. Brian L. Mark (Committee Member) Dr. Ravi Sandu (Committer Member) Dr. Andre Manitius (Chair of ECE) Dr. Yariv Ephraim (Ph.D. Coordinator) Dr. Tarek El-Ghazawi (Dept. of ECE at The George Washington University) 2 Overview • Introduction – Elliptic Curve Cryptography – Tate Pairing Based Cryptography • Architectures for Finite Field Arithmetic – Polynomial basis multiplier – Normal basis multiplier – Composite field arithmetic • Architectures for Elliptic Curve Cryptosystems – Optimizations for a single FPGA device – Reconfigurable computing approach • Architectures for Tate Pairing Based Cryptosystems – Optimizations for a single FPGA device – Reconfigurable computing approach • Summary 3 Elliptic Curve Cryptosystems • Family of public key cryptosystems • Invented in 1985 by Miller and Koblitz independently • Used primarily for digital signatures & key exchange • Included in multiple industry, government, and banking standards, such as IEEE p1363, ANSI 9.62, and FIPS 186-2 • Part of standard security protocols, such as IPSec and SSL (proposed extension) 4 Why Elliptic Curve Cryptography ? – ECC vs. RSA Key size comparison: Security Level (bits) 80 112
    [Show full text]
  • Competency Models
    SCIENCE, TECHNOLOGY, ENGINEERING & MATHEMATICS Architectural and Engineering Managers ACCCP Engineering and Technology Alabama Competency Model Architectural and Engineering Managers Code 1 Tier 1: Personal Effectiveness Competencies 1.1 Interpersonal Skills: Displaying the skills to work effectively with others from diverse backgrounds. 1.1.1 Demonstrating sensitivity/empathy 1.1.1.1 Show sincere interest in others and their concerns. 1.1.1.2 Demonstrate sensitivity to the needs and feelings of others. 1.1.1.3 Look for ways to help people and deliver assistance. 1.1.2 Demonstrating insight into behavior Recognize and accurately interpret the communications of others as expressed through various 1.1.2.1 formats (e.g., writing, speech, American Sign Language, computers, etc.). 1.1.2.2 Recognize when relationships with others are strained. 1.1.2.3 Show understanding of others’ behaviors and motives by demonstrating appropriate responses. 1.1.2.4 Demonstrate flexibility for change based on the ideas and actions of others. 1.1.3 Maintaining open relationships 1.1.3.1 Maintain open lines of communication with others. 1.1.3.2 Encourage others to share problems and successes. 1.1.3.3 Establish a high degree of trust and credibility with others. 1.1.4 Respecting diversity 1.1.4.1 Demonstrate respect for coworkers, colleagues, and customers. Interact respectfully and cooperatively with others who are of a different race, culture, or age, or 1.1.4.2 have different abilities, gender, or sexual orientation. Demonstrate sensitivity, flexibility, and open-mindedness when dealing with different values, 1.1.4.3 beliefs, perspectives, customs, or opinions.
    [Show full text]
  • White Blue and Lightnings
    Sirius Microtech LLC Innovative People Connectivity and Interoperability Of Embedded Systems Raja D. Singh http://www.siriusmicrotech.com [email protected] Sirius Microtech LLC Innovative People Little bit about me ● Curious about how things work ● Electronics and Communications Engineer ● Hardware Engineer ● Software, Firmware Architect ● Automation, Machine builder ● Senior Member of IEEE ● Vice Chair of IEEE Computer society, Foothills Section ● Chair of IEEE Consultants Network, Los Angeles ● Founder of Sirius Microtech LLC ● Attitude “Work is for fun” ● Currently working on IoT and LED Lighting applications Sirius Microtech LLC Innovative People Connectivity ● Ability to meaningful Communication ● Information exchange ● Possibility to correct errors ● Repeat reliably Sirius Microtech LLC Innovative People Why network? ● Connected computers serve content ● Contents consumed by other computers ● Consumption by users ● Place to buy my ‘Things’ ● Place of learn about ‘Things’ ● Place to socialize and do fun ‘Things’ ● Place to download ‘Things’ ● Market for personal computers – approximately 5! Sirius Microtech LLC Innovative People A networked device ● What is this ‘Thing’? ● A computing device ● Monitor and Control ● Collect ‘Information’ ● Work with other ‘Things’ ● Embedded system Sirius Microtech LLC Innovative People Embedded system ● Constrained ● Resource strapped ● Headless ● OS, Bare metal ● Battery or Mains powered ● Mostly low power ● Wearable or implantable ● Network connectible Sirius Microtech LLC Innovative
    [Show full text]