Cryptography in quadratic function fields (Q5931254): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1008346322837 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1490483367 / rank
 
Normal rank

Latest revision as of 10:22, 30 July 2024

scientific article; zbMATH DE number 1590767
Language Label Description Also known as
English
Cryptography in quadratic function fields
scientific article; zbMATH DE number 1590767

    Statements

    Cryptography in quadratic function fields (English)
    0 references
    0 references
    18 May 2002
    0 references
    The paper considers the discrete logarithm problem in quadratic function fields of odd characteristic. In the imaginary representation of such a field, this is the discrete logarithm problem in the ideal class group of the field, or equivalently, in the Jacobian of the curve defining the function field. In the real case, the problem in question is the task of computing distances in the set of reduced principal ideals, which is a monoid under a suitable operation. Currently, the best general algorithms for solving both discrete logarithm problems are exponential (sub-exponential only in fields of high genus), resulting in a possibly higher level of security than that of conventional discrete logarithm based schemes. The paper also provides the algorithms necessary to use these fields for cryptography. Finally, the paper describes how these algorithms can be used to do Diffie-Hellman key-exchange and ElGamal-like signature and encryption schemes in these fields.
    0 references
    0 references
    quadratic function fields
    0 references
    signature schemes
    0 references
    encryption schemes
    0 references
    key-exchange
    0 references
    discrete logarithm problem
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references