Abstract
The doctrine in cryptology is that the algorithm of encryption is known to the adversary (Eve) and that the only thing that is kept secret is the key, which normally is a bitsequence or a sequence of natural numbers or elements of a finite ring (e.g. a residue ring or a finite field). Mostly, such key sequences are produced by an algorithmic generator (i.e., they are socalled pseudo-random numbers), since these offer the following benefits: the sequence of numbers can be reproduced for debugging and testing; no special hardware is necessary; a large quantity of random numbers can be produced in a short time.
Sign-in/Register to access full text options 
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.
