Lots of efforts in the last decades have been done to prove or disprove whether the set of polynomially bounded problems is equal to the set of polynomially verifiable problems. T...
Sina Jafarpour, Mohammad Ghodsi, Keyvan Sadri, Zuh...
In the upcoming high transmission rate system, based on code division multiple access, standard multi-user detection methods are restricted because of performance and implementati...
Dynamic environments represent a quite complex domain, where the information available changes continuously. In this paper, a contingency response system for dynamic environments c...
We introduce the notion of key stretching, a mechanism to convert short s-bit keys into longer keys, such that the complexity required to brute-force search a s + t-bit keyspace is...
John Kelsey, Bruce Schneier, Chris Hall, David Wag...
Tool environments supporting the development of complex products need to be open and flexible. These requirements cannot be fulfilled in an adequate way by predefined coordinat...