activity
20112025
most citedUniversal Padé approximants on simply connected domains

5 citations · 7 across the 6 of their papers we have counts for

collaborators
Showing 2024Show all

1 paper · 1 filter

cs.CR2024

Post-quantum encryption algorithms of high-degree 3-variable polynomial congruences: BS cryptosystems and BS key generation

Nicholas J. Daras

We will construct post-quantum encryption algorithms based on three-variable polynomial Beal-Schur congruence. After giving a proof of Beal's conjecture and citing some application…