Formal Verification of the CRC Algorithm Properties
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216305%3A26230%2F06%3APU66990" target="_blank" >RIV/00216305:26230/06:PU66990 - isvavai.cz</a>
Alternative codes found
RIV/00216224:14330/06:00015972
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Formal Verification of the CRC Algorithm Properties
Original language description
This paper presents the verification of CRC algorithm properties. We examine<br>a way of verifying of a CRC algorithm using exhaustive state space exploration<br>by model checking method. The CRC algorithm is used for calculation of a<br>message hash value and we focus on verification of the property of finding<br>minimal Hamming distance between two messages having the same hash value. We<br>deal with 16, 32 and 64 bits CRC generator polynomials, especially<br>with one used in the Liberouter project.
Czech name
Formální verifikace vlastností algoritmu CRC
Czech description
This paper presents the verification of CRC algorithm properties. We examine<br>a way of verifying of a CRC algorithm using exhaustive state space exploration<br>by model checking method. The CRC algorithm is used for calculation of a<br>message hash value and we focus on verification of the property of finding<br>minimal Hamming distance between two messages having the same hash value. We<br>deal with 16, 32 and 64 bits CRC generator polynomials, especially<br>with one used in the Liberouter project.
Classification
Type
D - Article in proceedings
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
Result was created during the realization of more than one project. More information in the Projects tab.
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2006
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
MEMICS 2006 Second Doctoral Workshop on Mathematical and Engineering Methods in Computer Science
ISBN
80-214-3287-X
ISSN
—
e-ISSN
—
Number of pages
8
Pages from-to
55-62
Publisher name
NEUVEDEN
Place of publication
Mikulov
Event location
Mikulov
Event date
Oct 27, 2006
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—