all InfoSec news
Split Gröbner Bases for Satisfiability Modulo Finite Fields
April 16, 2024, 2:18 a.m. |
IACR News www.iacr.org
ePrint Report: Split Gröbner Bases for Satisfiability Modulo Finite Fields
Alex Ozdemir, Shankara Pailoor, Alp Bassa, Kostas Ferles, Clark Barrett, Işil Dillig
Satisfiability modulo finite fields enables automated verification for cryptosystems. Unfortunately, previous solvers scale poorly for even some simple systems of field equations, in part because they build a full Gröbner basis (GB) for the system. We propose a new solver that uses multiple, simpler GBs instead of one full GB. Our solver, implemented within the cvc5 SMT solver, …
alex automated build eprint report report scale simple systems verification
More from www.iacr.org / IACR News
$\mathsf{FRAST}$: TFHE-friendly Cipher Based on Random S-boxes
2 days, 12 hours ago |
www.iacr.org
A Deniability Analysis of Signal's Initial Handshake PQXDH
2 days, 12 hours ago |
www.iacr.org
BGJ15 Revisited: Sieving with Streamed Memory Access
2 days, 12 hours ago |
www.iacr.org
Quantum Key-Revocable Dual-Regev Encryption, Revisited
2 days, 12 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Security Engineers
@ D. E. Shaw Research | New York City
Technology Security Analyst
@ Halton Region | Oakville, Ontario, Canada
Senior Cyber Security Analyst
@ Valley Water | San Jose, CA
Security Operations Manager-West Coast
@ The Walt Disney Company | USA - CA - 2500 Broadway Street
Vulnerability Analyst - Remote (WFH)
@ Cognitive Medical Systems | Phoenix, AZ, US | Oak Ridge, TN, US | Austin, TX, US | Oregon, US | Austin, TX, US
Senior Mainframe Security Administrator
@ Danske Bank | Copenhagen V, Denmark