Benchmarks for Encryption Schemes

[jnsiemer]

Description
This PR implements...

• more detailed benchmarks for PK Encryption schemes (Regev and RingLPR)
• starts a re-structuring process to write such detailed benchmarks for almost all implemented schemes

Checklist:

• I have performed a self-review of my own code
  • The code provides good readability and maintainability s.t. it fulfills best practices like talking code, modularity, ...
    • The chosen implementation is not more complex than it has to be
  • My code should work as intended and no side effects occur (e.g. memory leaks)
  • The doc comments fit our style guide

[Marvin-Beckmann]

May also be useful to upload the results of the benchmarks somewhere/ automatically push them into some other repository or similar.

Consider the following idea if you want to keep the precomputed values as consitants:
make a seperate module that contains all these precomputed values.
This way the corresponding files where the benchmarks themselves are shorter, especially as the explicit values of the constants are not as important anyways.

Nice work 👍

[Marvin-Beckmann]

better use .json for the file format

[Marvin-Beckmann]

see above

[Marvin-Beckmann]

very long lines, please add linebreaks

[Marvin-Beckmann]

see above

[Marvin-Beckmann]

there is also the option to use serde_json::from_reader, but I am not quite shure which alternative is better

[Marvin-Beckmann]

match statement

[Marvin-Beckmann]

match statement

[Marvin-Beckmann]

Here was also a clippy warning

Suggested change

	if size_n == &SizeN::Large {
	let modulus =
	qfall_crypto::utils::common_moduli::new_anticyclic(512, 92897729).unwrap();
	let poly: PolyOverZ = serde_json::from_str(LARGE_SK).unwrap();
	let sk = PolynomialRingZq::from((poly, &modulus));
	sk
	} else {
	let modulus = qfall_crypto::utils::common_moduli::new_anticyclic(16, 2399).unwrap();
	let poly: PolyOverZ = serde_json::from_str(SMALL_SK).unwrap();
	let sk = PolynomialRingZq::from((poly, &modulus));
	sk
	}
	match size_n {
	SizeN::Large => {
	let modulus =
	qfall_crypto::utils::common_moduli::new_anticyclic(512, 92897729).unwrap();
	let poly: PolyOverZ = serde_json::from_str(LARGE_SK).unwrap();
	PolynomialRingZq::from((poly, &modulus))
	}
	SizeN::Small => {
	let modulus = qfall_crypto::utils::common_moduli::new_anticyclic(16, 2399).unwrap();
	let poly: PolyOverZ = serde_json::from_str(SMALL_SK).unwrap();
	PolynomialRingZq::from((poly, &modulus))
	}
	}

[Marvin-Beckmann]

here you include it as a constant, because it is shorter?
Seems a little inconsistent compared to how you did it in the general encryption case

[Marvin-Beckmann]

May want to add them for this and the following docs of the functions

Suggested change

	/// Benchmark [ring_lpr_full_cycle_dyn] with `n = 8, 16, 32, 64, 128, 256, 512, 1024`
	/// Benchmark [`ring_lpr_full_cycle_dyn`] with `n = 8, 16, 32, 64, 128, 256, 512, 1024`