pub struct ModularAddition<State>(/* private fields */);Expand description
Because the new state is derived by adding the “working variables” to the current state, the Davies-Meyer step in SHA-1 and SHA-2 is modular addition.
Trait Implementations§
Source§impl<State> DaviesMeyerStep for ModularAddition<State>
impl<State> DaviesMeyerStep for ModularAddition<State>
Auto Trait Implementations§
impl<State> Freeze for ModularAddition<State>
impl<State> RefUnwindSafe for ModularAddition<State>where
State: RefUnwindSafe,
impl<State> Send for ModularAddition<State>where
State: Send,
impl<State> Sync for ModularAddition<State>where
State: Sync,
impl<State> Unpin for ModularAddition<State>where
State: Unpin,
impl<State> UnwindSafe for ModularAddition<State>where
State: UnwindSafe,
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more