Skip to content

fast-crypto-lab/Frobenius_AFFT

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

5 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Generate binary polynomial multiplication bit operations using Frobenius additive fast Fourier transform algorithm

Requirement: python3

usage:
$ python affft_codegen.py [log_2(input_size)]

Example:
$ python affft_codegen.py 8
It will generate bit operations of binary polynomial multiplication with two input size 256 and output size 512

About

Frobenius Additive Fourier Transform

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages