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
51
search results - page 11 / 11
»
icisc 2007
Sort
relevance
views
votes
recent
update
View
thumb
title
165
Voted
ICISC
2000
126
views
Cryptology
»
more
ICISC 2000
»
Cryptographic Applications of Sparse Polynomials over Finite Rings
15 years 5 months ago
Download
www.math.missouri.edu
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...
claim paper
Read More »
« Prev
« First
page 11 / 11
Last »
Next »