Old Web
English
Sign In
Acemap
>
Paper
>
Towards constant-time probabilistic root finding for code-based cryptography
Towards constant-time probabilistic root finding for code-based cryptography
2021
Dúnia Marchiori
Ricardo Felipe Custódio
Daniel Panario
Lucia Moura
Keywords:
Root-finding algorithm
Algorithm
Probabilistic logic
constant
Code (cryptography)
Cryptography
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]