intTypePromotion=1
ADSENSE

Closest vector problem

Xem 1-1 trên 1 kết quả Closest vector problem
  • We present a polynomial-time algorithm that provably recovers the signer’s secret DSA key when a few bits of the random nonces k (used at eachsignature generation) are known for a number of DSA signatures at most linear inlog q (q denoting as usual the small prime of DSA), under a reasonable assumption on the hash function used in DSA.

    pdf26p dunglh2013 02-04-2014 46 1   Download

CHỦ ĐỀ BẠN MUỐN TÌM

TOP DOWNLOAD
ADSENSE

p_strKeyword=Closest vector problem
p_strCode=closestvectorproblem

nocache searchPhinxDoc

 

Đồng bộ tài khoản
2=>2