Signcryption Schemes Based on the RSA Problem

DOI10.1007/978-3-540-89411-7_6zbMath1217.68086OpenAlexW58954644MaRDI QIDQ3000032

John Malone-Lee, Alexander W. Dent

Publication date: 18 May 2011

Published in: Practical Signcryption (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-89411-7_6

zbMATH Keywords

Feistel networkspadding schemes

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A code-based hybrid signcryption scheme

Cites Work

• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• A method for obtaining digital signatures and public-key cryptosystems
• Advances in Cryptology – CRYPTO 2004
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Signcryption Schemes Based on the RSA Problem