Now, What Year Is It? 11125. - Shahin Amrahov; Andrew D. Loveless (Am. Math. Mon., 2006)

A compositeness test that never fails for Carmichael numbers. - Andrew D. Loveless (Math. Comput., 2007)

Optimal and Error-Free Multi-Valued Byzantine Consensus Through Parallel Execution. - Andrew D. Loveless; Ronald G. Dreslinski; Baris Kasikci (IACR Cryptol. ePrint Arch., 2020)

IGOR: Accelerating Byzantine Fault Tolerance for Real-Time Systems with Eager Execution. - Andrew D. Loveless; Ronald G. Dreslinski; Baris Kasikci; Linh Thi Xuan Phan (RTAS, 2021)

Chex-Mix: Combining Homomorphic Encryption with Trusted Execution Environments for Oblivious Inference in the Cloud. - Deepika Natarajan; Andrew D. Loveless; Wei Dai; Ronald G. Dreslinski (EuroS&P, 2023)

PCSPOOF: Compromising the Safety of Time-Triggered Ethernet. - Andrew D. Loveless; Linh Thi Xuan Phan; Ronald G. Dreslinski; Baris Kasikci (SP, 2023)

CrossTalk: Making Low-Latency Fault Tolerance Cheap by Exploiting Redundant Networks. - Andrew D. Loveless; Linh Thi Xuan Phan; Lisa Erickson; Ronald G. Dreslinski; Baris Kasikci (ACM Trans. Embed. Comput. Syst., 2023)