all InfoSec news
Revisiting Pairing-friendly Curves with Embedding Degrees 10 and 14
Dec. 25, 2023, 8:48 a.m. |
IACR News www.iacr.org
ePrint Report: Revisiting Pairing-friendly Curves with Embedding Degrees 10 and 14
Yu Dai, Debiao He, Cong Peng, Zhijian Yang, Chang-an Zhao
Since 2015, there has been a significant decrease in the asymptotic complexity of computing discrete logarithms in finite fields. As a result, the key sizes of many mainstream pairing-friendly curves have to be updated to maintain the desired security level. In PKC'20, Guillevic conducted a comprehensive assessment of the security of a series of pairing-friendly curves with embedding degrees …
complexity computing dai eprint report key logarithms report result the key
More from www.iacr.org / IACR News
Postdoctoral Researcher
1 day, 11 hours ago |
www.iacr.org
Blink: An Optimal Proof of Proof-of-Work
2 days, 11 hours ago |
www.iacr.org
PN-based Attacks in the White-box Setting
2 days, 11 hours ago |
www.iacr.org
Succinct Functional Commitments for Circuits from k-Lin
2 days, 17 hours ago |
www.iacr.org
Levin–Kolmogorov Complexity is not in Linear Time
2 days, 17 hours ago |
www.iacr.org
Unstructured Inversions of New Hope
2 days, 17 hours ago |
www.iacr.org
Jobs in InfoSec / Cybersecurity
Security Engineer
@ Celonis | Munich, Germany
Security Engineer, Cloud Threat Intelligence
@ Google | Reston, VA, USA; Kirkland, WA, USA
IT Security Analyst*
@ EDAG Group | Fulda, Hessen, DE, 36037
Scrum Master/ Agile Project Manager for Information Security (Temporary)
@ Guidehouse | Lagunilla de Heredia
Waste Incident Responder (Tanker Driver)
@ Severn Trent | Derby , England, GB
Risk Vulnerability Analyst w/Clearance - Colorado
@ Rothe | Colorado Springs, CO, United States