Old Web
English
Sign In
Acemap
>
Paper
>
Recovering short secret keys of RLCE in polynomial time.
Recovering short secret keys of RLCE in polynomial time.
2018
Alain Couvreur
Matthieu Lequesne
Jean-Pierre Tillich
Keywords:
Time complexity
Discrete mathematics
Computer science
Correction
Cite
Save
Machine Reading By IdeaReader
0
References
0
Citations
NaN
KQI
[]