[
https://issues.apache.org/jira/browse/PIRK-40?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=15420450#comment-15420450
]
Ellison Anne Williams commented on PIRK-40:
-------------------------------------------
Pirk doesn't actually have any vectors with zero entries -- all 'zero' bitmasks
are encrypted before placing into a query vector. Thus, sparse vector/matrix
representations wouldn't provide any benefit here.
Also, we do not do any matrix operations (other than to loosely use a matrix
form when describing Wideskies). So, matrix libraries wouldn't help either.
> Explore Options to Increase Efficiency of Modular Multiplication
> ----------------------------------------------------------------
>
> Key: PIRK-40
> URL: https://issues.apache.org/jira/browse/PIRK-40
> Project: PIRK
> Issue Type: Improvement
> Reporter: Ellison Anne Williams
> Assignee: Jacob WIlder
>
> We are using JNAGMP (which wraps some operations in GNU's Multiple Precision
> Arithmetic Library) to improve the performance of modular exponentiation; we
> are benchmarking these improvements with the provide benchmark package.
> JNAGMP does not currently provide wrappings for modular multiplication.
> As modular multiplications are one of our most expensive operations, we need
> to explore methods to increase the efficiency.
--
This message was sent by Atlassian JIRA
(v6.3.4#6332)
