Extension of simultaneous Diophantine approximation algorithm for partial approximate common divisor variants
Abstract A simultaneous Diophantine approximation (SDA) algorithm takes instances of the partial approximate common divisor (PACD) problem as input and outputs a solution. While several encryption schemes have been published and their securities depend on the presumed hardness of variant of the PACD...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-11-01
|
| Series: | IET Information Security |
| Online Access: | https://doi.org/10.1049/ise2.12032 |