作者: Luk Bettale , Jean-Charles Faugère , Ludovic Perret
DOI: 10.1007/978-3-540-68164-9_10
关键词:
摘要: In this paper, we investigate the security of Tractable Rationale Maps Signature (TRMS) signature scheme [9] proposed at PKC'05. To do so, present a hybrid approach for solving algebraic systems naturally arising when mounting signature-forgery attack. The basic idea is to compute Grobner bases several modified rather than basis initial system. We have been able provide precise bound on (worst-case) complexity approach. For that, however assumed technical condition in our attack; namely are semi-regular [3,5]. This claim supported by experimental evidences. Finally, it turns out that efficient. obtained bounded from above 257 forge parameters designers TRMS [9]. can be improved; assuming an access 216 processors (which very reasonable), one actually approximately 51 hours.