Handbook of Formal Analysis and Verification in Cryptography
Shipping & Delivery
Our Delivery Time Frames Explained
2-4 Working Days: Available in-stock
14-28 Working Days: On Backorder
Will Deliver When Available: On Pre-Order or Reprinting
We ship your order once all items have arrived at our warehouse and are processed. Need those 2-4 day shipping items sooner? Just place a separate order for them!
Product details
- ISBN 9780367546656
- Weight: 980g
- Dimensions: 156 x 234mm
- Publication Date: 19 Sep 2023
- Publisher: Taylor & Francis Ltd
- Publication City/Country: GB
- Product Form: Hardback
This handbook of formal analysis in cryptography is very important for secure communication and processing of information. It introduces readers to several formal verification methods and software used to analyse cryptographic protocols. The chapters give readers general knowledge and formal methods focusing on cryptographic protocols.
Handbook of Formal Analysis and Verification in Cryptography includes major formalisms and tools used for formal verification of cryptography, with a spotlight on new-generation cryptosystems such as post-quantum, and presents a connection between formal analysis and cryptographic schemes. The text offers formal methods to show whether security assumptions are valid and compares the most prominent formalism and tools as they outline common challenges and future research directions.
Graduate students, researchers, and engineers worldwide will find this an exciting read.
Sedat Akleylek received the B.Sc. degree in Mathematics majored in Computer Science from Ege University in 2004 in Izmir, Turkey, M.Sc. and Ph.D. degrees in Cryptography from Middle East Technical University in 2008 and 2010, in Ankara, Turkey, respectively. He is currently employed as an associate professor at the Department of Computer Engineering, Ondokuz Mayis University, Samsun, Turkey since 2016. His research interests include in the areas of post-quantum cryptography, algorithms, cryptographic protocols, and architectures for computations in finite fields. He has published more than 20 papers on those topics and presented his work at more than 45 conference papers. He is involved in several nationally and internationally funded research projects on cryptography focusing post-quantum ones.
Besik Dundua is an expert in formal methods. He received his PhD degree from the University of Porto in computer science. Afterwards, he worked as a postdoc and visiting researcher in Brazil (University of Brasilia), Austria (Johannes Kepler University Linz), and Germany (The University of Stuttgart). His work concerns various aspects of verification, computational logic, and formal languages: foundational formalisms, computational mechanisms, and implementation ideas. He has published more than 20 papers on those topics and presented his work at more than 30 conference.
