TU Darmstadt / ULB / TUbiblio

Viable Approach to Machine-Checked Correctness Proof of Algorithm Variants in Elliptic Curve Cryptography

Anikeev, Maxim ; Madlener, Felix ; Schlosser, Andreas ; Huss, Sorin ; Walther, Christoph (2010):
Viable Approach to Machine-Checked Correctness Proof of Algorithm Variants in Elliptic Curve Cryptography.
pp. 95-101, Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2010), Kazan, Russia, June 14-15, 2010, [Conference or Workshop Item]

Item Type: Conference or Workshop Item
Erschienen: 2010
Creators: Anikeev, Maxim ; Madlener, Felix ; Schlosser, Andreas ; Huss, Sorin ; Walther, Christoph
Title: Viable Approach to Machine-Checked Correctness Proof of Algorithm Variants in Elliptic Curve Cryptography
Language: English
Uncontrolled Keywords: Secure Things
Divisions: 20 Department of Computer Science
20 Department of Computer Science > Programming Methodology
LOEWE
LOEWE > LOEWE-Zentren
LOEWE > LOEWE-Zentren > CASED – Center for Advanced Security Research Darmstadt
Event Title: Workshop on Program Semantics, Specification and Verification: Theory and Applications (PSSV 2010)
Event Location: Kazan, Russia
Event Dates: June 14-15, 2010
Date Deposited: 31 Dec 2016 00:15
Identification Number: ISS:Anikeev:2010:AViableAppro:189
Corresponding Links:
Export:
Suche nach Titel in: TUfind oder in Google
Send an inquiry Send an inquiry

Options (only for editors)
Show editorial Details Show editorial Details