Last update: Sun Jan 21 02:03:58 MST 2018
@Article{Dunkelman:2012:MEK, author = "Orr Dunkelman", title = "From Multiple Encryption to Knapsacks --- Efficient Dissection of Composite Problems", journal = j-LECT-NOTES-COMP-SCI, volume = "7668", pages = "16--16", year = "2012", CODEN = "LNCSD9", DOI = "https://doi.org/10.1007/978-3-642-34931-7_2", ISSN = "0302-9743 (print), 1611-3349 (electronic)", ISSN-L = "0302-9743", bibdate = "Wed Dec 19 15:18:33 MST 2012", bibsource = "http://www.math.utah.edu/pub/tex/bib/lncs2012l.bib", URL = "http://link.springer.com/accesspage/chapter/10.1007/978-3-642-34931-7_2", acknowledgement = ack-nhfb, book-DOI = "https://doi.org/10.1007/978-3-642-34931-7", book-URL = "http://www.springerlink.com/content/978-3-642-34931-7", fjournal = "Lecture Notes in Computer Science", }