Odd-char Hidden Field Equations Analysis
One of the most important questions of hidden field equations (HFE) adaptability is a question of searching for a set of parameters of the algorithm, that will give maximum increase of encrypting/decrypting speed (speed of signing/validating signature), providing at the same time optimal values for...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Moscow Engineering Physics Institute
2010-03-01
|
| Series: | Bezopasnostʹ Informacionnyh Tehnologij |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/779 |
| Summary: | One of the most important questions of hidden field equations (HFE) adaptability is a question of searching for a set of parameters of the algorithm, that will give maximum increase of encrypting/decrypting speed (speed of signing/validating signature), providing at the same time optimal values for other algorithm characteristics, such as signature length, public key length, time of key pair generation. Applications of HFE, such as Quartz, Flash and SFlash, use the field F |
|---|---|
| ISSN: | 2074-7128 2074-7136 |