Code-based cryptosystems are promising candidates for post-quantum cryptography since they are fast, require only basic arithmetic because their security is well understood. The increasing number of cryptographic schemes based on codes over fields other than &Fopf; 2< small>< sub> presents, however, security issues that are not relevant in the case of binary codes; such constructions, therefore, requires separate assessment. information set decoding isd is one most important generic attacks against code-based cryptosystems. we give lower bounds for over __cf__38;fopf; q< small>< sub>, thereby anticipating future software and hardware improvements. our results allow to compute conservative parameters for cryptographic applications. while most security proofs assume that an attacker does not have any additional information about the secret, we show in certain scenarios can gain partial knowledge of secret. we present how this be used improve efficiency attack give new bounds complexity such attack. in paper, analyse two types including concrete idea prevent leakage attacker.