For the current REF see the REF 2021 website REF 2021 logo

Output details

11 - Computer Science and Informatics

Royal Holloway, University of London

Return to search Previous output Next output
Output 0 of 0 in the submission
Output title

Geometric Ideas for Cryptographic Equation Solving in Even Characteristic

Type
E - Conference contribution
Name of conference/published proceedings
Cryptography and Coding: 12th IMA International Conference, Cryptography and Coding 2009, Cirencester, UK, December 15-17, 2009: Proceedings
Volume number
5921
Issue number
-
First page of article
202
ISSN of proceedings
0302-9743
Year of publication
2009
Number of additional authors
1
Additional information

<18> This paper extends the ideas of "A Geometric View of Cryptographic Equation Solving" [Output 1] for fields of large characteristic to fields of characteristic 2, which is obviously a situation of vital cryptographic importance, leading to the development of a cryptographic equation solving algorithm for fields of characteristic 2. This paper therefore has to deal with the usual type of issues that arise when considering structures based on a field of characteristic 2, so the resulting geometric theory and algorithm in this paper has important and non-obvious differences from our earlier paper.

Interdisciplinary
-
Cross-referral requested
-
Research group
E - Information Security Group
Citation count
0
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-