Abstract
This paper establishes the need for a small Domain Specific Language to support rapid testing and diagnosis of cryptographic algorithm. Such a language will require built-in support for modulo arithmetic, which is used for creating mathematical locks in modern crypto systems. The paper also provides a framework/prototype for such a language. It can further be used as a building block for broader set of language specific features. General Terms Cryptographic Algorithms, Domain Specific Language, Compiler, Parser, Lexer.
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.
