OpenAlex
PricingAboutJobs
Log inGet started
Work

Fast and Secure Root Finding for Code-Based Cryptosystems

HTML

Year: 2012
Type: conference-paper
Source: Lecture notes in computer science
Parent work: Cryptology and Network Security: 11th International Conference, CANS 2012, Darmstadt, Germany, December 12-14, 2012. Proceedings
DOI: 10.1007/978-3-642-35404-5_18
Author: Falko Strenzke
Institution: Technische Universität Darmstadt
Language: English

Topic: Coding theory and cryptography
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Keywords: code-based cryptography, error locator polynomial, root finding, decoding, timing attacks, side-channel attacks, finite field representation, software implementation, public key size

Open Access status: closed
OpenAlex ID: W51430393
FWCI: 2.452
Cites: 21
Cited by: 14
Related to: 10
OpenAlex
Nonprofit
Open DataOpen Data
Open Source
Product
Search
Compare
Pricing
Repositories
Unpaywall
Unsub
Developers
API docs
Data snapshot
Status
Source code
Organization
About
Team
Testimonials
Brand
Jobs
Community
Help center
Contact
Events
Blog
Mailing list
Subscribe
Supporters
Legal
Privacy
Accessibility
Terms
Security