We are improving our search experience. To check which content you have full access to, or for advanced search, go back to the old search.

Search

Please fill in this field.
Filters applied:
Computer science

Search Results

Showing 261-280 of 287 results

  1. On Boolean Functions with Generalized Cryptographic Properties

    By considering a new metric, we generalize cryptographic properties of Boolean functions such as resiliency and propagation characteristics. These...
    An Braeken, Ventzislav Nikov, ... Bart Preneel in Progress in Cryptology - INDOCRYPT 2004
    Conference paper 2004

  2. Additive Autocorrelation of Resilient Boolean Functions

    In this paper, we introduce a new notion called the dual function for studying Boolean functions. First, we discuss general properties of the dual...
    Guang Gong, Khoongming Khoo in Selected Areas in Cryptography
    Conference paper 2004

  3. On the Secondary Constructions of Resilient and Bent Functions

    We first give a survey of the known secondary constructions of Boolean functions, permitting to obtain resilient functions achieving the best...
    Claude Carlet in Coding, Cryptography and Combinatorics
    Conference paper 2004

  4. Results on Algebraic Immunity for Cryptographically Significant Boolean Functions

    Recently algebraic attack has received a lot of attention in cryptographic literature. It has been observed that a Boolean function f, interpreted as...
    Deepak Kumar Dalai, Kishan Chand Gupta, Subhamoy Maitra in Progress in Cryptology - INDOCRYPT 2004
    Conference paper 2004

  5. Introducing Query Expansion Methods for Collaborative Information Retrieval

    The accuracy of ad-hoc document retrieval systems has plateaued in the last few years. At DFKI, we are working on so-called collaborative information...
    Armin Hust in Reading and Learning
    Chapter 2004

  6. On Plateaued Functions and Their Constructions

    We use the notion of covering sequence, introduced by C. Carlet and Y. Tarannikov, to give a simple characterization of bent functions. We extend it...
    Claude Carlet, Emmanuel Prouff in Fast Software Encryption
    Conference paper 2003

  7. Extending the Resynchronization Attack

    Synchronous stream ciphers need perfect synchronization between sender and receiver. In practice, this is ensured by a resync mechanism. Daemen et...
    Frederik Armknecht, Joseph Lano, Bart Preneel in Selected Areas in Cryptography
    Conference paper 2004

  8. A New Simple Technique to Attack Filter Generators and Related Ciphers

    This paper presents a new simple distinguishing attack that can be applied on stream ciphers constructed from filter generators or similar...
    Håkan Englund, Thomas Johansson in Selected Areas in Cryptography
    Conference paper 2004

  9. New Constructions for Resilient and Highly Nonlinear Boolean Functions

    We explore three applications of geometric sequences in constructing cryptographic Boolean functions. First, we construct 1-resilient functions of n...
    Khoongming Khoo, Guang Gong in Information Security and Privacy
    Conference paper 2003

  10. On the Covering Radius of Second Order Binary Reed-Muller Code in the Set of Resilient Boolean Functions

    Let $\mathcal R_{t,n}$ denote the set of t-resilient...
    Yuri Borissov, An Braeken, ... Bart Preneel in Cryptography and Coding
    Conference paper 2003

  11. A New Cryptanalytic Attack for PN-generators Filtered by a Boolean Function

    We present a new cryptanalytic attack on PN-generators filtered by a Boolean function. The key-idea is to jointly combine the knowledge of the...
    Sabine Leveiller, Gilles Zémor, ... Joseph Boutros in Selected Areas in Cryptography
    Conference paper 2003

  12. Highlights in Physical Simulation and Analysis at ICCAD

    Six papers were chosen to represent twenty years of research in physical simulation and analysis, three papers addressing the problem of extracting...
    Kenneth S. Kundert, Jacob White in The Best of ICCAD
    Chapter 2003

  13. A Larger Class of Cryptographic Boolean Functions via a Study of the Maiorana-McFarland Construction

    Thanks to a new upper bound, we study more precisely the nonlinearities of Maiorana-McFarland’s resilient functions. We characterize those functions...
    Claude Carlet in Advances in Cryptology — CRYPTO 2002
    Conference paper 2002

  14. Improved Upper Bound on the Nonlinearity of High Order Correlation Immune Functions

    It has recently been shown that when m > 1/2n - 1, the nonlinearity N f of an mth-order correlation immune function f with n...
    Yuliang Zheng, **an-Mo Zhang in Selected Areas in Cryptography
    Conference paper 2001

  15. Autocorrelation Properties of Correlation Immune Boolean Functions

    In this paper we study the autocorrelation values of correlation immune and resilient Boolean functions. We provide new lower bounds and related...
    Subhamoy Maitra in Progress in Cryptology — INDOCRYPT 2001
    Conference paper 2001

  16. New Results on Correlation Immunity

    The absolute indicator for GAC forecasts the overall avalanche characteristics of a cryptographic Boolean function. From a security point of view, it...
    Yuliang Zheng, **an-Mo Zhang in Information Security and Cryptology — ICISC 2000
    Conference paper 2001

  17. Relationships between Bent Functions and Complementary Plateaued Functions

    We introduce the concept of complementary plateaued functions and examine relationships between these newly defined functions and bent functions....
    Yuliang Zheng, **an-Mo Zhang in Information Security and Cryptology - ICISC’99
    Conference paper 2000

  18. What Makes a Problem Hard for XCS?

    Despite two decades of work learning classifier systems researchers have had relatively little to say on the subject of what makes a problem...
    Tim Kovacs, Manfred Kerber in Advances in Learning Classifier Systems
    Conference paper 2001

  19. Performance Contracts: Predicting and Monitoring Grid Application Behavior

    1 Given the dynamic nature of grid resources, adaptation is required to sustain a predictable level of application performance. A prerequisite of...
    Fredrik Vraalsen, Ruth A. Aydt, ... Daniel A. Reed in Grid Computing — GRID 2001
    Conference paper 2001

  20. A Schema Theory Analysis of the Evolution of Size in Genetic Programming with Linear Representations

    In this paper we use the schema theory presented in [20] to better understand the changes in size distribution when using GP with standard crossover...
    Nicholas Freitag McPhee, Riccardo Poli in Genetic Programming
    Conference paper 2001
Did you find what you were looking for? Share feedback.