摘要
Patarinproposedthedragonscheme,pointedouttheinsecurityofthedragonalgorithmwithonehiddenmonomialandsuggestedacandidatedragonsignaturealgorithmwithacomplicatedfunction.Thispaperpresentsanalgebraicmethodtoattackthecandidatedragonsignaturealgorithm.TheattackborrowsthebasicideaoftheattackduetoKipnisandShamir,andutilizestheunderlyingalgebraicstructureofthecandidatedragonsignaturealgorithmovertheextensionfieldtoderiveawaytoenablethevariableYbeviewedasafixedvalue.Theattackrecoverstheprivatekeysefficientlywhentheparametersaren≤25andD=[logqd]≤3.
出版日期
2010年04月14日（中国期刊网平台首次上网日期，不代表论文的发表时间）
