Row, Row, Row Your Boat: How to Not Find Weak Keys in Pilsung

نویسندگان

چکیده

Abstract The Pilsung cipher is part of the North Korean Red Star operating system, which was leaked to West in 2014. Initial analysis by Kryptos Logic reported a possibility class weak keys due use pseudo-random diffusion. Following this lead, we analyzed and identified small such keys. We developed techniques for searching key that belongs class. After spending thousands CPU hours, found supposedly slightly weaker version Pilsung, but did not behave as expected. On further investigation out crucial misunderstanding critical no exists Pilsung. Thus, paper makes two main contributions art cryptanalysis. First, it identifies shows how investigate potential weakness randomizing diffusion, although does exist may affect future designs. Second, highlights need early verification results order identify errors before expending significant resources.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Data Dependence Boundary Row Boundary Row Node

Though more diicult to program, distributed-memory parallel machines provide greater scalability than their shared-memory counterparts. Distributed Shared Memory (DSM) systems provide the abstraction of shared memory on a distributed machine. While DSMs provide an attractive programming model, they currently can not eeciently support all classes of scientiic applications. One such class are tho...

متن کامل

Getting Your Quarks in a Row

This reprint is provided for personal and noncommercial use. For any other use, please send a request Brian Hayes by electronic mail to [email protected].

متن کامل

Row by row methods for semidefinite programming

We present a row-by-row (RBR) method for solving semidefinite programming (SDP) problem based on solving a sequence of problems obtained by restricting the n-dimensional positive semidefinite constraint on the matrix X. By fixing any (n − 1)-dimensional principal submatrix of X and using its (generalized) Schur complement, the positive semidefinite constraint is reduced to a simple second-order...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 2022

ISSN: ['0010-4620', '1460-2067']

DOI: https://doi.org/10.1093/comjnl/bxac092