Existence of Modular Sonar Sequences of Twin-Prime Product Length

In this paper, we investigate the existence of modular sonar sequences of length v and mod v where v is a product of twin primes. For v = 3 · 5 = 15, we have found some old and new examples by exhaustive search. However, the very next case v = 5 · 7 = 35 is completely open, in that neither we know (have) an example, nor we prove the nonexistence. We describe simply some approach to locate a single example of modular sonar sequences of length 35 and mod 35, assuming (or hoping) that one exists. Dedicated to Solomon W. Golomb on his 75th birthday

• Type: Conference
• Year: 2007
• Where: SSC
• Authors: Sung-Jun Yoon, Hong-Yeop Song
• Keywords: Cryptography, Exhaustive Search, Modular Sonar Sequences, SSC 2007, Twin Primes