@misc{cryptoeprint:2021/529,
      author = {Nicolas Gailly and Mary Maller and Anca Nitulescu},
      title = {SnarkPack: Practical SNARK Aggregation},
      howpublished = {Cryptology ePrint Archive, Paper 2021/529},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/529}},
      url = {https://eprint.iacr.org/2021/529}
}

@misc{cryptoeprint:2019/099,
      author = {Mary Maller and Sean Bowe and Markulf Kohlweiss and Sarah Meiklejohn},
      title = {Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updateable Structured Reference Strings},
      howpublished = {Cryptology ePrint Archive, Paper 2019/099},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/099}},
      url = {https://eprint.iacr.org/2019/099}
}

@misc{kzg-tmp,
      author = {A. Kate and G. M. Zaverucha and and I. Goldberg},
      title = {Constant-size commitments to polynomials and their application},
      year = {2010},
      note = {\url{https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf}},
      url = {https://www.iacr.org/archive/asiacrypt2010/6477178/6477178.pdf}
}

@misc{bls-sig-eth2,
      author = {Eth2.0},
      title = {Eth2.0 book - BLS signatures},
      year = {2010},
      note = {\url{https://eth2book.info/altair/part2/building_blocks/signatures}},
      url = {https://eth2book.info/altair/part2/building_blocks/signatures}
}
@misc{cryptoeprint:2019/1021,
      author = {Sean Bowe and Jack Grigg and Daira Hopwood},
      title = {Recursive Proof Composition without a Trusted Setup},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1021},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1021}},
      url = {https://eprint.iacr.org/2019/1021}
}

@misc{cryptoeprint:2022/621,
      author = {Arantxa Zapico and Vitalik Buterin and Dmitry Khovratovich and Mary Maller and Anca Nitulescu and Mark Simkin},
      title = {Caulk: Lookup Arguments in Sublinear Time},
      howpublished = {Cryptology ePrint Archive, Paper 2022/621},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/621}},
      url = {https://eprint.iacr.org/2022/621}
}

@misc{cryptoeprint:2022/957,
      author = {Jim Posen and Assimakis A. Kattis},
      title = {Caulk+: Table-independent lookup arguments},
      howpublished = {Cryptology ePrint Archive, Paper 2022/957},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/957}},
      url = {https://eprint.iacr.org/2022/957}
}

@misc{fri,
	author = {Eli Ben-Sasson and Iddo Bentov and Yinon Horesh and Michael Riabzev},
	title = {Fast Reed-Solomon Interactive Oracle Proofs of Proximity},
	year = {2018},
	note = {\url{https://eccc.weizmann.ac.il/report/2017/134/}},
	url = {https://eccc.weizmann.ac.il/report/2017/134/}
}
@misc{cryptoeprint:2022/1216,
      author = {Ulrich Haböck},
      title = {A summary on the FRI low degree test},
      howpublished = {Cryptology ePrint Archive, Paper 2022/1216},
      year = {2022},
      note = {\url{https://eprint.iacr.org/2022/1216}},
      url = {https://eprint.iacr.org/2022/1216}
}
@misc{cryptoeprint:2019/1020,
      author = {Alexander Vlasov and Konstantin Panarin},
      title = {Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity},
      howpublished = {Cryptology ePrint Archive, Paper 2019/1020},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/1020}},
      url = {https://eprint.iacr.org/2019/1020}
}
@misc{cryptoeprint:2024/390,
      author = {Gal Arnon and Alessandro Chiesa and Giacomo Fenzi and Eylon Yogev},
      title = {{STIR}: Reed–Solomon Proximity Testing with Fewer Queries},
      howpublished = {Cryptology {ePrint} Archive, Paper 2024/390},
      year = {2024},
      note = {\url{https://eprint.iacr.org/2024/390}},
      url = {https://eprint.iacr.org/2024/390}
}


@misc{cryptoeprint:2021/370,
      author = {Abhiram Kothapalli and Srinath Setty and Ioanna Tzialla},
      title = {Nova: Recursive Zero-Knowledge Arguments from Folding Schemes},
      howpublished = {Cryptology ePrint Archive, Paper 2021/370},
      year = {2021},
      note = {\url{https://eprint.iacr.org/2021/370}},
      url = {https://eprint.iacr.org/2021/370}
}

@misc{vincenzoiovino,
      title = {{Vincenzo Iovino}},
      note = {\url{https://sites.google.com/site/vincenzoiovinoit/}},
      url = {https://sites.google.com/site/vincenzoiovinoit/}
}
@misc{hectormasipardevol,
      title = {{Héctor Masip Ardevol}},
      note = {\url{https://hecmas.github.io}},
      url = {https://hecmas.github.io}
}
@misc{fri-impl,
      note = {\url{https://github.com/arnaucube/fri-commitment}},
      url = {https://github.com/arnaucube/fri-commitment}
}

@misc{cryptoeprint:2019/550,
      author = {Srinath Setty},
      title = {Spartan: Efficient and general-purpose zkSNARKs without trusted setup},
      howpublished = {Cryptology ePrint Archive, Paper 2019/550},
      year = {2019},
      note = {\url{https://eprint.iacr.org/2019/550}},
      url = {https://eprint.iacr.org/2019/550}
}

@misc{cryptoeprint:2023/552,
      author = {Srinath Setty and Justin Thaler and Riad Wahby},
      title = {Customizable constraint systems for succinct arguments},
      howpublished = {Cryptology ePrint Archive, Paper 2023/552},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/552}},
      url = {https://eprint.iacr.org/2023/552}
}
@misc{cryptoeprint:2023/573,
      author = {Abhiram Kothapalli and Srinath Setty},
      title = {HyperNova: Recursive arguments for customizable constraint systems},
      howpublished = {Cryptology ePrint Archive, Paper 2023/573},
      year = {2023},
      note = {\url{https://eprint.iacr.org/2023/573}},
      url = {https://eprint.iacr.org/2023/573}
}

@ARTICLE{10177902,
  author={Satriawan, Ardianto and Syafalni, Infall and Mareta, Rella and Anshori, Isa and Shalannanda, Wervyan and Barra, Aleams},
  journal={IEEE Access}, 
  title={Conceptual Review on Number Theoretic Transform and Comprehensive Review on Its Implementations}, 
  year={2023},
  volume={11},
  number={},
  pages={70288-70316},
  keywords={Convolution;Complexity theory;Discrete Fourier transforms;Cryptography;Quantum computing;Homomorphic encryption;Toy manufacturing industry;Quantum computing;Number theoretic transform;post quantum cryptography;homomorphic encryption},
  doi={10.1109/ACCESS.2023.3294446}
}
