DOCSLIB.ORG

Recent Trends in SCADA and Power Factor Compensation on Low Voltage Power Systems for Advanced Smart Grid

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Recent Trends in SCADA and Power Factor Compensation on Low Voltage Power Systems for Advanced Smart Grid International Journal of Recent Development in Engineering and Technology Website: www.ijrdet.com (ISSN 2347-6435(Online) Volume 3, Issue 1, July 2014) Recent Trends in SCADA and Power Factor Compensation on low Voltage Power Systems for Advanced Smart Grid Yahia Bahaa Hassan1, Nabil Litayem2, Mohyi el-din Azzam3 1Department of Computer Technology, Wadi AL Dawaser Technical College, Technical and Vocational Training Corporation, Kingdom of Saudi Arabia 2Computer Science and Information, Salman Bin Abdulaziz University , Wadi College of Arts and Science, Kingdom of Saudi Arabia 3Department of Electrical Engineering, Menya University, Egypt Abstract— This paper presents an extending a smart grid The power factor regulator is designed to optimize the to switched capacitor banks at the low-voltage three-phase control of reactive power compensation. Reactive power four-wire distribution systems. New power factor regulators compensation is achieved by measuring continuously using MSP430 microcontrollers will be proposed instead of the reactive power of the system and then compensated ordinary regulators to be suitable for connecting to the by the switching of capacitor banks. At the end user Supervisory Control and Data Acquisition (SCADA) system that actually has been implemented since 2005 in the Middle connection points, the integrating breaker switched Egypt Electricity Distribution Company(MEEDCO). In capacitor banks into a compact design with the intelligent MEEDCO, there are quite a lot of mounted power factor control unit offers a reliable and affordable reactive power regulators in different locations, but most of these regulators compensation solution for distribution systems. The are far from each other and also far from the control center of benefits of doing so are: MEEDCO's SCADA system. This paper also discusses the (1) Improvement in power factor, which either eliminates suitable technology to communicate the suggested regulators with the control center efficiently and how this will be done in or reduces the demand charges imposed by the utility. the framework of a secure smart grid. (2) Reducing the energy loss in electrical conductors by reducing the required current. Keywords— Data Transfer, MSP430, Smart Grid, SCADA, (3) Maintaining a proper voltage level at the end user for Security. improved productivity of industrial processes. I. INTRODUCTION (4) Releasing of valuable system capacity. Electricity distribution companies own and operate the (5) Increasing the useful life of pieces of distribution infrastructure required to connect customers to the network. equipment. At present, the low-voltage three-phase four-wire (6) Improvements in planning where planning engineers distribution systems are facing the poor power quality can more precisely decide to place additional capacitor problems such as high reactive power burden, unbalanced banks to account for load growth. load excessive neutral current and voltage distortion [1]. For years, many electric utilities have implemented Industrial plants typically present a poor power factor to the SCADA systems for better control [4]. SCADA can incoming utility due to proliferation of diode and thyristor provide information in a real-time environment that rectifiers, induction motors and harmonic rich loads. Low identifies problems as they occur and can take corrective power factor is the predominant problem nowadays [2]. action when assistance is needed [5]. SCADA systems Poor power factor has various consequences such as provide centralized monitoring and control of field devices increased load current, large KVA rating of the equipment, spread over large geographic areas. SCADA systems use a greater conductor size, larger copper loss, poor efficiency, wide variety of networking technologies to enable poor voltage regulation and reduction in equipment life. transmission of field data from field sites to the control Therefore it is necessary to solve the problem of poor centers and of control information from control centers to power factor. To improve the power factor, shunt capacitor field sites. Once field data reaches the control system, banks have been applied in many power distribution software systems provide capabilities to visualize and systems and industrial circuits for reactive power analyze the data. compensation [3]. 156 International Journal of Recent Development in Engineering and Technology Website: www.ijrdet.com (ISSN 2347-6435(Online) Volume 3, Issue 1, July 2014) Based on automated or human-driven analysis, action is Proper monitoring of a process can maintain operations taken as needed such as recording the data, processing at an optimal level by identifying and correcting problems alarms or sending control information back to field sites. before they turn into significant system failures. SCADA Since SCADA had already been in use in most electricity systems are divided into three important components, distribution companies and coupling SCADA systems with namely: the embedded intelligence in the Intelligent Electronic 1- Master station or the control center, which gathers all Devices (IED) can generate a wealth of useful information. relevant data in a system, maintains a database and So, the proposed power factor controller using MSP430 processes commands issued through a human-machine microcontroller (IED)at the end user should be monitored interface by an operator. In complex systems, this and controlled by SCADA technology to get several component may consist of multiple servers running features such as supervision, remote control and remote distributed application software. measurement. The monitored data can be the following: 2- Remote Terminal Units (RTU), is an IED that can be 1. The net interval energy consumption, the local voltage, installed in a remote location and acts as a termination current, power factor, active power and reactive power. point for field contacts. The RTU can transfer collected 2. Status of a power factor controller (open or closed data to other devices and receive data and control switch) commands from other devices. 3. The time the data are collected and recorded. 3- Communication infrastructure, is used to transport Therefore, the extension of intelligent control over information between the control center and field sites via electrical power grid functions to the distribution layer and communication mediums such as telephone line, cable, beyond (via distribution automation) is a key enabler for fiber and radio frequency such as broadcast, microwave smart grid success. Smart grid is developing a more and satellite. sophisticated electricity delivery infrastructure that requires SCADA obtains and processes the information issuing embedding intelligence and communications at every node from dispersed equipment in remote locations. It then sends of the electric-power delivery system. Extending a smart this information to the operations control center. The grid network to power factor controller at the end user SCADA simultaneously supervises and controls processes results in improvements in grid reliability, visibility into and installations located throughout large areas, generating critical load information, asset management, reduced a set of processed information such as trend graphs, operations and maintenance costs and also results in historical information, operating reports and event improvements in customer satisfaction. The rest of the programming among others. By implementing SCADA in paper is organized as follows. Section 2 introduces a the automation process, users can learn the status of the background for the SCADA system, smart grid and installations under their responsibility and coordinate, in an MSP430 microcontroller. Section 3 shows the proposed efficient manner, the detection of errors and anomalies in strategy to embed the reactive power compensation systems the electric grid. SCAD also allows users to execute into MEEDCO's SCADA system. maneuvers to reestablish service , carry out maintenance in the field , supervise and control critical operations and II. BACKGROUND receive information in a dynamic manner and in real time A. SCADA systems for its ulterior processing. With the fast development of computer application B. Smart grid technology, SCADA system is widely used in industry It is a common belief that the energy, control and field, especially in a power system where SCADA is communications technologies have reached the level of developing speedily [6]. SCADA is a smart grid maturity which is sufficient to put forward a new power distribution application providing the process control utility shift known as the smart grid [9]. Huge and strong systems that enable computerized management of interests on a smart grid have increased extensively in distribution grid elements [7]. The main purpose of recent years around the world. A smart grid is a complex SCADA is gathering real-time data, monitoring and distributed infrastructure composed of a set of domains and controlling equipments and processes in the critical stakeholders. infrastructures [8]. 157 International Journal of Recent Development in Engineering and Technology Website: www.ijrdet.com (ISSN 2347-6435(Online) Volume 3, Issue 1, July 2014) According to the conceptual model of the National The utilization of these Microcontroller Unit (MCU) Institute of Standards and Technology (NIST), these becomes too broad due to the introduction of new domains correspond to customers, markets, providers, innovative features apart from
Load more

Recommended publications
  • Downloaded on 2017-02-12T13:16:07Z HARDWARE DESIGNOF CRYPTOGRAPHIC ACCELERATORS
    Title Hardware design of cryptographic accelerators Author(s) Baldwin, Brian John Publication date 2013 Original citation Baldwin, B.J., 2013. Hardware design of cryptographic accelerators. PhD Thesis, University College Cork. Type of publication Doctoral thesis Rights © 2013. Brian J. Baldwin http://creativecommons.org/licenses/by-nc-nd/3.0/ Embargo information No embargo required Item downloaded http://hdl.handle.net/10468/1112 from Downloaded on 2017-02-12T13:16:07Z HARDWARE DESIGN OF CRYPTOGRAPHIC ACCELERATORS by BRIAN BALDWIN Thesis submitted for the degree of PHD from the Department of Electrical Engineering National University of Ireland University College, Cork, Ireland May 7, 2013 Supervisor: Dr. William P. Marnane “What I cannot create, I do not understand” - Richard Feynman; on his blackboard at time of death in 1988. Contents 1 Introduction 1 1.1 Motivation...................................... 1 1.2 ThesisAims..................................... 3 1.3 ThesisOutline................................... 6 2 Background 9 2.1 Introduction.................................... 9 2.2 IntroductiontoCryptography. ...... 10 2.3 MathematicalBackground . ... 13 2.3.1 Groups ................................... 13 2.3.2 Rings .................................... 14 2.3.3 Fields.................................... 15 2.3.4 FiniteFields ................................ 16 2.4 EllipticCurves .................................. 17 2.4.1 TheGroupLaw............................... 18 2.4.2 EllipticCurvesoverPrimeFields . .... 19 2.5 CryptographicPrimitives&Protocols
    [Show full text]
  • Características Y Aplicaciones De Las Funciones Resumen Criptográficas En La Gestión De Contraseñas
    Características y aplicaciones de las funciones resumen criptográficas en la gestión de contraseñas Alicia Lorena Andrade Bazurto Instituto Universitario de Investigación en Informática Escuela Politécnica Superior Características y aplicaciones de las funciones resumen criptográficas en la gestión de contraseñas ALICIA LORENA ANDRADE BAZURTO Tesis presentada para aspirar al grado de DOCTORA POR LA UNIVERSIDAD DE ALICANTE DOCTORADO EN INFORMÁTICA Dirigida por: Dr. Rafael I. Álvarez Sánchez Alicante, julio 2019 Índice Índice de tablas .................................................................................................................. vii Índice de figuras ................................................................................................................. ix Agradecimiento .................................................................................................................. xi Resumen .......................................................................................................................... xiii Resum ............................................................................................................................... xv Abstract ........................................................................................................................... xvii 1 Introducción .................................................................................................................. 1 1.1 Objetivos ...............................................................................................................4
    [Show full text]
  • Rebound Attack
    Rebound Attack Florian Mendel Institute for Applied Information Processing and Communications (IAIK) Graz University of Technology Inffeldgasse 16a, A-8010 Graz, Austria http://www.iaik.tugraz.at/ Outline 1 Motivation 2 Whirlpool Hash Function 3 Application of the Rebound Attack 4 Summary SHA-3 competition Abacus ECHO Lesamnta SHAMATA ARIRANG ECOH Luffa SHAvite-3 AURORA Edon-R LUX SIMD BLAKE EnRUPT Maraca Skein Blender ESSENCE MCSSHA-3 Spectral Hash Blue Midnight Wish FSB MD6 StreamHash Boole Fugue MeshHash SWIFFTX Cheetah Grøstl NaSHA Tangle CHI Hamsi NKS2D TIB3 CRUNCH HASH 2X Ponic Twister CubeHash JH SANDstorm Vortex DCH Keccak Sarmal WaMM Dynamic SHA Khichidi-1 Sgàil Waterfall Dynamic SHA2 LANE Shabal ZK-Crypt SHA-3 competition Abacus ECHO Lesamnta SHAMATA ARIRANG ECOH Luffa SHAvite-3 AURORA Edon-R LUX SIMD BLAKE EnRUPT Maraca Skein Blender ESSENCE MCSSHA-3 Spectral Hash Blue Midnight Wish FSB MD6 StreamHash Boole Fugue MeshHash SWIFFTX Cheetah Grøstl NaSHA Tangle CHI Hamsi NKS2D TIB3 CRUNCH HASH 2X Ponic Twister CubeHash JH SANDstorm Vortex DCH Keccak Sarmal WaMM Dynamic SHA Khichidi-1 Sgàil Waterfall Dynamic SHA2 LANE Shabal ZK-Crypt The Rebound Attack [MRST09] Tool in the differential cryptanalysis of hash functions Invented during the design of Grøstl AES-based designs allow a simple application of the idea Has been applied to a wide range of hash functions Echo, Grøstl, JH, Lane, Luffa, Maelstrom, Skein, Twister, Whirlpool, ... The Rebound Attack Ebw Ein Efw inbound outbound outbound Applies to block cipher and permutation based
    [Show full text]
  • The Hitchhiker's Guide to the SHA-3 Competition
    History First Second Third The Hitchhiker’s Guide to the SHA-3 Competition Orr Dunkelman Computer Science Department 20 June, 2012 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 1/ 33 History First Second Third Outline 1 History of Hash Functions A(n Extremely) Short History of Hash Functions The Sad News about the MD/SHA Family 2 The First Phase of the SHA-3 Competition Timeline The SHA-3 First Round Candidates 3 The Second Round The Second Round Candidates The Second Round Process 4 The Third Round The Finalists Current Performance Estimates The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 2/ 33 History First Second Third History Sad Outline 1 History of Hash Functions A(n Extremely) Short History of Hash Functions The Sad News about the MD/SHA Family 2 The First Phase of the SHA-3 Competition Timeline The SHA-3 First Round Candidates 3 The Second Round The Second Round Candidates The Second Round Process 4 The Third Round The Finalists Current Performance Estimates The Outcome of SHA-3 Orr Dunkelman The Hitchhiker’s Guide to the SHA-3 Competition 3/ 33 History First Second Third History Sad A(n Extremely) Short History of Hash Functions 1976 Diffie and Hellman suggest to use hash functions to make digital signatures shorter. 1979 Salted passwords for UNIX (Morris and Thompson). 1983/4 Davies/Meyer introduce Davies-Meyer. 1986 Fiat and Shamir use random oracles. 1989 Merkle and Damg˚ard present the Merkle-Damg˚ard hash function.
    [Show full text]
  • Tocubehash, Grøstl, Lane, Toshabal and Spectral Hash
    FPGA Implementations of SHA-3 Candidates: CubeHash, Grøstl, Lane, Shabal and Spectral Hash Brian Baldwin, Andrew Byrne, Mark Hamilton, Neil Hanley, Robert P. McEvoy, Weibo Pan and William P. Marnane Claude Shannon Institute for Discrete Mathematics, Coding and Cryptography & Department of Electrical & Electronic Engineering, University College Cork, Ireland. Hash Functions The SHA-3 Contest Hash Function Implementations Results Conclusions Overview Hash Function Description Introduction Background Operation UCC Cryptography Group, 2009 The Claude Shannon Workshop On Coding and Cryptography Hash Functions The SHA-3 Contest Hash Function Implementations Results Conclusions Overview Hash Function Description Introduction Background Operation The SHA-3 Contest UCC Cryptography Group, 2009 The Claude Shannon Workshop On Coding and Cryptography Hash Functions The SHA-3 Contest Hash Function Implementations Results Conclusions Overview Hash Function Description Introduction Background Operation The SHA-3 Contest Overview of the Hash Function Architectures UCC Cryptography Group, 2009 The Claude Shannon Workshop On Coding and Cryptography Hash Functions The SHA-3 Contest Hash Function Implementations Results Conclusions Overview Hash Function Description Introduction Background Operation The SHA-3 Contest Overview of the Hash Function Architectures Hash Function Implementations CubeHash Grøstl Lane Shabal Spectral Hash UCC Cryptography Group, 2009 The Claude Shannon Workshop On Coding and Cryptography Hash Functions The SHA-3 Contest Hash Function
    [Show full text]
  • An Efficient Hardware Architecture for Spectral Hash Algorithm
    An Efficient Hardware Architecture for Spectral Hash Algorithm Ray C.C. Cheung C¸etin Kaya Koc¸ Department of Electrical Engineering University of California Santa Barbara & University of California Los Angeles City University of Istanbul [email protected] [email protected] John D. Villasenor Department of Electrical Engineering University of California Los Angeles [email protected] Abstract “frequency domain techniques”) have recently been used in certain special applications in cryptography, including in The Spectral Hash algorithm is one of the Round 1 can- hash function computation [2, 3], modular arithmetic for the didates for the SHA-3 family, and is based on spectral arith- RSA cryptosystem [4], and finite field arithmetic for elliptic metic over a finite field, involving multidimensional dis- curve cryptography [5, 6, 7]. crete Fourier transformations over a finite field, data de- Cryptographic applications require exact arithmetic and pendent permutations, Rubic-type rotations, and affine and the underlying mathematical structures (groups, rings, and nonlinear functions. The underlying mathematical struc- fields) have finitely many elements. Typically, the finite tures and operations pose interesting and challenging tasks ring of integers modulo n, the finite field of p (where p is for computer architects and hardware designers to create a prime) or 2k elements are used, respectively represented k fast, efficient, and compact ASIC and FPGA realizations. as Zn, GF(p) and GF(2 ). Furthermore, in cryptographic In this paper, we present an efficient hardware architec- applications, the DFT computations are performed in a fi- ture for the full 512-bit hash computation using the spectral nite ring or finite field; this differs from many applications hash algorithm.
    [Show full text]
  • NISTIR 7620 Status Report on the First Round of the SHA-3
    NISTIR 7620 Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Andrew Regenscheid Ray Perlner Shu-jen Chang John Kelsey Mridul Nandi Souradyuti Paul NISTIR 7620 Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Andrew Regenscheid Ray Perlner Shu-jen Chang John Kelsey Mridul Nandi Souradyuti Paul Information Technology Laboratory National Institute of Standards and Technology Gaithersburg, MD 20899-8930 September 2009 U.S. Department of Commerce Gary Locke, Secretary National Institute of Standards and Technology Patrick D. Gallagher, Deputy Director NISTIR 7620: Status Report on the First Round of the SHA-3 Cryptographic Hash Algorithm Competition Abstract The National Institute of Standards and Technology is in the process of selecting a new cryptographic hash algorithm through a public competition. The new hash algorithm will be referred to as “SHA-3” and will complement the SHA-2 hash algorithms currently specified in FIPS 180-3, Secure Hash Standard. In October, 2008, 64 candidate algorithms were submitted to NIST for consideration. Among these, 51 met the minimum acceptance criteria and were accepted as First-Round Candidates on Dec. 10, 2008, marking the beginning of the First Round of the SHA-3 cryptographic hash algorithm competition. This report describes the evaluation criteria and selection process, based on public feedback and internal review of the first-round candidates, and summarizes the 14 candidate algorithms announced on July 24, 2009 for moving forward to the second round of the competition. The 14 Second-Round Candidates are BLAKE, BLUE MIDNIGHT WISH, CubeHash, ECHO, Fugue, Grøstl, Hamsi, JH, Keccak, Luffa, Shabal, SHAvite-3, SIMD, and Skein.
    [Show full text]
  • Kriptografske Tehničke Sigurnosne Mjere
    Sigurnost računalnih sustava Computer Systems Security Kriptografske tehničke sigurnosne mjere Marin Golub Sadržaj • Uvod: Jesu li i koliko su kriptoalgoritmi sigurni? • Napadi na simetrične i asimetrične kriptosustave • Asimetrični kriptosustavi – Kriptosustavi zasnovani na eliptičkim krivuljama • Funkcije za izračunavanje sažetka poruke – Napadi na funkcije za izračunavanje sažetka poruke – Elektronički vs. digitalni potpis – SHA-2 i SHA-3 • Kvantna kriptografija • Natječaji za nove kriptografske algoritme koji su u tijeku – Kriptografija prilagođena ugrađenim računalima (Lightweight Cryptography ) – Asimetrična kriptografija nakon kvantnih računala (Post-Quantum Cryptography ) SRS-Crypto-2/79 Osnovni pojmovi Kriptologija = kriptografija + kriptoanaliza Kriptografija • znanstvena disciplina (ili umjetnost?) sastavljanja poruka sa ciljem skrivanja sadržaja poruka Kriptoanaliza • znanstvena disciplina koja se bavi analizom skrivenih aspekata sustava i koristi se kako bi se ispitala (ili narušila) sigurnost kriptografskog sustava SRS-Crypto-3/79 Jesu li i koliko su kriptoalgoritmi sigurni? • Postoje specijalizirana računala za napad grubom silom na DES kriptosustav: COPACOBANA (A Cost-Optimized PArallel COde Breaker) • 12.12.2009. faktoriziran RSA-768 • na kvantnom računalu je riješen problem faktoriziranja velikih brojeva i problem diskretnog logaritma • 17.8.2004. - kineski i francuski znanstvenici su objavili članak pod naslovom: "Kolizija za hash funkcije: MD4, MD5, Haval-128 i RIPEMD" • 13.2.2005. - kineski znanstvenici: "Collision
    [Show full text]
  • Finding Bugs in Cryptographic Hash Function Implementations Nicky Mouha, Mohammad S Raunak, D
    1 Finding Bugs in Cryptographic Hash Function Implementations Nicky Mouha, Mohammad S Raunak, D. Richard Kuhn, and Raghu Kacker Abstract—Cryptographic hash functions are security-critical on the SHA-2 family, these hash functions are in the same algorithms with many practical applications, notably in digital general family, and could potentially be attacked with similar signatures. Developing an approach to test them can be par- techniques. ticularly diffcult, and bugs can remain unnoticed for many years. We revisit the NIST hash function competition, which was In 2007, the National Institute of Standards and Technology used to develop the SHA-3 standard, and apply a new testing (NIST) released a Call for Submissions [4] to develop the new strategy to all available reference implementations. Motivated SHA-3 standard through a public competition. The intention by the cryptographic properties that a hash function should was to specify an unclassifed, publicly disclosed algorithm, to satisfy, we develop four tests. The Bit-Contribution Test checks be available worldwide without royalties or other intellectual if changes in the message affect the hash value, and the Bit- Exclusion Test checks that changes beyond the last message bit property restrictions. To allow the direct substitution of the leave the hash value unchanged. We develop the Update Test SHA-2 family of algorithms, the SHA-3 submissions were to verify that messages are processed correctly in chunks, and required to provide the same four message digest lengths. then use combinatorial testing methods to reduce the test set size Chosen through a rigorous open process that spanned eight by several orders of magnitude while retaining the same fault- years, SHA-3 became the frst hash function standard that detection capability.
    [Show full text]
  • Grøstl – a SHA-3 Candidate
    Cryptographic hash functions NIST SHA-3 Competition Grøstl Grøstl – a SHA-3 candidate Krystian Matusiewicz Wroclaw University of Technology CECC 2010, June 12, 2010 Krystian Matusiewicz Grøstl – a SHA-3 candidate 1 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Talk outline ◮ Cryptographic hash functions ◮ NIST SHA-3 Competition ◮ Grøstl Krystian Matusiewicz Grøstl – a SHA-3 candidate 2 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Cryptographic hash functions Krystian Matusiewicz Grøstl – a SHA-3 candidate 3 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Cryptographic hash functions: why? ◮ We want to have a short, fixed length “fingerprint” of any piece of data ◮ Different fingerprints – certainly different data ◮ Identical fingerprints – most likely the same data ◮ No one can get any information about the data from the fingerprint Krystian Matusiewicz Grøstl – a SHA-3 candidate 4 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Random Oracle Construction: ◮ Box with memory ◮ On a new query: pick randomly and uniformly the answer, remember it and return the result ◮ On a repeating query, repeat the answer (function) Krystian Matusiewicz Grøstl – a SHA-3 candidate 5 / 26 Cryptographic hash functions NIST SHA-3 Competition Grøstl Random Oracle Construction: ◮ Box with memory ◮ On a new query: pick randomly and uniformly the answer, remember it and return the result ◮ On a repeating query, repeat the answer (function) Properties: ◮ No information about the data ◮ To find a preimage:
    [Show full text]
  • PROGRAMSKO OSTVARENJE ALGORITAMA BLAKE, Shabal I SIMD
    SVEU ČILIŠTE U ZAGREBU FAKULTET ELEKTROTEHNIKE I RA ČUNARSTVA DIPLOMSKI RAD br. 132 PROGRAMSKO OSTVARENJE ALGORITAMA BLAKE, Shabal i SIMD Monika Čeri Zagreb, sije čanj 2011. SVEU ČILIŠTE U ZAGREBU FAKULTET ELEKTROTEHNIKE I RA ČUNARSTVA DIPLOMSKI RAD br. 132 PROGRAMSKO OSTVARENJE ALGORITAMA BLAKE, Shabal i SIMD Monika Čeri Zagreb, sije čanj 2011. Sadržaj 1. Uvod .......................................................................................................................... 1 2. Funkcije za izra čunavanje sažetka poruke................................................................. 2 3. Secure Hash Algorithm (SHA) ................................................................................... 4 3.1. SHA-1 ............................................................................................................... 4 3.1.1. Postupak dobivanja sažetka poruke algoritmom SHA-1............................. 4 3.1.2. Napadi na SHA-0 i SHA-1.......................................................................... 5 3.2. SHA-2 ............................................................................................................... 6 3.2.1. Postupak dobivanja sažetka poruke algoritmom SHA-2............................. 7 3.2.2. Napadi na SHA-2....................................................................................... 9 4. Natje čaj za SHA-3 ....................................................................................................10 4.1. Tijek natje čaja za SHA-3 ..................................................................................10
    [Show full text]
  • Comprehensive Comparison of Hardware Performance of Fourteen
    Comprehensive Comparison of Hardware Performance of Fourteen Round 2 SHA-3 Candidates with 512-bit Outputs Using Field Programmable Gate Arrays1 Kris Gaj, Ekawat Homsirikamol, and Marcin Rogawski ECE Department, George Mason University {kgaj, ehomsiri, mrogawsk}@gmu.edu Abstract. In this paper, we extend our evaluation of the hardware performance of 14 Round 2 SHA-3 candidates, accepted for the presentation at CHES 2010, to the case of high security variants, with 512 bit outputs. A straightforward method for predicting the performance of 512-bit variants, based on the results for 256-bit versions of investigated hash functions is presented, and confirmed experimentally. The VHDL codes for 512-bit variants of all 14 SHA-3 Round 2 candidates and the old standard SHA-2 have been developed and thoroughly verified. These codes have been then used to evaluate the relative performance of all aforementioned algorithms using seven modern families of Field Programmable Gate Arrays (FPGAs) from two major vendors, Xilinx and Altera. The results point to very significant differences among all evaluated algorithms in terms of both throughput and area. Only two candidates, Keccak and CubeHash, outperform SHA-512 in terms of the primary optimization target used in this study, throughput to area ratio. 1. Introduction Both the current NIST cryptographic hash function standard, FIPS 180-3 [1] (commonly referred as SHA- 2) as well as the call for a new standard, SHA-3 [2], assume that each hash function family includes variants with at least the following four output sizes: 224, 256, 384, and 512-bits. These variants should have a security equivalent to Triple DES, AES-128, AES-192, and AES-256, respectively.
    [Show full text]