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
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
42
click to vote
ANTS
2004
Springer
favorite
Email
discuss
report
95
views
Algorithms
»
more
ANTS 2004
»
Using Primitive Subgroups to Do More with Fewer Bits
14 years 3 months ago
Download
eprint.iacr.org
Abstract. This paper gives a survey of some ways to improve the efficiency of discrete log-based cryptography by using the restriction of scalars and the geometry and arithmetic of algebraic tori and abelian varieties.
Karl Rubin, Alice Silverberg
Real-time Traffic
Abelian Varieties
|
Algebraic Tori
|
Algorithms
|
ANTS 2004
|
Discrete Log-based Cryptography
|
claim paper
Post Info
More Details (n/a)
Added
20 Aug 2010
Updated
20 Aug 2010
Type
Conference
Year
2004
Where
ANTS
Authors
Karl Rubin, Alice Silverberg
Comments
(0)
Researcher Info
Algorithms Study Group
Computer Vision