Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
124
Voted
TC
2008
109
views
Information Technology
»
more
TC 2008
»
Low-Complexity Bit-Parallel Square Root Computation over GF(2^{m}) for All Trinomials
15 years 2 months ago
Download
eprint.iacr.org
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
Francisco Rodríguez-Henríquez, Guill...
claim paper
Read More »