This paper presents two fully self-organized key management schemes for mobile ad hoc networks. Unlike most previous schemes, there is no priori shared secret or no priori trust relationship in the proposed scheme; every node plays the same role and carries out the same function of key management. The certificate request scheme consists of Handshaking (HS) and Certificate Request/Reply (CRR) procedures. In HS, a node acquires the public key of the approaching node via a secure side channel, and each node makes and stores the other node’s public key certificate. In CRR, a node requests a remote node’s certificates via a radio channel to the other nodes that it has HSed. The certificate retrieval scheme includes HS and Certificate Retrieval (CR) procedure. In HS, each node makes the other node’s certificate and gives it to the node. In CR, a node requests a remote node’s certificates to the remote node. The certificates are issued by other nodes that had HSed the remote node. In both schemes, the node verifies the received certificates with the public keys acquired by HS. If the number of received valid certificates that contain the same public key exceeds a given threshold, the node accepts the remote node’s public key as valid. Certificate revocation methods are also presented in both schemes. Security is rigorously analyzed against various known attacks. Performance and network costs are intensively analyzed mathematically. Using this analysis, parameter selection guidelines to optimize performance and security for diverse cases are proposed. Simulation results show that every node acquires the public keys of all other nodes at least 5 times faster than in a previous scheme. Features of proposed schemes are analyzed and compared with previous methods. Additional considerations for applying the proposed schemes to other special area are also presented.