On the computation of square roots in finite fields
type: Item
instance of: scholarly article
title: On the computation of square roots in finite fields
zbMATH Open document ID: 1052.11084
author: Yanyan Li
published in: Designs, Codes and Cryptography
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 11Y16
Mathematics Subject Classification ID: 68W40
Mathematics Subject Classification ID: 11T06
zbMATH DE Number: 2093322
zbMATH Keywords: finite fields
zbMATH Keywords: square roots
zbMATH Keywords: efficient computation
zbMATH Keywords: complexity
describes a project that uses: Magma
describes a project that uses: Maple
describes a project that uses: Mathematica
MaRDI profile type: Publication
full work available at URL: b:desi.0000015890.44831.e2
OpenAlex ID: W1983120807
DOI: 10.1023/B:DESI.0000015890.44831.E2
Recommended article: Computing Square Roots in Finite Fields
Recommended article: Improved Computation of Square Roots in Specific Finite Fields
Recommended article: Q6039849
Recommended article: A note on square roots in finite fields
Recommended article: Efficient computation of roots in finite fields
Recommended article: Square Root Computation over Even Extension Fields
Recommended article: Q4249708
Recommended article: Elliptic Curves Over Finite Fields and the Computation of Square Roots mod p
Recommended article: Fast algorithm of square rooting in some finite fields of odd characteristic
Recommended article: A High-Speed Square Root Algorithm in Extension Fields
description: scientific article; zbMATH DE number 2093322