Sept. 21, 2023, 1:10 a.m. | Jiale Chen, Dima Grigoriev, Vladimir Shpilrain

cs.CR updates on arXiv.org arxiv.org

We use tropical algebras as platforms for a very efficient digital signature
protocol. Security relies on computational hardness of factoring one-variable
tropical polynomials; this problem is known to be NP-hard.

computational cryptography digital digital signature digital signatures factoring hard iii platforms problem protocol security signature signatures variable

Social Engineer For Reverse Engineering Exploit Study

@ Independent study | Remote

Principal Business Value Consultant

@ Palo Alto Networks | Chicago, IL, United States

Cybersecurity Specialist, Sr. (Container Hardening)

@ Rackner | San Antonio, TX

Penetration Testing Engineer- Remote United States

@ Stanley Black & Decker | Towson MD USA - 701 E Joppa Rd Bg 700

Internal Audit- Compliance & Legal Audit-Dallas-Associate

@ Goldman Sachs | Dallas, Texas, United States

Threat Responder

@ Deepwatch | Remote