淡江大學機構典藏:Item 987654321/41369
English  |  正體中文  |  简体中文  |  Items with full text/Total items : 62805/95882 (66%)
Visitors : 3958471      Online Users : 252
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
Scope Tips:
  • please add "double quotation mark" for query phrases to get precise results
  • please goto advance search for comprehansive author search
  • Adv. Search
    HomeLoginUploadHelpAboutAdminister Goto mobile version
    Please use this identifier to cite or link to this item: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/41369


    Title: TTS: High-Speed Signatures on a Low-Cost Smart Card
    Other Titles: 低價智慧卡上的高速簽章系統 TTS
    Authors: Yang, Bo-yin;Chen, Jiun-ming;Chen, Yen-hung
    Contributors: 淡江大學數學學系
    Keywords: Multivariate public-key cryptosystem;finite field;smart card;8051
    Date: 2004-08-01
    Issue Date: 2010-01-28 07:24:09 (UTC+8)
    Publisher: Berlin Heidelberg : Springer-Verlag GmbH
    Abstract: TTS is a genre of multivariate digital signature schemes first proposed in 2002. Its public map is composed of two affine maps sandwiching a Tame Map, which is a map invertible through serial substitution and solving linear equations. We implement the signing and key generation operations for a TTS instance with 20-byte hashes and 28-byte signatures, on popular extant microcontroller cores compatible to the Intel 8051. Our tests demonstrates that TTS can be even faster than SFLASH v2, which is known for its celerity. The sample scheme TTS(20,28) is fast enough for practical deployment on a low-end 8051-based embedded device. A really low-end part like a stock Intel 8051AH running at 3.57 MHz can sign in just 170ms. A better 8051-compatible chip will take a lot less time.
    Security requirements today demand on-card key generation, and the big public keys of a multivariate PKC create a storage problem. TTS is unusual in that public keys can be synthesized on-card at a decent pace for block-by-block output, using some minimal information kept on-card. Since this does not take much more time than the I/O needed to transmit the public key to a reader, we can avoid holding the entire public key in the limited memory of a smart card. We show that this to be a gain for multivariate PKC’s with relatively few terms per central equation. The literature is not rich in this kind of detailed description of an implementation of a signature scheme — capable of fast on-card public key generation, on a low-cost smart card without a co-processor, and at NESSIE-approved security levels.
    We look into other theory issues like safeguarding against side-channel attacks, and using unusual techniques for linear algebra under serious space restrictions, which may help implementations of other multivariate PKC’s such as SFLASH.
    Relation: Lecture Notes in Computer Science 3156, pp.371-385
    DOI: 10.1007/978-3-540-28632-5_27
    Appears in Collections:[Graduate Institute & Department of Mathematics] Journal Article

    Files in This Item:

    File Description SizeFormat
    index.html0KbHTML228View/Open
    index.html0KbHTML111View/Open
    TTS High-Speed Signatures on a Low-Cost Smart Card.pdf259KbAdobe PDF1View/Open

    All items in 機構典藏 are protected by copyright, with all rights reserved.


    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - Feedback