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

9783642108679, 9783642108686

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A New Protocol for the Nearby Friend Problem

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_14 ◽

2009 ◽

pp. 236-251 ◽

Cited By ~ 4

Author(s):

Sanjit Chatterjee ◽

Koray Karabina ◽

Alfred Menezes

Download Full-text

On Higher Weights and Code Existence

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_4 ◽

2009 ◽

pp. 56-64 ◽

Cited By ~ 1

Author(s):

Hans Georg Schaathun

Keyword(s):

Higher Weights

Download Full-text

A New Family of Hyper-Bent Boolean Functions in Polynomial Form

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_24 ◽

2009 ◽

pp. 402-417 ◽

Cited By ~ 23

Author(s):

Sihem Mesnager

Keyword(s):

Boolean Functions ◽

Polynomial Form ◽

New Family

Download Full-text

Codes as Modules over Skew Polynomial Rings

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_3 ◽

2009 ◽

pp. 38-55 ◽

Cited By ~ 14

Author(s):

Delphine Boucher ◽

Felix Ulmer

Keyword(s):

Polynomial Rings ◽

Skew Polynomial Rings ◽

Skew Polynomial

Download Full-text

Geometric Ideas for Cryptographic Equation Solving in Even Characteristic

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_12 ◽

2009 ◽

pp. 202-221

Author(s):

Sean Murphy ◽

Maura B. Paterson

Keyword(s):

Equation Solving

Download Full-text

Security of Cyclic Double Block Length Hash Functions

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_10 ◽

2009 ◽

pp. 153-175 ◽

Cited By ~ 29

Author(s):

Ewan Fleischmann ◽

Michael Gorski ◽

Stefan Lucks

Keyword(s):

Hash Functions ◽

Block Length ◽

Double Block Length

Download Full-text

On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_23 ◽

2009 ◽

pp. 383-401 ◽

Cited By ~ 1

Author(s):

Yves Edel ◽

Alexander Pott

Keyword(s):

Nonlinear Functions ◽

Almost Perfect Nonlinear ◽

Almost Perfect Nonlinear Functions

Download Full-text

On the Classification of Self-dual -Codes

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_6 ◽

2009 ◽

pp. 78-90 ◽

Cited By ~ 4

Author(s):

Masaaki Harada ◽

Akihiro Munemasa

Keyword(s):

Dual Codes

Download Full-text

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_16 ◽

2009 ◽

pp. 263-277 ◽

Cited By ~ 5

Author(s):

Hao Chen ◽

San Ling ◽

Carles Padró ◽

Huaxiong Wang ◽

Chaoping Xing

Keyword(s):

Algebraic Geometry ◽

Broadcast Encryption ◽

Algebraic Geometry Codes ◽

Key Predistribution ◽

Encryption Schemes ◽

Key Predistribution Schemes

Download Full-text

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-642-10868-6_21 ◽

2009 ◽

pp. 351-367 ◽

Cited By ~ 9

Author(s):

Antoine Joux ◽

Reynald Lercier ◽

David Naccache ◽

Emmanuel Thomé

Keyword(s):

Discrete Logarithms ◽

Diffie Hellman

Download Full-text

Cryptography and Coding - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

A New Protocol for the Nearby Friend Problem

On Higher Weights and Code Existence

A New Family of Hyper-Bent Boolean Functions in Polynomial Form

Codes as Modules over Skew Polynomial Rings

Geometric Ideas for Cryptographic Equation Solving in Even Characteristic

Security of Cyclic Double Block Length Hash Functions

On Designs and Multiplier Groups Constructed from Almost Perfect Nonlinear Functions

On the Classification of Self-dual -Codes

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes

Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms

Cryptography and Coding - Lecture Notes in Computer Science
Latest Publications