Mathematica Bulban Map NIST Optimization
Budget: $10 – $30 USD
I am working with the 1-D Bulban chaotic map in Mathematica and now need to push it further. The task starts with a mathematical tweak: introduce one additional term to the map and verify that the sequence it produces is truly more random. Please write clean, efficient Mathematica code (compiled or vectorised where possible) so that long sample runs finish quickly inside a notebook.
After the modification, run the complete NIST Statistical Test Suite. I am not interested in just the Monobit, Runs or Spectral checks—every single STS test has to pass and the p-values must be clearly documented.
The same map underpins my Bulban-map-based encryption scheme. Once the keystream generator is ready, implement the cipher, encrypt a provided plaintext and:
• re-run the full NIST STS on the keystream
• show that the ciphertext–plaintext pair survives white, salt-and-pepper, and Gaussian noise attacks at several SNR levels, with lossless recovery after decryption
Deliverables are a well-commented .nb file, any helper scripts you used to call the NIST tools, and a concise report with plots, tables of p-values, runtime figures and noise-attack results.
Acceptance criteria: every STS sub-test must pass at α = 0.01, a 1 million-sample run should complete within minutes, and the decrypted output must be identical to the original after each noise scenario.
I have a specific encryption algorithm that I want to test. Bulban map along with 2 other techniques.
After the modification, run the complete NIST Statistical Test Suite. I am not interested in just the Monobit, Runs or Spectral checks—every single STS test has to pass and the p-values must be clearly documented.
The same map underpins my Bulban-map-based encryption scheme. Once the keystream generator is ready, implement the cipher, encrypt a provided plaintext and:
• re-run the full NIST STS on the keystream
• show that the ciphertext–plaintext pair survives white, salt-and-pepper, and Gaussian noise attacks at several SNR levels, with lossless recovery after decryption
Deliverables are a well-commented .nb file, any helper scripts you used to call the NIST tools, and a concise report with plots, tables of p-values, runtime figures and noise-attack results.
Acceptance criteria: every STS sub-test must pass at α = 0.01, a 1 million-sample run should complete within minutes, and the decrypted output must be identical to the original after each noise scenario.
I have a specific encryption algorithm that I want to test. Bulban map along with 2 other techniques.