Cryptographic primitives, error coding, and pseudo-random...

Details Cryptographic primitives, error coding, and pseudo-random... Cryptographic primitives, error coding, and pseudo-random...

2005-10-13

2011-10-18

Shiferaw, Eleni A (Department: 2437)

Cryptography

Particular algorithmic function encoding

C380S037000, C380S042000

Reexamination Certificate

active

08041031

ABSTRACT:
Stream ciphers, including synchronous stream ciphers, self-synchronizing stream ciphers, and totally asynchronous stream ciphers, employ a working key and a quasigroup transformation, where the quasigroup used is based on an initial secret key. Error-correction and pseudo-random number generation improver methods also employ quasigroup transformations.

REFERENCES:
patent: 5892829 (1999-04-01), Aiello et al.
patent: 7280663 (2007-10-01), Golomb et al.
patent: 2002/0154769 (2002-10-01), Petersen et al.
patent: 2003/0051026 (2003-03-01), Carter et al.
patent: 2003/0191950 (2003-10-01), Patel et al.
patent: 2004/0086117 (2004-05-01), Petersen et al.
C. Koscielny. Quasigroups for Cryptographic Applications. Int. J. Appl. Math. Comput. Sci., 2002, vol. 12, No. 4, 559-569. http://matwbn.icm.edu.pl/ksiazki/amc/amc12/amc12411.pdf.
Gligoroski et al. “The Stream Cipher Edon80.” 2008. New Stream Cipher Designs, LNCS 4986. pp. 152-169. Springer-Verlag Berlin Heidelberg 2008.
V. Dimitrova and J. Markovski, On Quasigroup Psuedo Random Sequence Generators, Institute of Informatics, Faculty ofNatural Sciences and Mathematics, Ss Cyril and Methodius University, Skopje, Macedonia, Proc. Of the 1stBalkan Conference in Informatics, Y. Manolopoulos and P. Spirakis eds., Nov. 21-23, 2004, Thessaloniki, Greece, pp. 393-401.
A. Juels, M. Jakobsson, E. Shriver and B. K. Hillyer, How to Turn Loaded Dice into Fair Coins, RSA Laboratories, RSA Data Security and Information Sciences Research Ctr., Bell Labs., Jul. 1998, Abstract and pp. 1-21.
S. Markovski, D. Gligoroski and J. Markovski, Classification of Quasigroups by Random Walk on Torus, University Ss Cyril and Methodius, Skopje, Macedonia, pp. 1-18.
D. Gligoroski, Stream Cipher Based on Quasigroup String Transformations in ZZp, Institute of Informatics, University St. Cyril and Methodius, Faculty of Natural Sciences, Institute of Informatics, Skopje, Republic of Macedonia, Dec. 2003, pp. 1-14.
D. Gligoroski, S. Markovski and V. Bakeva, On Infinite Class of Strongly Collision Resistant Hash Functions “EDON-F” with Variable Length of Output, Ss Cyril and Methodius University, Faculty of Sciences and Mathematics, Institute of Informatics, Skopje, Republic of Macedonia, Proc. 1stInternational Conference on Mathematics and Informatics for Industry, Thessaloniki, Greece, Apr. 2003, pp. 5.
S. Markovski, D. Gligoroski and S. Andova, Using Quasigroups for One-One Secure Encoding, University St. Cyril and Methodius, Faculty of Natural Sciences, Institute of Informatics, Skopje, Republic of Macedonia Proc. VIII Conf. Logic and Computer Science “LIRA '97”, Novi Sad, 1997, pp. 157-162, 6 pp.
S. Markovski, D. Gligoroski and V. Bakeva, Quasigroup String Processing: Part 1, University St. Cyril and Methodius, Faculty of Natural Sciences and Mathematics, Institute of Informatics, Skopje, Macedonia, Part 1, Proc. of Maced. Acad. of Sci. and Arts, Sc. Math. Tech. Scien. XX 1-2, 1999, 16 pp.
S. Markovski and V. Kusakatov, Quasigroup String Processing: Part 2, St. Cyril and Methodius University, Faculty of Sciences, Institute of Informatics, Skopje, Republic of Macedonia, MANU, XXI, 1-2, 2000, pp. 15-32, pp. 1-17 pp.
S. Markovski, D. Gligoroski and B. Stoj{hacek over (c)}evska, Secure Two-Way On-Line Communication by Using Quasigroup Enciphering with Almost Public Key, St. Cyril and Methodius University, Faculty of Sciences, Institute of Informatics, Skopje, Republic of Macedonia, Novi Sad Journal of Mathematics, 30, 2000, 8 pp.
S. Markovski, D. Gligoroski and V. Bakeva, Quasigroups and Hash Functions, Sixth International conference on Discrete Mathematics and Applications, Bansko, Bulgaria, Aug.-Sep. 2001, pp. 1-8.
B. D. McKay, A. Meynert and W. Myrvold, Small Latin Squares, Quasigroups and Loops, Department of Computer Science, Australian National University, Canberra, Australia, and Victoria, B.C., Canada, 28 pp.
A. Menezes, P. van Oorschot and S. Vanstone, Pseudorandom Bits and Sequences, Handbook of Applied Cryptography, Chapter 5, CRC Press, 1996, preamble and pp. 169-190.
C. E. Shannon, A Mathematical Theory of Communication, The Bell System Technical Journal, vol. 27, Jul.-Oct. 1948, pp. 379-423 and 623-656.

Affiliated with

Also associated with

Rating

Cryptographic primitives, error coding, and pseudo-random... does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Cryptographic primitives, error coding, and pseudo-random..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Cryptographic primitives, error coding, and pseudo-random... will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-4280969