In March of 2020, with the full magnitude of the COVID-19 pandemic yet to be seen, Costa and Martin released a report through the Economic Policy Institute noting that "To prevent infections and the spread of COVID-19 on farms, farm employers should be planning and implementing safety measures to protect their employees" (Costa D, Martin P, Coronavirus and farmworkers: farm employment, safety issues, and the H-2A guestworker program, Economic Policy Institute, https://www.epi.org/publication/coronavirus-and-farmworkers-h-2a/, 2020). The report goes on to provide multiple observations recognizing the seasonal nature of farm work, effects increased unemployment may have on the workforce, industry dependence on H-2A visa farm workers, impact school closings would have on worker availability, and includes recommendations for safety equipment, social distancing, as well as worker housing and transportation. This paper focuses on the worker housing component of those recommendations and describes an effort to rapidly develop and deploy a computationally efficient, web-based, low-fidelity mathematical model of COVID-19 spread in dormitory style housing to support education and mitigation strategies for the historically underserved farmworker community.
In supersingular isogeny-based cryptography, the path-finding problem reduces to the endomorphism ring problem. Can path-finding be reduced to knowing just one endomorphism? It is known that a small degree endomorphism enables polynomial-time path-finding and endomorphism ring computation (in: Love and Boneh, ANTS XIV-Proceedings of the Fourteenth Algorithmic Number Theory Symposium, volume 4 of Open Book Ser. Math. Sci. Publ., Berkeley, 2020). An endomorphism gives an explicit orientation of a supersingular elliptic curve. In this paper, we use the volcano structure of the oriented supersingular isogeny graph to take ascending/descending/horizontal steps on the graph and deduce path-finding algorithms to an initial curve. Each altitude of the volcano corresponds to a unique quadratic order, called the primitive order. We introduce a new hard problem of computing the primitive order given an arbitrary endomorphism on the curve, and we also provide a sub-exponential quantum algorithm for solving it. In concurrent work (in: Wesolowski, Advances in cryptology-EUROCRYPT 2022, volume 13277 of Lecture Notes in Computer Science. Springer, Cham, 2022), it was shown that the endomorphism ring problem in the presence of one endomorphism with known primitive order reduces to a vectorization problem, implying path-finding algorithms. Our path-finding algorithms are more general in the sense that we don't assume the knowledge of the primitive order associated with the endomorphism.
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：