Please use this identifier to cite or link to this item: http://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8195
Full metadata record
DC FieldValueLanguage
dc.contributor.authorKumar, Gautam-
dc.contributor.authorSaini, Hemraj-
dc.date.accessioned2022-11-07T11:45:45Z-
dc.date.available2022-11-07T11:45:45Z-
dc.date.issued2020-
dc.identifier.urihttp://ir.juit.ac.in:8080/jspui/jspui/handle/123456789/8195-
dc.description.abstractAn Elliptic Curve Cryptography (ECC) is used on the Noncommutative Cryptographic (NCC) principles. The security and strengths of the manuscript are resilient on these two cryptographic assumptions.The claims on theNoncommutative cryptographic scheme on monomials generated elements is considered be based on hidden subgroup or subfield problems that strengthen this manuscript, where original assumptions are hidden and its equivalents semiring takes part in the computation process. In relation to the same, the research gap is well designed on Dihedral orders of 6 and 8, but our contributions are in security- and length-based attacks enhancement over Dihedral order 12, reported in work done.We modeled the said strategies and represent the ideal security concerns for applications.en_US
dc.language.isoenen_US
dc.publisherSpringer Nature Singapore Pte Ltd.en_US
dc.subjectNoncommutative cryptographyen_US
dc.subjectMonomials generationsen_US
dc.titleAn ECC with Probable Secure and Efficient Approach on Noncommutative Cryptographyen_US
dc.typeBook chapteren_US
Appears in Collections:Book Chapters

Files in This Item:
File Description SizeFormat 
An ECC with Probable Secure and Efficient Approach on Noncommutative Cryptography.pdf334.41 kBAdobe PDFView/Open


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.