Show simple item record

dc.contributor.authorPöppelmann, Thomas
dc.date.accessioned2018-01-23T10:14:18Z
dc.date.available2018-01-23T10:14:18Z
dc.date.issued2017
dc.identifier.issn1611-2776
dc.identifier.urihttp://dl.gi.de/handle/20.500.12116/14925
dc.description.abstractAlmost all practically relevant asymmetric cryptosystems like RSA or ECC are either based on the hardness of factoring or on the hardness of the discrete logarithm problem. However, both problems could be solved efficiently on a large enough quantum computer. While quantum computers powerful enough to break currently used parameter sets are not available yet, they are heavily researched and expected to reach maturity in 15 to 20 years. As a consequence, research on alternative quantum-safe cryptosystems is required. One alternative is lattice-based cryptography which allows the construction of asymmetric public-key encryption and signature schemes that offer a good balance between security, performance, and key as well as ciphertext sizes.en
dc.language.isoen
dc.publisherDe Gruyter
dc.relation.ispartofit - Information Technology: Vol. 59, No. 6
dc.subjectPost-quantum cryptography
dc.subjectpublic-key cryptosystem
dc.subjectembedded system
dc.subjectmicrocontroller
dc.subjectFPGA
dc.titleEfficient implementation of ideal lattice-based cryptographyen
dc.typeText/Journal Article
dc.pubPlaceBerlin
mci.reference.pages305-309
mci.conference.sessiontitleDistinguished Dissertations
gi.identifier.doi10.1515/itit-2017-0030


Files in this item

FilesSizeFormatView

There are no files associated with this item.

Show simple item record