Asymmetric cryptographic primitives resolved the problem of key distribution that plagued secure communication up until 1976. It was in 1976 that Diffie, Hellman and Merkle founded a secure key exchange method and revolutionized secure communication. Then in 1978, Rivest, Shamir and Adleman published the world’s first public key encryption scheme now known as the RSA. Since then research interest in asymmetric cryptographic primitives increased. Namely this is due to the following objectives (not limited to and not in descending order of importance):

- To be able to utilize shorter keys
- To have faster speed
- To be able to increase data payload to be transmitted
- To be IND – CCA secure in the standard model
- To have simple mathematical structure for easy implementation
- To have a hard mathematical problem reasoning which is beyond conjecture
- To extend the mathematical proof on the restricted availability in obtaining solution and not only on existing computing in capabilities
- To be post quantum secure

Hence, the main purpose of this workshop is to provide an international discussion for academics, scientific researchers, engineers, and industrial partners for exchanging new ideas as well as the latest developments in this area of research. Secondary purpose is to promote research collaboration between participants from different countries and disciplines.

Topics (not limited to):

- Asymmetric design
- Asymmetric cryptanalysis
- Elliptic Curve Cryptography
- Digital signature design
- Integer Factorization
- Discrete Log Problem
- Lattices
- Provable secure asymmetric design
- Secure asymmetric implementation