Finding vulnerable curves over finite fields of characteristic 2 by pairing reduction


In this paper, we aim at sustaining the claim that curve-based cryptographic schemes over finite fields of characteristic 2 do not provide enough security. We present algorithms to find all the possible supersingular elliptic curves which can be embedded into a predefined finite field. We also consider the case of hyperelliptic curves with genus 2… (More)
DOI: 10.1109/ICIS.2017.7960080

2 Figures and Tables


  • Presentations referencing similar topics