all InfoSec news
Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem
Aug. 11, 2022, 2:48 a.m. |
IACR News www.iacr.org
ePrint Report: Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem
Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Jean-Pierre Tillich
The Rank Decoding problem (RD) is at the core of rank-based cryptography. Cryptosystems such as ROLLO and RQC, which made it to the second round of the NIST Post-Quantum Standardization Process, as well as the Durandal signature scheme, rely on it or its variants. This problem can also be seen as a structured version of MinRank, which …
More from www.iacr.org / IACR News
Updatable Policy-Compliant Signatures
1 day, 12 hours ago |
www.iacr.org
Guess and Determine Analysis Based on Set Split
1 day, 12 hours ago |
www.iacr.org
Improving Generic Attacks Using Exceptional Functions
1 day, 12 hours ago |
www.iacr.org
Real-Valued Somewhat-Pseudorandom Unitaries
2 days, 16 hours ago |
www.iacr.org
A Variation on Knellwolf and Meier's Attack on the Knapsack Generator
2 days, 16 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Information Technology Specialist II: Network Architect
@ Los Angeles County Employees Retirement Association (LACERA) | Pasadena, CA
Cybersecurity Skills Challenge -- Sponsored by DoD
@ Correlation One | United States
Security Operations Center (SOC) Analyst
@ GK Cybersecurity Group | Remote
Lead Product Security Engineer
@ Baker Hughes | IN-KA-BANGALORE-NEON BUILDING WEST TOWER
Penetration Tester
@ BT Group | Hemel Hempstead: Riverside (R6, Hemel Hempstead, United Kingdom
Cloud and Infrastructure Security Engineer II
@ StubHub | Los Angeles, CA