Struct Poly1305

pub struct Poly1305 { /* private fields */ }

Poly1305 MAC (branch-free limb arithmetic)

Implementations

impl Poly1305

pub fn new(key: &[u8]) -> Result<Self>

Construct a new Poly1305 context from a 32-byte key.

The key is split into the clamped r portion (first 16 bytes) and the s portion (last 16 bytes) exactly as specified in RFC 8439 §2.5.2.

pub fn update(&mut self, chunk: &[u8]) -> Result<()>

Absorb additional message data into the MAC state.

This can be called zero or more times before Self::finalize.
Data is internally buffered in 16-byte blocks.
Always returns Ok(()) (provided for API symmetry).

pub fn finalize(self) -> Tag<POLY1305_TAG_SIZE>

Consume the context and return the 16-byte authentication tag.

After this call the Poly1305 instance must be discarded because its internal key material has been moved.

Trait Implementations

impl Clone for Poly1305

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Drop for Poly1305

fn drop(&mut self)

Executes the destructor for this type.

impl Mac for Poly1305

type Key = [u8; 32]

Key type with appropriate algorithm binding

type Tag = Tag<POLY1305_TAG_SIZE>

Tag output type with appropriate size constraint

fn new(key: &[u8]) -> Result<Self>

Creates a new MAC instance with the given key

fn update(&mut self, data: &[u8]) -> Result<&mut Self>

Updates the MAC state with data, returning self for method chaining

fn finalize(&mut self) -> Result<Self::Tag>

Finalizes and returns the MAC tag

fn reset(&mut self) -> Result<()>

Reset the MAC state for reuse

fn compute_tag(key: &[u8], data: &[u8]) -> Result<Self::Tag>

One-shot MAC computation

fn verify_tag(key: &[u8], data: &[u8], tag: &[u8]) -> Result<bool>

Verify a MAC tag in constant time

impl Zeroize for Poly1305

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.