Artifact for Vectorial Fast Correlation Attacks.

Overview.

This artifact partially verifies the result of the related paper "Vectorial Fast Correlation Attacks"
The code is mainly used to verify the result aproximations and comlexity of Grain family algorithm.

How to compile.

The code is written by C++.
Please use make to compile them.

How to use.

For the SageMath code: The .ipynb notebook contains the complexity calculations for Grain-v1, Grain-128a and Sosemanuk. Simply copy the file into your SageMath root directory and run it; no specific SageMath version is required.

For the correlation search: use make to compile them and obtain the approximations for the Grainv1.

For the graph code: use make to compile them and generate the graph corresponding to the complex Boolean polynomial given in the file S1.txt. The graph need to open with Graphviz.

For the reduced_grain: use make to compile them and get the result with the true key on the top.

LICENSE

Copyright (c) [2025] [BinZhang]

Permission is hereby granted, free of charge, to any person obtaining a copy
of this software and associated documentation files (the "Software"), to deal
in the Software without restriction, including without limitation the rights
to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
copies of the Software, and to permit persons to whom the Software is
furnished to do so, subject to the following conditions:

The above copyright notice and this permission notice shall be included in all
copies or substantial portions of the Software.

THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
SOFTWARE.