1,060 research outputs found
Yan yuan de sheng huo jing yan he chuang zao jue se de guan xi.
No full text中國戲曲硏究院編 ; 胡沙著.Zhongguo xi qu yan jiu yuan bian ; Hu Sha zhu
Zuo lou sha Xi
No full textIV. 傳統曲目介紹. 1. 西河大鼓 : 綉汗巾 / 楊亞琴 -- 2. 青楼遺恨 / 高輝 -- 3. 玉堂春 / 姚雪芬 -- 4. 活捉三郎 / 張秋萍 -- 5. 游春 / 刘秀梅 -- 6. 宝玉探病 / 籍薇 -- 7. 凤仪亭 / 赵學义 -- 8. 坐楼杀惜 / 小映霞.Possibly reproduced from other commercial recording or radio broadcast (Pending for review)"于1991"--Spine label.Electronic reproduction from Rulan Chao Pian VHS collection.Performers: 天津市曲艺团, 天津市实验曲艺团联合演出.Sung and spoken in Chinese."Yu 1991"--Spine label.Performers: Tianjin Shi qu yi tuan, Tianjin Shi shi yan qu yi tuan lian he yan chu.Detailed contents in vernacular field only
Xianggang huan dao you lan zhi nan tu [cartographic material] : Xianggang zhong huan yin hang qu ge zhong yao shang ye da sha xiang tu.
No full textTourist maps of Hong Kong. Includes main roads, railways and tourist information and detailed map of important commercial buildings in the banking district in central Hong Kong.; Also available in an electronic version via the internet at: http://nla.gov.au/nla.map-brsc13c. 880-04 Inset Xianggang jian tu.880-02 Xianggang zhong huan yin hang qu ge zhong yao shang ye da sha xiang t
Performance Analysis of Modified SHA-3
No full textAbstractSecurity services have become an inseparable feature of almost all digital transactions. A crucial module of these scheme isintegrity, which is performed using a cryptographic hash function. Secure Hash Algorithm can be an efficient hashing technique.SHA-3 is the most recent and efficient Secure Hash Algorithm. Keccak has been chosen as the official algorithm for SHA-3 in2012. In this paper we propose a modification on the design of Secure Hash Algorithm (SHA-3) on Xilinx Field ProgrammableGate Array (FPGA) device. In order to provide reliable architecture for this algorithm, a concurrent error tolerant scheme forSHA-3 is used. A system based on the combination of SHA-3 and error tolerant scheme is also described. Simulation resultsshows, an efficiency in area and delay of SHA-3 designs
Security and usability of standard has hfunctions, in particular MD-5, SHA-1 and SHA-2
No full textTitle: Security and usability of standard hash functions, in particular MD-5, SHA-1 and SHA-2 Author: Galaczová Barbora Department: Department of Algebra Supervisor: Doc. RNDr. Tůma Jiří, DrSc., Department of Algebra Consultant: Ing. Budiš Petr, Ph.D. Abstract: In the present work we try to digestedly describe standard hash functions, in particular MD-5, SHA-1 and SHA-2. We describe resume of existing attacks on these hash functions. We closely focused on MD-5 collision attacks, because the other hash function collision attacks result from these. Next we describe posibilities of practical usage of hash function collisions, in particular into the qualified certificates area and possible threats. At the end to the present work we describe new hash functions, which could replace current hash functions. This work also contains software to calculate MD-5 hash and search it`s collisions. The software is based on method invented by Czech cryptoanalytist Vlastimil Klíma. Keywords: hash function, collision, qualified certificate, security
Cryptanalysis of Dynamic SHA(2)
No full textIn this paper, we analyze the hash functions Dynamic SHA and Dynamic SHA2, which have been selected as first round candidates in the NIST hash function competition. These hash functions rely heavily on data-dependent rotations, similar to certain block ciphers, e.g., RC5. Our analysis suggests that in the case of hash functions, where the attacker has more control over the rotations, this approach is less favorable than in block ciphers. We present practical, or close to practical, collision attacks on both Dynamic SHA and Dynamic SHA2. Moreover, we present a preimage attack on Dynamic SHA that is faster than exhaustive search. © 2009 Springer-Verlag Berlin Heidelberg.sponsorship: Supported by the Swiss National Science Foundation, project no. 113329. This author was supported by the France Telecom chaire. F.W.O. Research Assistant, Fund for Scientific Research Flander s (Belgium) (Swiss National Science Foundation|113329, France Telecom chaire, Scientific Research)status: Publishe
Design & Characterization of SHA 3- 256 Bit IP Core
No full textAbstractIn the era of internet and computer networking the need for security have increased rapidly. Various crypto algorithms are used for secured data transmission and reception through the network, of which hash function possess a key role in various cryptographic protocols. Keccak algorithm is the winner of SHA-3 competition conducted by NIST. SHA-3 consists of different variant such as 224, 256, 384 and 512 bit. This paper discuss the design and implementation of SHA-3 256- bit core. The core is designed using Verilog HDL and prototyped using Xilinx® Virtex®-6FPGA
Uma solução de autenticação fim a fim para o LDP (Label Distribution Protocol)
No full textDissertação (mestrado) - Universidade Federal de Santa Catarina, Centro Tecnológico. Programa de Pós-Graduação em Ciência da Computação.Este trabalho propõe uma solução de autenticação para o protocolo LDP (Label Distribution Protocol) que tem por objetivo autenticar, em um escopo fim a fim, o estabelecimento de um LSP (Label Switching Path) entre um LSR (Label Switching Router) de Ingresso e o seu respectivo LSR de Egresso. Objetiva-se suprir a deficiência do protocolo LDP de não possuir um mecanismo de autenticação fim a fim definido, aplicável entre LSRs não-adjacentes. Conforme foi verificado pelo levantamento de trabalhos correlatos, atualmente é desconhecida uma solução de autenticação semelhante, que efetivamente atenda o propósito de autenticar num escopo fim a fim, o estabelecimento de LSPs no protocolo LDP. Dessa forma a solução deste trabalho é inédita no seu escopo de aplicação. A solução foi planejada para ambientes onde LSPs atravessam múltiplos domínios externos, não confiáveis entre si, e que por isso necessitam de um mecanismo de autenticação durante o estabelecimento dos LSPs. A solução faz uso de um mecanismo de autenticação, baseado em criptografia assimétrica (chave pública e privada), anexado a cada mensagem LDP. Este mecanismo possibilita ao LSR receptor verificar e autenticar o originador da mensagem LDP. Adicionalmente a solução provê integridade de dados através de um mecanismo de resumo de mensagens (hash) e também protege contra ataques de repetição através da inserção de um nonce às mensagens LDP
Maximizing the Potential of Custom RISC-V Vector Extensions for Speeding up SHA-3 Hash Functions
No full textSHA-3 is considered to be one of the most secure standardized hash functions. It relies on the Keccak-f[1 600] permutation, which operates on an internal state of 1 600 bits, mostly represented as a 5 x 5 x 64-bit matrix. While existing implementations process the state sequentially in chunks of typically 32 or 64 bits, the Keccak-f[1 600] permutation can benefit a lot from speedup through parallelization. This paper is the first to explore the full potential of parallelization of Keccak-f[1 600] in RISC-V based processors through custom vector extensions on 32-bit and 64-bit architectures. We analyze the Keccak permutation, composed of five different step mappings, and propose ten custom vector instructions to speed up the computation. We realize these extensions in a SIMD processor described in System Verilog. We compare the performance of our designs to existing architectures based on vectorized application-specific instruction set processors (ASIP). We show that our designs outperform all related work in throughput due to our carefully selected custom vector instructions.Green Open Access added to TU Delft Institutional Repository 'You share, we take care!' - Taverne project https://www.openaccess.nl/en/you-share-we-take-care Otherwise as indicated in the copyright section: the publisher is the copyright holder of this work and the author uses the Dutch legislation to make this work public.Cyber Securit
- …
