Abstract
Abstract The classical McEliece scheme for combined encryption and coding is based on error-correcting codes. We study a variation where codes are replaced by lattices. Dealing with continuous rather than discrete signals eliminates most classical attacks. Decoding a lattice is known to be NP-complete and an universal decoding algorithm is discussed in low dimensions (≤ 100). Classes of lattices with polynomial time decoding algorithms are explored. Further, by replacing decoding by complete decoding, a scheme is obtained which combines signature and quantizing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
