Item Details

Authentication Codes and Combinatorial Designs [electronic resource]

Pei, Dingyi; ENGnetBASE
Format
EBook; Book; Online
Published
Chapman & Hall/CRC [Imprint] Jan. 2006 Boca Raton : C R C Press LLC Boulder : NetLibrary, Incorporated [Distributor]
Language
English
Series
Discrete Mathematics and Its Applications Ser
ISBN
9781420003185, 1420003186 (E-Book)
Target Audience
Scholarly & Professional
Summary
Annotation
Description
Mode of access: World wide Web.
Logo for Copyright Not EvaluatedCopyright Not Evaluated
Technical Details
  • Access in Virgo Classic

  • LEADER 02860cam a22003732 4500
    001 u5218672
    003 SIRSI
    005 20181008061743.0
    006 m d
    007 cr n
    008 070507e20060113flu s|||||||| 2|eng|d
    020
      
      
    a| 9781420003185
    020
      
      
    a| 1420003186 (E-Book) c| USD 94.95 Retail Price (NetLibrary, Incorporated) 9| Active Record
    024
    3
      
    a| 9781420003185
    035
      
      
    a| (WaSeSS)ssj0000107743
    037
      
      
    b| 00004766
    040
      
      
    a| BIP US d| WaSeSS
    050
      
    0
    a| QA76.9.A25P42 2006
    082
    0
    0
    a| 005.82 2| 22
    100
    1
      
    a| Pei, Dingyi e| Author
    245
    1
    0
    a| Authentication Codes and Combinatorial Designs h| [electronic resource]
    260
      
      
    b| Chapman & Hall/CRC [Imprint] c| Jan. 2006 a| Boca Raton : b| C R C Press LLC a| Boulder : b| NetLibrary, Incorporated [Distributor]
    440
      
    0
    a| Discrete Mathematics and Its Applications Ser.
    520
    8
      
    a| Annotation b| Researchers and practitioners of cryptography and information security are constantly challenged to respond to new attacks and threats to information systems. Authentication Codes and Combinatorial Designs presents new findings and original work on perfect authentication codes characterized in terms of combinatorial designs, namely strong partially balanced designs (SPBD).<br><br>Beginning with examples illustrating the concepts of authentication schemes and combinatorial designs, the book considers the probability of successful deceptions followed by schemes involving three and four participants, respectively. From this point, the author constructs the perfect authentication schemes and explores encoding rules for such schemes in some special cases.<br><br>Using rational normal curves in projective spaces over finite fields, the author constructs a new family of SPBD. He then presents some established combinatorial designs that can be used to construct perfect schemes, such as t-designs, orthogonal arrays of index unity, and designs constructed by finite geometry. The book concludes by studying definitions of perfect secrecy, properties of perfectly secure schemes, and constructions of perfect secrecy schemes with and without authentication.<br><br>Supplying an appendix of construction schemes for authentication and secrecy schemes, Authentication Codes and Combinatorial Designs points to new applications of combinatorial designs in cryptography.
    521
      
      
    a| Scholarly & Professional b| C R C Press LLC
    538
      
      
    a| Mode of access: World wide Web.
    655
      
    0
    a| Electronic books.
    690
      
      
    a| Combinatorial Analysis
    692
      
      
    a| Mathematics x| Combinatorics
    710
    2
      
    a| ENGnetBASE
    856
    4
    0
    u| http://RE5QY4SB7X.search.serialssolutions.com/?V=1.0&L=RE5QY4SB7X&S=JCs&C=TC0000107743&T=marc
    596
      
      
    a| 1
    999
      
      
    a| XX(5218672.1) w| WEB i| 5218672-1001 l| INTERNET m| UVA-LIB t| INTERNET

Availability

Google Preview

Read Online