OpenAlex
PricingAboutJobs
Log inGet started
Work

Cryptographic Hardness based on the Decoding of Reed-Solomon Codes.

HTML

Year: 2007
Type: preprint
Source: IACR Cryptology ePrint Archive
Authors: Aggelos Kiayias, Moti Yung
Institutions: University of Connecticut, Columbia University
Language: English

Topic: Cryptography and Data Security
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Keywords: Reed-Solomon codes, cryptographic hardness, pseudorandomness, semantic security, pseudorandom number generators, forward secrecy, provable security

Open Access status: closed
OpenAlex ID: W3029859260
Cites: 20
Cited by: 1
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