Atomic Broadcast is a communication primitive that ensures total ordering of messages in distributed systems. This primitive is particularly useful to maintain the consistency of replicated information despite concurrency and failures. This paper addresses the problem of designing an Atomic Broadcast protocol in an asynchronous distributed system where processes can exhibit malicious failures (i.e., processes are Byzantine). We point out the impact of those kind of failures on the modularity of the protocol.