1 citations · 2 across the 2 of their papers we have counts for
2 papers
cs.CR2022★ 1 cited
Linear recurrent cryptography: golden-like cryptography for higher order linear recurrences
Sergiy Koshkin, Daniel Rodriguez
We develop matrix cryptography based on linear recurrent sequences of any order that allows securing encryption against brute force and chosen plaintext attacks. In particular, we…
math.LO2016★ 1 cited
The HOD Dichotomy
Hugh Woodin, Jacob Davis, Daniel Rodriguez
This paper provides an accessible introduction to some of the work of Woodin on suitable extender models. We define the HOD conjecture, prove it is equivalent to a formulation in t…