Cryptography and Coding - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

24

(FIVE YEARS 0)

H-INDEX

7

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540772712

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Modified Berlekamp-Massey Algorithm for Approximating the k-Error Linear Complexity of Binary Sequences

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_14 ◽

2007 ◽

pp. 220-232 ◽

Author(s):

Alexandra Alecu ◽

Ana Sălăgean

Keyword(s):

Linear Complexity ◽

Binary Sequences ◽

Error Linear Complexity

Download Full-text

On the Walsh Spectrum of a New APN Function

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_6 ◽

2007 ◽

pp. 92-98 ◽

Author(s):

Carl Bracken ◽

Eimear Byrne ◽

Nadya Markin ◽

Gary McGuire

Keyword(s):

Walsh Spectrum ◽

Download Full-text

Randomness Reuse: Extensions and Improvements

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_16 ◽

2007 ◽

pp. 257-276 ◽

Author(s):

Manuel Barbosa ◽

Pooya Farshim

Download Full-text

Efficient Cryptographic Protocols Based on the Hardness of Learning Parity with Noise

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_1 ◽

2007 ◽

pp. 1-15 ◽

Author(s):

Jonathan Katz

Keyword(s):

Cryptographic Protocols

Download Full-text

New Branch Prediction Vulnerabilities in OpenSSL and Necessary Software Countermeasures

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_12 ◽

2007 ◽

pp. 185-203 ◽

Author(s):

Onur Acıiçmez ◽

Shay Gueron ◽

Jean-Pierre Seifert

Keyword(s):

Branch Prediction

Download Full-text

Efficient Computation of the Best Quadratic Approximations of Cubic Boolean Functions

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_5 ◽

2007 ◽

pp. 73-91 ◽

Author(s):

Nicholas Kolokotronis ◽

Konstantinos Limniotis ◽

Nicholas Kalouptsidis

Keyword(s):

Boolean Functions ◽

Efficient Computation ◽

Quadratic Approximations

Download Full-text

Efficient 15,360-bit RSA Using Woop-Optimised Montgomery Arithmetic

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_21 ◽

2007 ◽

pp. 346-363

Author(s):

Kamel Bentahar ◽

Nigel P. Smart

Download Full-text

Constructing Pairing-Friendly Elliptic Curves Using Gröbner Basis Reduction

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_20 ◽

2007 ◽

pp. 336-345

Author(s):

Waldyr D. Benits Junior ◽

Steven D. Galbraith

Keyword(s):

Elliptic Curves ◽

Gröbner Basis ◽

Grobner Basis ◽

Basis Reduction

Download Full-text

Optimised Versions of the Ate and Twisted Ate Pairings

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_18 ◽

2007 ◽

pp. 302-312 ◽

Author(s):

Seiichi Matsuda ◽

Naoki Kanayama ◽

Florian Hess ◽

Eiji Okamoto

Download Full-text

Non-linear Cryptanalysis Revisited: Heuristic Search for Approximations to S-Boxes

Cryptography and Coding - Lecture Notes in Computer Science ◽

10.1007/978-3-540-77272-9_7 ◽

2007 ◽

pp. 99-117 ◽

Author(s):

Juan M. E. Tapiador ◽

John A. Clark ◽

Julio C. Hernandez-Castro

Keyword(s):

Heuristic Search ◽

Linear Cryptanalysis ◽

Download Full-text