Skip to content

Optimize CRISP circuit by storing only non-zero coefficients for sparse polynomials #949

@cedoor

Description

@cedoor

The circuit can be optimized by avoiding the storage and evaluation of full-degree N-1 polynomials when many coefficients are zero.

Currently, message polynomials are encoded with all N coefficients, even though in practice their degree is often much lower (the minimum degree for the plaintext is $2^{28}$ now).

Metadata

Metadata

Assignees

No one assigned

    Labels

    crispRelated to the crisp example appcryptographyConcerned with cryptographyrefactoringimproving a software's internal structure without changing its external behavior or functionality

    Type

    No fields configured for Task.

    Projects

    No projects

    Relationships

    None yet

    Development

    No branches or pull requests

    Issue actions