Cryptography and Coding - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540430261, 9783540453253

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_19 ◽

2001 ◽

pp. 205-221 ◽

Cited By ~ 36

Author(s):

Shujun Li ◽

Qi Li ◽

Wenmin Li ◽

Xuanqin Mou ◽

Yuanlong Cai

Keyword(s):

Chaotic Maps ◽

Piecewise Linear ◽

Statistical Properties ◽

Random Coding

Download Full-text

A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_6 ◽

2001 ◽

pp. 44-62 ◽

Cited By ~ 12

Author(s):

Manfred von Willich

Keyword(s):

Secret Data ◽

Information Theoretic ◽

Power Attacks

Download Full-text

The Complete Weight Enumerator for Codes over M nxs(F q)

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_3 ◽

2001 ◽

pp. 20-26 ◽

Cited By ~ 11

Author(s):

Irfan Siap

Keyword(s):

Weight Enumerator ◽

Complete Weight Enumerator

Download Full-text

A New Undeniable Signature Scheme Using Smart Cards

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_36 ◽

2001 ◽

pp. 387-394 ◽

Cited By ~ 2

Author(s):

Lee Jongkook ◽

Ryu Shiryong ◽

Kim Jeungseop ◽

Yoo Keeyoung

Keyword(s):

Smart Cards ◽

Signature Scheme ◽

Undeniable Signature

Download Full-text

Generating Large Instances of the Gong-Harn Cryptosystem

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_28 ◽

2001 ◽

pp. 317-328 ◽

Cited By ~ 1

Author(s):

Kenneth J. Giuliani ◽

Guang Gong

Download Full-text

Undetachable Threshold Signatures

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_21 ◽

2001 ◽

pp. 239-244 ◽

Cited By ~ 4

Author(s):

Niklas Borselius ◽

Chris J. Mitchell ◽

Aaron Wilson

Keyword(s):

Threshold Signatures

Download Full-text

On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_2 ◽

2001 ◽

pp. 9-19 ◽

Cited By ~ 1

Author(s):

Christoph Lange ◽

Andreas Ahrens

Keyword(s):

Error Probability ◽

Hamming Codes ◽

Undetected Error Probability ◽

With Memory

Download Full-text

Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_18 ◽

2001 ◽

pp. 191-204

Author(s):

Svetla Nikova ◽

Ventzislav Nikov

Keyword(s):

Metric Spaces

Download Full-text

On Rabin-Type Signatures

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_10 ◽

2001 ◽

pp. 99-113

Author(s):

Marc Joye ◽

Jean-Jacques Quisquater

Download Full-text

The Wide Trail Design Strategy

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/3-540-45325-3_20 ◽

2001 ◽

pp. 222-238 ◽

Cited By ~ 80

Author(s):

Joan Daemen ◽

Vincent Rijmen

Keyword(s):

Design Strategy ◽

Trail Design

Download Full-text

Cryptography and Coding - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Statistical Properties of Digital Piecewise Linear Chaotic Maps and Their Roles in Cryptography and Pseudo-Random Coding

A Technique with an Information-Theoretic Basis for Protecting Secret Data from Differential Power Attacks

The Complete Weight Enumerator for Codes over M nxs(F q)

A New Undeniable Signature Scheme Using Smart Cards

Generating Large Instances of the Gong-Harn Cryptosystem

Undetachable Threshold Signatures

On the Undetected Error Probability for Shortened Hamming Codes on Channels with Memory

Improvement of the Delsarte Bound for τ-Designs in Finite Polynomial Metric Spaces

On Rabin-Type Signatures

The Wide Trail Design Strategy

Cryptography and Coding - Lecture Notes in Computer Science
Latest Publications