[{"data": {"name": "Efficient RNS Reverse Converter using New Chinese Remainder Theorem I and the Moduli Set {24n, 22n+1, 2n+1, 2n-1}", "@type": "ScholarlyArticle", "genre": "journal-article", "author": [{"name": "Constant Akama", "@type": "Person"}], "@context": "http://schema.org/", "encoding": [{"@type": "MediaObject", "contentUrl": "https://doi.org/10.5120/ijca2018917701", "encodingFormat": "application/pdf"}], "publisher": {"name": "Foundation of Computer Science", "@type": "Organization"}, "identifier": [{"@type": "PropertyValue", "value": "10.5120/ijca2018917701", "propertyID": "DOI"}, {"@type": "PropertyValue", "value": "CCdQhtbZjQjyf-CTTyGkdAVWFk6-CDTLkvCFHtGpU-CRPEsha9Te4r8", "propertyID": "ISCC"}], "datePublished": "2018-08-14"}, "schema": "schema.org", "mediatype": "application/ld+json"}]