## Abstract

An m × n matrix A = (a_{i, j}) is circulant if a_{i+1,j+1} = a_{i, j} where the subscripts are reduced modulo n. A question arising in stream cypher cryptanalysis is reframed as follows: For given n, what is the maximum value of m for which there exists a circulant m × n (±1)-matrix A such that AA^{T} = nI_{m}. In 2013, Craigen et al. called such matrices circulant partial Hadamard matrices (CPHMs). They proved some important bounds and compiled a table of maximum values of m for small n via computer search. The matrices and algorithm are not in the literature. In this paper, we introduce general difference sets (GDSs), and derive a result that connects GDSs and CPHMs. We propose an algorithm, the difference variance algorithm (DVA), which helps us to search GDSs. In this work, the GDSs with respect to CPHMs listed by Craigen et al. when r = 0, 2 are found by DVA, and some new lower bounds are given for the first time.

Original language | English (US) |
---|---|

Pages (from-to) | 1715-1724 |

Number of pages | 10 |

Journal | Statistica Sinica |

Volume | 27 |

Issue number | 4 |

DOIs | |

State | Published - Oct 2017 |

## Keywords

- Circulant partial hadamard matrices
- Functional magnetic resonance imaging (fMRI)
- General difference sets

## ASJC Scopus subject areas

- Statistics and Probability
- Statistics, Probability and Uncertainty