• DocumentCode
    2838517
  • Title

    Generation of binary sequences for cryptographic applications

  • Author

    Jamadagni, H.S. ; Von Allmen, L.A. ; Shah, A.V.

  • fYear
    1989
  • fDate
    22-24 Nov 1989
  • Firstpage
    953
  • Lastpage
    955
  • Abstract
    Probability theory of binary random sequences is used to characterize Boolean memoryless combining functions of n variables producing an output binary sequence Z. This is used to define conditions on the truth table of the function such that the latter is a mth order correlation-immune. Algorithms to generate mth and (m+1)st order correlation-immune functions of (n+1) variables from a mth order correlation-immune function of n variables are also derived
  • Keywords
    Boolean functions; binary sequences; cryptography; probability; Boolean memoryless combining functions; binary random sequences; correlation-immune functions; cryptographic applications; output binary sequence; truth table; Autocorrelation; Binary sequences; Cryptography; Input variables; Probability; Random sequences; Sufficient conditions;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    TENCON '89. Fourth IEEE Region 10 International Conference
  • Conference_Location
    Bombay
  • Type

    conf

  • DOI
    10.1109/TENCON.1989.177089
  • Filename
    177089
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=2838517