From 179fbe84e668b23929ba4ce9c68c180c6f9114a7 Mon Sep 17 00:00:00 2001 From: dan Date: Thu, 4 Jan 2024 06:39:16 +0000 Subject: [PATCH] chore: fix comment (Gil99 is M2A) (#89) * chore: fix comment (Gil99 is M2A) * Update share-conversion/mpz-share-conversion/src/lib.rs Co-authored-by: th4s --------- Co-authored-by: th4s --- share-conversion/mpz-share-conversion/src/lib.rs | 8 ++++---- 1 file changed, 4 insertions(+), 4 deletions(-) diff --git a/share-conversion/mpz-share-conversion/src/lib.rs b/share-conversion/mpz-share-conversion/src/lib.rs index 1c81ce00..7608954a 100644 --- a/share-conversion/mpz-share-conversion/src/lib.rs +++ b/share-conversion/mpz-share-conversion/src/lib.rs @@ -1,9 +1,9 @@ -//! This crate provides a semi-honest protocol (with optional covert-security) for converting secret-shared finite field elements +//! This crate provides a semi-honest protocol (with optional covert security) for converting secret-shared finite field elements //! between additive and multiplicative representations. //! -//! The protocol is based on `Two Party RSA Key Generation [Gil99]` which devised a method for -//! converting additive shares of a finite field element into multiplicative shares (A2M). We use a similar technique -//! to convert multiplicative shares into additive shares (M2A), inspired by `Efficient Secure Two-Party Exponentiation [YCCL11]`. +//! The protocol is based on `Two Party RSA Key Generation [Gil99]` which describes a method for +//! converting multiplicative shares of a finite field element into additive shares (M2A). We use a similar technique +//! to convert additive shares into multiplicative shares (A2M), inspired by `Efficient Secure Two-Party Exponentiation [YCCL11]`. #![deny(missing_docs, unreachable_pub, unused_must_use)] #![deny(clippy::all)]