Browse problems

7 problems

Linear code beating the Grassl table open

Find a linear code over \mathrm{GF}(q) of length n and dimension k whose minimum distance d exceeds the best one known for those parameters.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Radar pulse of length 106 with peak sidelobe 5 open

Find a longer coded pulse whose false echoes stay as weak as the best short ones.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Thinner triple bandpass optical filter open

Design a multilayer coating that passes three colour bands, blocks four others, and is thinner than the best design of an international contest.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Collision on 36 steps of SHA-256 open

Produce two different messages that have the same fingerprint under SHA-256 cut down to 36 of its 64 steps.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
AES S-box circuit with fewer than 113 gates open

Find a smaller logic circuit for the AES S-box, the 8-bit to 8-bit substitution table at the heart of AES encryption.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Laser beam splitter into 7x7 equal beams open

Design a flat two-level pattern that splits one laser beam into a 7 by 7 array of equal beams as efficiently as the best known grating for a single row of 7.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0
Multiply 4x4 matrices with 47 multiplications open

Find a recipe that multiplies two 4 × 4 matrices using at most 47 scalar multiplications, with rational coefficients.

Buyers offer
—
no quotes
Sellers ask
—
♥ 0